Expressing default abduction problems as quantified Boolean formulas

AI Communications

Volumn 16, Issue 2, 2003, Pages 89-105

  Tompits, Hans ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Abduction; Compilation methods; Default logic; Problem solving; Quantified Boolean logic

Indexed keywords

BOOLEAN FUNCTIONS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

QUANTIFIED BOOLEAN FORMULAS (QBF);

KNOWLEDGE REPRESENTATION;

EID: 0038340821     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (40)

1. R. Ben-Eliyahu and R. Dechter, Default reasoning using classical logic, Artificial Intelligence 84(1-2) (1996), 113-150.
2. P. Besnard, T. Schaub, H. Tompits and S. Woltran, Paraconsistent reasoning via quantified Boolean formulas, I: axiomatising signed systems, in: Proceedings of the Eighth European Conference on Logics in Artificial Intelligence (JELIA 2002), Volume 2424 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 2002, pp. 320-331.
3. M. Cadoli, A. Giovanardi and M. Schaerf, An algorithm to evaluate quantified Boolean formulae, in: Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) and the Tenth Conference on Innovative Applications of Artificial Intelligence (IAAI-98), 1998, pp. 262-267.
4. J. Delgrande, T. Schaub, H. Tompits and S. Woltran, On computing solutions to belief change scenarios, in: Proceedings of the Sixth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU-2001), Volume 2143 of Lecture Notes in Artificial Intelligence, Springe-Verlag, 2001, pp. 510-521.
5. M. Denecker, A. Kakas and B. Van Nuffelen, A-system: problem solving through abduction, in: Proceedings of the Seventeenth International Conference on Artificial Intelligence (IJCAI-01), Morgan Kaufmann Publishers, Inc., 2001, pp. 591-596.
6. U. Egly, T. Eiter, H. Tompits and S. Woltran, Solving advanced reasoning tasks using quantified Boolean formulas, in: Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000) and the Twelfth Innovative Applications of Artificial Intelligence Conference (IAAl-2000), AAAI Press/The MIT Press, 2000, pp. 417-422.
7. U. Egly, V. Klotz, H. Tompits and S. Woltran, A toolbox for abduction: preliminary report, in: Proceedings of the IJCAR Workshop on Theory and Applications of Quantified Boolean Formulas, 2001, pp. 29-39.
8. T. Eiter, W. Faber, N. Leone and G. Pfeifer, The diagnosis frontend of the d1v system, AI Communications - The European Journal on Artificial Intelligence 12(1 -2) (1999), 99-111.
9. P -complete, Theoretical Computer Science 144(2) (1993), 231-245, Addendum 118 (1993), 315.
10. T. Eiter and G. Gottlob, The complexity of logic-based abduction, Journal of the Association of Computing Machinery 42(1) 3-42 (1995), 3-42.
11. T. Eiter, G. Gottlob and N. Leone, Abduction from logic programs: semantics and complexity, Theoretical Computer Science 189(1-2) (1997), 129-177.
12. T. Eiter, G. Gottlob and N. Leone, Semantics and complexity of abduction from default theories, Artificial Intelligence 90(1-2) (1997), 177-233.
13. T. Eiter, V. Klotz, H. Tompits and S. Woltran, Modal non-monotonic logics revisited: efficient encodings for the basic reasoning tasks, in: Proceedings of the Eleventh Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-2002), Volume 2381 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 2002, pp. 100-114.
14. R. Feldmann, B. Monien and S. Schamberger, A distributed algorithm to evaluate quantified Boolean formulas, in: Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000) and the Twelfth Innovative Applications of Artificial Intelligence Conference (IAAI-2000 ), AAAI Press/The MIT Press, 2000, pp. 285-290.
15. E. Giunchiglia, M. Narizzano and A. Tacchella, QuBE: a system for deciding quantified Boolean formulas satisfiability, in: Proceedings of the International Joint Conference on Automated Reasoning (IJCAR-2001), Volume 2083 of Lecture Notes in Computer Science, Springer-Verlag, 2001, pp. 364-369.
16. G. Gottlob, Complexity results for nonmonotonic logics, Journal of Logic and Computation 2(3) (1992), 397-425.
17. G. Gottlob, The complexity of prepositional default reasoning under the stationary fixed point semantics, Information and Computation 121(1) (1995), 81-92.
18. A.C. Kakas, R.A. Kowalski and F. Toni, Abductive logic programming, Journal of Logic and Computation 2(6) (1993), 719-770.
19. A.C. Kakas, R.A. Kowalski and F. Toni, The role of abduction in logic programming, in: Handbook of Artificial Intelligence and Logic Programming, Volume 5, Clarendon Press, 1998, pp. 235-324.
20. A.C. Kakas and C. Mourlas, ACLP: flexible solutions to complex problems, in: Proceedings of the Fourth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-97), Volume 1265 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 1997, pp. 387-398.
21. H. Kautz and B. Selman, Planning as satisfiability, in: Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI-92), John Wiley and Sons, 1992, pp. 359-363.
22. H. Kleine-Büning, M. Karpinski and A. Flögel, Resolution for quantified Boolean formulas, Information and Computation 117(1)1995, 12-18.
23. R. Letz, Advances in decision procedures for quantified Boolean formulas, in: Proceedings of the IJCAR Workshop on Theory and Applications of Quantified Boolean Formulas, 2001, pp. 55-64.
24. V. Marek and M. Truszczyriski, Nonmonotonic Logic: Context-Dependent Reasoning, Artifical Intelligence, Springer-Verlag, 1993.
25. I. Niemelä, Towards efficient default reasoning, in: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), C. Mellish, ed., Morgan Kaufmann, San Francisco, 1995, pp. 312-318.
26. C.H. Papadimitriou, Computational Complexity. Addison-Wesley, Reading, Mass., 1994.
27. D. Pearce, H. Tompits and S. Woltran, Encodings for equilibrium logic and logic programs with nested expressions, in: Proceedings of the Tenth Portuguese Conference on Artificial Intelligence (EPIA-2001), Volume 2258 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 2001, pp. 306-320.
28. J. Pearl, Probabilistic Inference in Intelligent Systems. Networks of Plausible Inference, Morgan Kaufmann, San Mateo, Canada, 1988.
29. C.S. Peirce, Abduction and iduction, in: Philosophical Writings of Peirce, J. Buchler, ed., Dover Books, New York, 1955, pp. 150-156.
30. Y. Peng and J.A. Reggia, Abductive Inference Models for Diagnostic Problem-Solving, Springer-Verlag, 1990.
31. D.A. Plaisted and S. Greenbaum, A structure preserving clause form translation, Journal of Symbolic Computation 2(3) (1986), 293-304.
32. D. Poole, Explanation and prediction: an architecture for default and abductive reasoning, Computational Intelligence 5(2) (1989), 97-110.
33. R. Reiter, A logic for default reasoning, Artificial Intelligence 13(1980), 81-132.
34. J. Rintanen. Constructing conditional plans by a theorem prover, Journal of Artificial Intelligence Research 10 (1999), 323-352.
35. J. Rintanen, Improvements to the evaluation of quantified Boolean formulae, in: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), Morgan Kaufmann, 1999, pp. 1192-1197.
36. C. Sakama and K. Inoue, Transforming abductive logic programs to disjunctive programs, in: Proceedings of the Tenth International Conference on Logic Programming (ICLP-93), The MIT Press, 1993, pp. 335-353.
37. J. Siekmann and G. Wrightson, eds, Automation of Reasoning: Classical Papers in Computational Logic 1967-1970, Volume 2, Springer-Verlag, 1983.
38. G. Tseitin. On the complexity of proofs in prepositional logics, Seminars in Mathematics 8 (1970). Reprinted in [37].
39. S. Woltran, A framework for solving advanced reasoning tasks, Master Thesis, Technische Universität Wien, Institut für Informationssysteme, 2000.
40. C. Wrathall, Complete sets and the polynomial-time hierarchy, Theoretical Computer Science 3(1) (1976), 23-33.