On reachability, relevance, and resolution in the planning as satisfiability approach

Journal of Artificial Intelligence Research

Volumn 14, Issue , 2001, Pages 1-28

  Brafman, Ronen I ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

LINEAR ENCODING;

STRATEGIC PLANNING;

EID: 0036377318     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.737     Document Type: Article

References (24)

1. Bayardo, R. J., & Schrag, R. C. (1997). Using CSP look-back techniques to solve real-world SAT instances. In Proc. AAAI-97, pp. 203-208.
2. Blum, A., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90, 281-300.
3. Bonet, B., Loerincs, G., & Geffner, H. (1997). A robust and fast action selection mechanism for planning. In Proc. AAAI-97, pp. 714-719.
4. Boutilier, C., Brafman, R. I., & Geib, C. (1998). Structured reachability analysis for markov decision processes. In Proc. of 14th Conference on Uncertainty in AI, pp. 24-32.
5. Boutilier, C., & Dearden, R. (1994). Using abstractions for decision theoretic planning with time constraints. In Proc. of AAAI'94, pp. 1016-1022.
6. Brafman, R. I. (1999). Reachability, relevance, resolution, and the planning as satisfiability approach. In IJCAI'99, pp. 976-981.
7. Brafman, R. I., & Hoos, H. H. (1999). To encode or not to encode - i: linear planning. In IJCAI'99, pp. 988-993.
8. Brafman, R. I. (2000). A simplifier for propositional formulas with many binary clauses. Tech. rep. 00-04, Dept. of Computer Science, Ben-Gurion University.
9. Crawford, J., & Auton, L. D. (1993). Experimental results on the cross-over point in satisfiability problems. In Proc. AAAI'93, pp. 21-27.
10. Davis, M., & Putman, H. (1960). A computing procedure for quantification theory. Journal of the ACM, 7, 201-215.
11. Do, M. B., Srivastava, B., & Kambhampati, S. (2000). Investigating the effect of relevance and reachability constraints on sat encodings of planning. In Proc. of the Fifth Intl. Conf. on AI Planning and Scheduling Systems.
12. Ernst, M. D., Millstein, T. D., & Weld, D. S. (1997). Automatic SAT-compilation of planning problems. In Proceedings of the International Joint Conference on Artificial Intelligence.
13. Fikes, R., & Nilsson, N. (1971). Strips: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2 (3-4), 189-208.
14. Freeman, J. W. (1995). Improvements to Propositional Satisfiability Search Algorithms. Ph.D. thesis, U. Pennsylvania Dept. of Computer and Information Science.
15. Genesereth, M. R., & Nilsson, N. J. (1987). Logical Foundations of Artificial Intelligence. Kaufmann, Los Altos, CA.
16. Gomes, C. P., Selman, B., & Kautz, H. (1998). Boosting combinatorial search through randomization. In Proc. of 15th Nat. Conf. AI, pp. 431-437.
17. Haslum, P., & Geffner, H. (2000). Admissible heuristics for optimal planning. In Proc. of the Fifth Intl. Conf. on AI Planning and Scheduling Systems, pp. 140-149.
18. Kambhampati, S., Parker, E., & Lambrecht, E. (1997). Understanding and exending graph-plan. In Proc. 4th European Conf. on Planning, pp. 260-272.
19. Kautz, H., & Selman, B. (1992). Planning as satisfiability. In Proc. of the 10th European Conf. on AI, pp. 359-363.
20. Kautz, H., & Selman, B. (1996). Pushing the envelope: Planning, propositional logic, and stochastic search. In Proc. of the 13th National Conference on AI (AAAI'96), pp. 1194-1201.
21. Kautz, H., & Selman, B. (1999). Unifying sat-based and graph-based planning. In Proc. 16th Intl. Joint Conf. on AI (IJCAI'99), pp. 318-325.
22. Li, C. M., & Anbulagan (1997). Heuristics based on unit propagation for satisfiability problems. In Proc. IJCAI-97.
23. McDermoot, D. (1996). A heuristic estimator for means-ends analysis in planning. In Proc. 3rd Int. Conf on AI Planning Systems, pp. 142-149.
24. Nebel, B., Dimopoulos, Y., & Koehler, J. (1997). Ignoring irrelevant facts and operators in plan generation. In Proc. 4th European Conf. on Planning.