Show simple item record

dc.contributor.authorDimopoulos, Yannisen
dc.contributor.editorMacNish C.en
dc.contributor.editorPereira L.M.en
dc.contributor.editorPearce D.en
dc.creatorDimopoulos, Yannisen
dc.description.abstractIn 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. © 1994, Springer Verlag. All rights reserved.en
dc.sourceEuropean Workshop on Logics in Artificial Intelligence, JELIA 1994en
dc.subjectArtificial intelligenceen
dc.subjectGraph theoryen
dc.subjectGraph structuresen
dc.subjectComputer circuitsen
dc.subjectFormal logicen
dc.subjectPropositional logicen
dc.subjectComputational featuresen
dc.subjectComputational valueen
dc.subjectDefault logicen
dc.subjectDefault reasoningen
dc.subjectStable model semanticsen
dc.subjectTheoretical structureen
dc.titleThe computational value of joint consistencyen
dc.description.volume838 LNAIen
dc.description.endingpage65 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.description.notesConference code: 167509en
dc.description.notesCited By :3</p>en
dc.source.abbreviationLect. Notes Comput. Sci.en
dc.contributor.orcidDimopoulos, Yannis [0000-0001-9583-9754]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record