A decision method for nonmonotonic reasoning based on autoepistemic reasoning

Journal of Automated Reasoning

Volumn 14, Issue 1, 1995, Pages 3-42

  Niemelä, Ilkka ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

autoepistemic logic; automated theorem proving; default logic

Indexed keywords

EID: 0039149025     PISSN: 01687433     EISSN: 15730670     Source Type: Journal    
DOI: 10.1007/BF00883929     Document Type: Article

References (50)

1. Embedding defaults into terminological knowledge representation formalisms
2. Linear-time algorithms for testing the satisfiability of propositional Horn formulae
3. A truth maintenance system
4. Propositional circumscription and extended closed world reasoning are II2p-complete
5. A rational reconstruction of nonmonotonic truth maintenance systems
6. The stable model semantics for logic programming
7. Logic programs with classical negation
8. Formalization of inheritance reasoning in autoepistemic logic
9. Complexity results for nonmonotonic logics
10. The power of beliefs or translating default logic into standard autoepistemic logic
11. Computing the extensions of autoepistemic and default logics with a truth maintenance system
12. Generalized stable models: a semantics for abduction
13. Hard problems for simple default logics
14. On the relation between default and autoepistemic logic
15. On the relation between autoepistemic logic and circumscription
16. Computing circumscription
17. Nonmonotonic databases and epistemic queries
18. Epistemic semantics for fixed-point non-monotonic logics
19. Stable theories in autoepistemic logic
20. Modal nonmonotonic logics: Ranges, characterization, computation
21. Autoepistemic logic
22. Computing intersection of autoepistemic expansions
23. Semantical considerations on nonmonotonic logic
24. Autoepistemic logic
25. Decision procedure for autoepistemic logic
26. Decision problem in autoepistemic logic
27. Towards automatic autoepistemic reasoning
28. Constructive tightly grounded autoepistemic reasoning
29. On the decidability and complexity of autoepistemic reasoning
30. A unifying framework for nonmonotonic reasoning
31. On the impact of stratification on the complexity of nonmonotonic reasoning
32. A logical framework for default reasoning
33. A logic for default reasoning
34. A tableau-based characterisation for default logic
35. Abductive and default reasoning: A computational core
36. Autoepistemic modal logics
37. On the existence of fixpoints in Moore's autoepistemic logic and the non-monotonic logic of McDermott and Doyle
38. It's not my default: The complexity of membership problems in restricted propositional default logics
39. The complexity of propositional default logics
40. Embedding default logic into modal nonmonotonic logics