Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical Perspective

Logic Programs with Ordered Disjunction (LPODs) extend classical logic programs with the capability of expressing preferential disjunctions in the heads of program rules. The initial semantics of LPODs, although simple and quite intuitive, is not purely model-theoretic. A consequence of this is that...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Charalambidis, Angelos, Nomikos, Christos, Rondogiannis, Panos
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Artificial Intelligence Computer Science - Logic in Computer Science
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!