Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics

Sequent calculi for skeptical consequence in predicate default logic, predicate stable model logic programming, and infinite autoepistemic theories are presented and proved sound and complete. While skeptical consequence is decidable in the finite propositional case of all three formalisms, the move...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Annals of mathematics and artificial intelligence 2005-05, Vol.44 (1-2), p.1-34
1. Verfasser:	Milnikel, Robert Saxon
Format:	Artikel
Sprache:	eng
Schlagworte:	Logic programming Reasoning
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!