The Complexity of Reasoning for Fragments of Autoepistemic Logic

@article{Creignou2012TheCO,
  title={The Complexity of Reasoning for Fragments of Autoepistemic Logic},
  author={N. Creignou and A. Meier and H. Vollmer and M. Thomas},
  journal={ACM Trans. Comput. Log.},
  year={2012},
  volume={13},
  pages={17:1-17:22}
}
  • N. Creignou, A. Meier, +1 author M. Thomas
  • Published 2012
  • Computer Science, Mathematics
  • ACM Trans. Comput. Log.
  • 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 in 1985 for modeling an ideally rational agent’s behavior and reasoning about his own beliefs. In this article 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… CONTINUE READING
    15 Citations
    The Complexity of Theorem Proving in Autoepistemic Logic
    • 5
    • PDF
    Complexity of non-monotonic logics
    • 9
    • PDF
    On the parameterized complexity of non-monotonic logics
    • 6
    Parameterised Complexity for Abduction
    • 1
    • PDF
    Parameterised Complexity of Abduction in Schaefer's Framework
    Parametrised Complexity of Satisfiability in Temporal Logic
    • 6
    • PDF
    Generalized Complexity of ALC Subsumption
    • A. Meier
    • Mathematics, Computer Science
    • ArXiv
    • 2012
    • PDF
    On the Complexity of Modal Logic Variants and their Fragments
    • 9
    • PDF
    Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting
    • 9

    References

    SHOWING 1-9 OF 9 REFERENCES
    Towards Automatic Autoepistemic Reasoning
    • 40
    • Highly Influential
    The Complexity of Circumscriptive Inference in Post’s Lattice
    • Michael Thomas
    • Computer Science, Mathematics
    • Theory of Computing Systems
    • 2010
    • 14
    • Highly Influential
    • PDF
    Counting Complexity of Propositional Abduction
    • 34
    • Highly Influential
    • PDF
    Generalized modal satisfiability
    • 37
    • Highly Influential
    • PDF
    Subtractive Reductions and Complete Problems for Counting Complexity Classes
    • 37
    • Highly Influential
    • PDF
    The Complexity of Enumeration and Reliability Problems
    • L. Valiant
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 1979
    • 1,856
    • Highly Influential
    • PDF
    Complexity Results for Nonmonotonic Logics
    • G. Gottlob
    • Mathematics, Computer Science
    • J. Log. Comput.
    • 1992
    • 373
    • Highly Influential
    The complexity of circumscriptive inference in Post’s lattice
    • Proc. 10th LPNMR, volume 5753 of LNCS, pages 290–302. Springer
    • 2009
    Semantical Considerations on Modal Logic
    • 613
    • Highly Influential