An effective QBF solver for planning problems

Proceedings of the International Conference on Modeling, Simulation and Visualization Methods, MSV'04 and Proceedings of the Int. Conference on Algorithmic Mathematics and Comput. Sci., AMCS'04

Volumn , Issue , 2004, Pages 311-316

  Otwell, Charles ^a   Remshagen, Anja ^a   Truemper, Klaus ^b  

^a UNIVERSITY OF WEST GEORGIA   (United States)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COSTS; HEURISTIC METHODS; HIERARCHICAL SYSTEMS; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; PROBLEM SOLVING;

BACKTRACKING; POLYNOMIAL HIERARCHY; QUANTIFIED BOOLEAN FORMULAS (QBF); STRUCTURAL PROPERTIES;

STRATEGIC PLANNING;

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

References (17)

1. Bayardo Jr., R. J., Schrag, R. C.: Using CSP look-back techniques to solve real world SAT instances. Proceedings of the 14th National Conference on Artificial Intelligence (1997) 203-208
2. Cadoli, M., Schaerf, M., Giovanardi, A., Giovanardi, M.: An Algorithm to Evaluate Quantified Boolean Formulae and its Experimental Evaluation. Journal of Automated Reasoning (2003) to appear
3. Eiter, T., Gottlob, G., Leone, N.:, Abduction from Logic Programs: Semantics and Complexity. Theoretical Computer Science 189(1-2) (1997) 129-177.
4. Giunchiglia, E., Narrizano, M., Tacchella, A.: Backjumping for Quantified Boolean Logic satisfiability. Artificial Intelligence 145(1) (2003) 99.
5. João, P., Marques-Silva, J. P., Sakallah, K. A.: GRASP - A Search Algorithm for Prepositional Satisfiability. IEEE Transactions on Computers 48(5) (1999) 506-521.
6. Kleine Büning, H., Karpinski, M., Flögel, A.: Resolution for quantified Boolean formulas. Information and Computation 117(1) (1995) 12-18.
7. Letz, R.: Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas. U. Egly and C.G. Formülier (Eds.): TABLEAUX 2002, LNAI 2381, (2002) 160-175.
8. Poole, D.: Normality and Faults in Logic-Based Diagnosis. Proceedings of the 11th International Joint Conference on Artificial Intelligence (1989) 1304-1310.
9. Rintanen, J.: Constructing Conditional Plans by a Theorem-Prover. Journal of Artificial Intelligence Research (1999) 323-352.
10. Rintanen, J.: Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formula. International Conference on Logic Programming, Artificial Intelligence and Reasoning (2001) 362-376
11. SAT 2003, Sixth International Conference on Theory and Applications of Satisfiability Testing, QBF Evaluation, http://www.satlive.org/ (2003)
12. Stockmeyer, L. J.: The polynomial hierarchy. Theoretical Computer Science 3 (1976) 1-22
13. Straach, J., Truemper, K.: Learning to Ask Relevant Questions. Artificial Intelligence 111 (1999) 301-327
14. Truemper, K.: Design of Logic-based Intelligent Systems. John Wiley & Sons, Inc. (2004)
15. Zhang, H.: SATO: An Efficient Prepositional Prover. Proceedings of the International Conference on Automated Deduction (1997)
16. Zhang, L., Madigan, C. F., Moskewicz M. H., Malik, S.: Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. Proceedings of the International Conference on Computer Aided Design (2001)
17. Zhang, L., Malik, S.: Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation. Proceedings of 8th International Conference on Principles and Practice of Constraint Programming (2002)