de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

The Computational Value of Joint Consistency

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44325

Dimopoulos,  Yannis
Programming Logics, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Dimopoulos, Y. (1994). The Computational Value of Joint Consistency. In C. MacNish, D. Pearce, & L. M. Pereira (Eds.), Logics in Artificial Intelligence: Proceedings of the JELIA'94 (pp. 50-65). Berlin, Germany: Springer.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0014-ADAE-6
Zusammenfassung
In this paper we investigate the complexity of some recent reconstructions of Reiter's Default Logic using graph-theoretical structures. It turns out that requiring joint consistency of the justification of the applied rules has serious effects on the computational features of default reasoning. Namely, many of the intractability problems of Reiter's original approach, in some cases disappear in the new frameworks. However, interesting problems remain intractable. We also present a propositional semantics for those approaches, stemming from the translation of the graph structures into propositional logic. Finally, the constraint stable model semantics is introduced, and proved to be related to the notion of joint consistency.