On computing solutions to belief change scenarios

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2143, Issue , 2001, Pages 510-521

  Delgrande, James P ^a   Schaub, Torsten ^a,b   Tompits, Hans ^c   Woltran, Stefan ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF POTSDAM   (Germany)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

AXIOMATI-SATION; AXIOMATIC SPECIFICATIONS; BELIEF CONTRACTION; COMPLEXITY RESULTS; COMPUTING SOLUTIONS; EXISTING SYSTEMS; QUANTIFIED BOOLEAN FORMULAS; REASONING TASKS;

BOOLEAN ALGEBRA;

EID: 84937393878     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44652-4_45     Document Type: Conference Paper

References (18)

1. C. Alchourŕon, P. Gärdenfors, and D. Makinson. On the Logic of Theory Change: Partial Meet Contraction and Revision Functions. Journal of Symbolic Logic, 50:510-530, 1985.
2. M. Cadoli, A. Giovanardi, and M. Schaerf. An Algorithm to Evaluate Quantified Boolean Formulae. In Proc. AAAI-98, pages 262-267, 1998.
3. J. Delgrande and T. Schaub. A Consistency-Based Model for Belief Change: Preliminary Report. In Proc. AAAI-00, pages 392-398, 2000.
4. E. Eder. Relative Complexities of First Order Calculi. Vieweg Verlag, Braunschweig, 1992.
5. U. Egly, T. Eiter, R. Feldmann, V. Klotz, S., Schamberger, H. Tompits, and S. Woltran. On Mechanizing Modal Nonmonotonic Logics. In Proc. DGNMR-01, pages 44-53, 2001.
6. U. Egly, T. Eiter, V. Klotz, H. Tompits, and S. Woltran. Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. In Proc. AAAI Spring Symposium- 01, pages 53-59, 2001.
7. 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.
8. R. Feldmann, B. Monien, and S. Schamberger. A Distributed Algorithm to Evaluate Quantified Boolean Formulas. In Proc. AAAI-00, pages 285-290, 2000.
9. A. Fuhrmann and S. Hansson. A Survey of Multiple Contraction. Journal of Logic, Language, and Information, 3:39-74, 1994.
10. P. Gärdenfors. Knowledge in Flux: Modeling the Dynamics of Epistemic States. The MIT Press, Cambridge, MA, 1988.
11. H. Kautz and B. Selman. Planning as Satisfiability. In Proc. ECAI-92, pages 359-363, 1992.
12. H. Kleine-Buning, M. Karpinski, and A. Flögel. Resolution for Quantified Boolean Formulas. Information and Computation, 117(1):12-18, 1995.
13. B. Nebel. Syntax Based Approaches to Belief Revision. In P. Gärdenfors, editor, Belief Revision, pages 52-88. Cambridge University Press, 1992.
14. D. A. Plaisted and S. Greenbaum. A Structure Preserving Clause Form Translation. Journal of Symbolic Computation, 2(3):293-304, 1986.
15. J. Rintanen. Constructing Conditional Plans by a Theorem Prover. Journal of Artificial Intelligence Research, 10:323-352, 1999.
16. J. Rintanen. Improvements to the Evaluation of Quantified Boolean Formulae. In Proc. IJCAI-99, pages 1192-1197, 1999.
17. L. J. Stockmeyer. The Polynomial-Time Hierarchy. Theoretical Computer Science, 3(1):1-22, 1976.
18. C. Wrathall. Complete Sets and the Polynomial-Time Hierarchy. Theoretical Computer Science, 3(1):23-33, 1976.