Fixpoint & Proof-theoretic Semantics for CLP with Qualification and Proximity

Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause annotations based on uncertain truth values, qualification values a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2011-01
Hauptverfasser:	Rodríguez-Artalejo, Mario, Romero-Díaz, Carlos A
Format:	Artikel
Sprache:	eng
Schlagworte:	Annotations Domains Logic programming Proposals Proximity Semantics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!