Semantical considerations on nonmonotonic logic
Artificial Intelligence
The complexity of facets resolved
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Journal of the ACM (JACM)
Extended logic programs as autoepistemic theories
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Translating default logic into standard autoepistemic logic
Journal of the ACM (JACM)
Theories of computability
A note on closure properties of logspace MOD classes
Information Processing Letters
On the intertranslatability of non-monotonic logics
Annals of Mathematics and Artificial Intelligence
Towards Automatic Autoepistemic Reasoning
JELIA '90 Proceedings of the European Workshop on Logics in AI
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science - Mathematical foundations of computer science 2000
On the counting complexity of propositional circumscription
Information Processing Letters
The Complexity of Satisfiability for Fragments of CTL and CTL*;
Electronic Notes in Theoretical Computer Science (ENTCS)
Fast Counting with Bounded Treewidth
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments
Electronic Notes in Theoretical Computer Science (ENTCS)
The Complexity of Reasoning for Fragments of Default Logic
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
The complexity of propositional implication
Information Processing Letters
The Complexity of Circumscriptive Inference in Post's Lattice
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Counting complexity of propositional abduction
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The Complexity of Problems for Quantified Constraints
Theory of Computing Systems
Sets of boolean connectives that make argumentation easier
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Generalized modal satisfiability
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On the parameterized complexity of default logic and autoepistemic logic
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Parameterized complexity of weighted satisfiability problems
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
The complexity of theorem proving in autoepistemic logic
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
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 contribution we classify the computational complexity of checking that a given set of formulae characterizes a stable expansion and that of counting the number of stable expansions of a given knowledge base. We improve the best known Δ2p-upper bound on the former problem to completeness for the second level of the Boolean hierarchy. To the best of our knowledge, this is the first paper analyzing counting problem for autoepistemic logic.