Solving Advanced Reasoning Tasks using Quantified Boolean Formulas

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 417-422

  Egly, Uwe ^a   Eiter, Thomas ^a   Tompits, Hans ^a   Woltran, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS;

EVALUATION PROBLEMS; NATURAL GENERALIZATION; NON-MONOTONIC REASONING; NP PROBLEMS; PERFORMANCE; PROTOTYPE REASONING; PROTOTYPE SYSTEM; QUANTIFIED BOOLEAN FORMULAS; REASONING SYSTEM; REASONING TASKS;

KNOWLEDGE REPRESENTATION;

EID: 85158144132     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. bddlib. http://www.cs.cmu.edu/~modelcheck/bdd.html.
2. Bryant, R. E. 1986. Graph-based Algorithms for Boolean Function Manipulation. IEEE Trans. Comp. 35(8):677-691.
3. Cadoli, M.; Giovanardi, A.; and Schaerf, M. 1998. An Algorithm to Evaluate Quantified Boolean Formulae. In Proc. AAAI-98, 262-267.
4. Cholewinski, P.; Marek, V. W.; Mikitiuk, A.; and Truszczyński, M. 1995. Experimenting with Nonmonotonic Reasoning. In Proc. ICLP-95, 267-282.
5. Cholewinski, P.; Marek, V. W.; and Truszczyński, M. 1996. Default Reasoning System DeReS. In Proc. KR-96, 518-528.
6. Eiter, T.; Leone, N.; Mateis, C.; Pfeifer, G.; and Scarcello, F. 1997. A Deductive System for Nonmonotonic Reasoning. In Proc. LPNMR-97, 363-374.
7. Gelfond, M., and Lifschitz, V. 1988. The Stable Model Semantics for Logic Programming. In Proc. 5th ICSLP, 1070-1080.
8. Gottlob, G. 1995. The Complexity of Propositional Default Reasoning Under the Stationary Fixed Point Semantics. Information and Computation. 121:81-92.
9. Kautz, H., and Selman, B. 1996. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search. In Proc. AAAI-96, 1194-1201.
10. Kleine Büning, H.; Karpinski, M.; and Flögel, A. 1995. Resolution for Quantified Boolean Formulas. Information and Computation 117(1):12-18.
11. Lifschitz, V. 1985. Computing Circumscription. In Proc. IJCAI-85, 121-127.
12. Marek, W., and Truszczyński, M. 1993. Nonmonotonic Logics. Springer.
13. McCarthy, J. 1980. Circumscription - A Form of Non-Monotonic Reasoning. Artificial Intelligence 13:27-39.
14. Moore, R. 1985. Semantical Considerations on Nonmonotonic Logics. Artificial Intelligence 25:75-94.
15. Niemelä, I., and Simons, P. 1996. Efficient Implementation of the Well-Founded and Stable Model Semantics. In Proc. JICSLP-96, 289-303.
16. Niemelä, I. 1992. On the Decidability and Complexity of Autoepistemic Reasoning. Fundamenta Informaticae 17:117-155.
17. Niemelä, I. 1995. Towards Efficient Default Reasoning. In Proc. IJCAI-95, 312-318.
18. Poole, D. 1989. Explanation and Prediction: An Architecture for Default and Abductive Reasoning. Computational Intelligence 5(1):97-110.
19. Przymusinski, T. 1991. Stable Semantics for Disjunctive Programs. New Generation Computing 9:401-424.
20. Reiter, R. 1980. A Logic for Default Reasoning. Artificial Intelligence 13:81-132.
21. Rintanen, J. 1999a. Constructing Conditional Plans by a Theorem-Prover. JAIR 10:323-352.
22. Rintanen, J. 1999b. Improvements to the Evaluation of Quantified Boolean Formulae. In Proc. IJCAI-99, 1192-1197.
23. Selman, B., and Levesque, H. J. 1990. Abductive and Default Reasoning: A Computational Core. In Proc. AAAI-90, 343-348.