License
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.10061.6
URN: urn:nbn:de:0030-drops-25234
URL: https://drops.dagstuhl.de/opus/volltexte/2010/2523/
Go to the corresponding Portal


Creignou, Nadia ; Meier, Arne ; Thomas, Michael ; Vollmer, Heribert

The Complexity of Reasoning for Fragments of Autoepistemic Logic

pdf-format:
10061.ThomasMichael.Paper.2523.pdf (0.3 MB)


Abstract

Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore 1985 for modeling an ideally rational agent's behavior and reasoning about his own beliefs.
In this paper we analyze all Boolean fragments of autoepistemic logic with respect to the computational complexity of the three most common decision problems expansion existence, brave reasoning and cautious reasoning. As a second contribution we classify
the computational complexity of counting the number of stable expansions of a given knowledge base. To the best of our knowledge this is the first paper analyzing the counting problem for autoepistemic logic.


BibTeX - Entry

@InProceedings{creignou_et_al:DagSemProc.10061.6,
  author =	{Creignou, Nadia and Meier, Arne and Thomas, Michael and Vollmer, Heribert},
  title =	{{The Complexity of Reasoning for Fragments of Autoepistemic Logic}},
  booktitle =	{Circuits, Logic, and Games},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10061},
  editor =	{Benjamin Rossman and Thomas Schwentick and Denis Th\'{e}rien and Heribert Vollmer},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2010/2523},
  URN =		{urn:nbn:de:0030-drops-25234},
  doi =		{10.4230/DagSemProc.10061.6},
  annote =	{Keywords: Autoepistemic logic, computational complexity, nonmonotonic reasoning, Post's lattice}
}

Keywords: Autoepistemic logic, computational complexity, nonmonotonic reasoning, Post's lattice
Collection: 10061 - Circuits, Logic, and Games
Issue Date: 2010
Date of publication: 26.04.2010


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI