Modal nonmonotonic logics revisited: Efficient encodings for the basic reasoning tasks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2381, Issue , 2002, Pages 100-114

  Eiter, Thomas ^a   Klotz, Volker ^a   Tompits, Hans ^a   Woltran, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; EVALUATION PROBLEMS; NONMONOTONIC LOGIC; POLYNOMIAL REDUCTION; PROTOTYPE REASONING; QUANTIFIED BOOLEAN FORMULAS; REDUCTION TECHNIQUES; THEORETICAL POINTS; KNOWLEDGE REPRESENTATION FORMALISM;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; BENCHMARKING; BOOLEAN FUNCTIONS; ENCODING (SYMBOLS); FORMAL LOGIC; KNOWLEDGE REPRESENTATION;

FORMAL LOGIC; BOOLEAN ALGEBRA;

EID: 84885207705     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45616-3_8     Document Type: Article

References (37)

1. P. Bonatti and N. Olivetti. Sequent Calculi for Propositional Nonmonotonic Logics. ACM Transactions on Computational Logic, 2002. to appear.
2. G. Brewka. Tweety - Still Flying: Some Remarks on Abnormal Birds, Applicable Rules and a Default Prover. In Proc. AAAI-86, pages 8-12, 1986.
3. G. Brewka. Nonmonotonic Reasoning: Logical Foundations of Commonsense. Cambridge University Press, 1991.
4. G. Brewka and K. Wittur. Nichtmonotone Logiken. Universität Bonn, Informatik Berichte 40, 1984.
5. M. Cadoli, A. Giovanardi, and M. Schaerf. An Algorithm to Evaluate Quantified Boolean Formulae. In Proc. AAAI-98, pages 262-267, 1998.
6. P. Cholewinski, W. Marek, and M. Truszcyński. Default Reasoning System DeReS. In Proc. KR-96, pages 518-528, 1996.
7. J. Delgrande, T. Schaub, H. Tompits, and S. Woltran. On Computing Solutions to Belief Change Scenarios. In Proc. ECSQARU-01, pages 510-521, 2001.
8. E. Eder. Relative Complexities of First-Order Calculi. Vieweg Verlag, 1992.
9. U. Egly. On Different Structure-preserving Translations to Normal Form. Journal of Symbolic Computation, 22:121-142, 1996.
10. U. Egly, T. Eiter, V. Klotz, H. Tompits, and S. Woltran. Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. InProc.AAAI Spring Symposium-01, pages 53-59, 2001.
11. U. Egly, T. Eiter, H. Tompits, and S. Woltran. Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. In Proc. AAAI-00, pages 417-422, 2000.
12. U. Egly, V. Klotz, H. Tompits, and S. Woltran. A Toolbox for Abduction: Preliminary Report. InProc. IJCAR-Workshop on Theory and Applications of Quantified Boolean Formulas, pages 29-39, 2001.
13. T. Eiter and G. Gottlob. Complexity of Reasoning with Parsimonious and Moderately Grounded Expansions. Fundamenta Informaticae, 17(1-2):31-53, 1992.
14. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. A Deductive System for Nonmonotonic Reasoning. In Proc. LPNMR-97, pages 363-374, 1997.
15. R. Feldmann, B. Monien, and S. Schamberger. A Distributed Algorithm to Evaluate Quantified Boolean Formulas. In Proc. AAAI-00, pages 285-290, 2000.
16. M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In Proc. ICLP-88, pages 1070-1080, 1988.
17. I. P. Gent and T. Walsh. Beyond NP: The QSAT Phase Transition. In Proc. AAAI-99, pages 648-653, 1999.
18. E. Giunchiglia, M. Narizzano, and A. Tacchella. QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability. In Proc. IJCAR-01, pages 364-369, 2001.
19. G. Gottlob. Complexity Results for Nonmonotonic Logics. Journalof Logic and Computation, 2(3):397-425, 1992.
20. G. Gottlob. Translating Default Logic into Standard Autoepistemic Logic. Journal of the ACM, 42(4):711-740, 1995.
21. U. Junker and K. Konolige. Computing the Extensions of Autoepistemic and Default Logic with a TMS. In Proc. AAAI-90, pages 278-283, 1990.
22. H. Kautz and B. Selman. Planning as Satisfiability. In Proc. ECAI-92, pages 359-363, 1992.
23. H. Kleine-Büning, M. Karpinski, and A. Flögel. Resolution for Quantified Boolean Formulas. Information and Computation, 117(1):12-18, 1995.
24. K. Konolige. On the Relation Between Default and Autoepistemic Logic. Artificial Intelligence, 35(3):343-382, 1988.
25. R. Letz. Advances in Decision Procedures for Quantified Boolean Formulas. In Proc. IJCAR-Workshop on Theory and Applications of Quantified Boolean Formulas, pages 55-64, 2001.
26. W. Marek and M. Truszczyński. Modal Logic for Default Reasoning. Annals of Mathematics and Artificial Intelligence, 1:275-302, 1990.
27. F. Massacci. Design and Results of the Tableaux-99 Non-classical (Modal) Systems Comparison. In Proc. TABLEAUX-99, pages 14-18, 1999.
28. J. McCarthy. Circumscription - A Form of Nonmonotonic Reasoning. Artificial Intelligence, 13:27-39, 1980.
29. R. C. Moore. Semantical Considerations on Nonmonotonic Logic. Artificial Intelligence, 25(1):75-94, 1985.
30. I. Niemelä. On the Decidability and Complexity of Autoepistemic Reasoning. Fundamenta Informaticae, 17:117-155, 1992.
31. I. Niemelä and P. Simons. Smodels: An Implementation of the Stable Model and Well-Founded Semantics for Normal Logic Programs. In Proc. LPNMR-97, pages 420-429, 1997.
32. D. Pearce, H. Tompits, and S. Woltran. Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. In Proc. EPIA-01, pages 306-320. Springer, 2001.
33. D. A. Plaisted and S. Greenbaum. A Structure Preserving Clause Form Translation. Journal of Symbolic Computation, 2(3):293-304, 1986.
34. T. Przymusinski. Stable Semantics for Disjunctive Programs. New Generation Computing Journal, 9:401-424, 1991.
35. R. Reiter. A Logic for Default Reasoning. Artificial Intelligence, 13(1-2):81-132, Apr. 1980.
36. J. Rintanen. Constructing Conditional Plans by a Theorem Prover. Journal of Artificial Intelligence Research, 10:323-352, 1999.
37. J. Rintanen. Improvements to the Evaluation of Quantified Boolean Formulae. In Proc. IJCAI-99, pages 1192-1197, 1999.