Show simple item record

dc.contributor.authorDimopoulos, Yannisen
dc.contributor.authorNebel, B.en
dc.contributor.authorToni, F.en
dc.creatorDimopoulos, Yannisen
dc.creatorNebel, B.en
dc.creatorToni, F.en
dc.description.abstractBased on an abstract framework for nonmonotonic reasoning, Bondarenko et at. have extended the logic programming semantics of admissible and preferred arguments to other nonmonotonic formalisms such as circumscription, autoepisternic logic and default logic. Although the new semantics have been tacitly assumed to mitigate the computational problems of nonmonotonic reasoning under the standard semantics of stable extensions, it seems questionable whether they improve the worst-case behaviour. As a matter of fact, we show that credulous reasoning under the new semantics in propositional logic programming and prepositional default logic has the same computational complexity as under the standard semantics. Furthermore, sceptical reasoning under the admissibility semantics is easier - since it is trivialised to monotonic reasoning. Finally, sceptical reasoning under the preferability semantics is harder than under the standard semantics.en
dc.sourceIJCAI International Joint Conference on Artificial Intelligenceen
dc.source16th International Joint Conference on Artificial Intelligence, IJCAI 1999en
dc.subjectArtificial intelligenceen
dc.subjectLogic programmingen
dc.subjectFormal logicen
dc.subjectPropositional logicen
dc.subjectDefault logicen
dc.subjectNon-monotonic reasoningen
dc.subjectAbstract frameworken
dc.subjectAdmissibility semanticsen
dc.subjectComputational problemen
dc.subjectLogic programming semanticsen
dc.titlePreferred arguments are harder to compute than stable extensionsen
dc.description.endingpage41 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeConference Objecten
dc.description.notes<p>Sponsors: International Joint Conferences on Artificialen
dc.description.notesIntelligence, Inc. (IJCAII)en
dc.description.notesScandinavian AI Societiesen
dc.description.notesConference code: 97869en
dc.description.notesCited By :28</p>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