Long-distance mutual exclusion for propositional planning

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 1840-1845

  Chen, Yixin ^a   Xing, Zhao ^a   Zhang, Weixiong ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENERAL APPROACH; INTERNATIONAL PLANNING COMPETITIONS; MUTUAL EXCLUSIONS; PLANNING TIME; PROPOSITIONAL PLANNING; SEARCH SPACES; TIME STEP;

ARTIFICIAL INTELLIGENCE;

OPTIMIZATION;

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

References (31)

1. C. Backstrom and B. Nebel. Complexity results for SAS+ planning. Computational Intelligence, 11:17-29, 1995.
2. A. Blum and M. L. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90:281-300, 1997. (Pubitemid 127398372)
3. B. Bonet and H. Geffner. Planning as heuristic search. Artificial Intelligence, 129(1-2):5-33, 2001. (Pubitemid 32498414)
4. R. I. Brafman. On reachability, relevance, and resolution in the planning as satisfiabilty approach. Journal of Artificial Intelligence Research, 14:1-28, 2001.
5. M. Briel, T. Vossen, and S. Kambhampati. Reviving integer programming approaches for ai planning: A branch-and-cut framework. In Proc. ICAPS, pages 310-319, 2005.
6. T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165-204, 1994.
7. Y. Chen, B. W. Wah, and C. Hsu. Temporal planning using subgoal partitioning and resolution in SGPlan. Journal Artificial Intelligence Research, 26:323-369, 2006. (Pubitemid 44452214)
8. M. Binh Do, B. Srivastava, and S. Kambhampati. Investigating the effect of relevance and reachability constraints on SAT encoding of planning. In Proc. AAAI, page 982, 1999.
9. N. Eén and A. Biere. Effective preprocessing in SAT through variable and clause elimination. In Proc. SAT, 2005.
10. M. Fox and D. Long. The automatic inference of state invariants in TIM. Journal of Artificial Intelligence Research, 9:367-421, 1998. (Pubitemid 128636208)
11. A. Gerevini and L. K. Schubert. Inferring state constraints for domain-independent planning. In Proceedings of AAAI- 98, pages 905-912, 1998.
12. A. Gerevini, A. Saetti, and I. Serina. Planning through stochastic local search and temporal action graphs in LPG. Journal of Artificial Intelligence Research, 20:239-290, 2003. (Pubitemid 41530527)
13. C. Green. Applications of theorem proving to problem solving. In Proceedings of IJCAI-69, pages 219-240, 1969.
14. Malte Helmert. The Fast Downward planning system. Journal of Artificial Intelligence Research, 2006. Accepted for publication.
15. The fifth international planning competition. http://zeus.ing.unibs.it/ ipc-5/, 2006.
16. P. Jonsson and C. Backstrom. State-variable planning under structural restrictions: Algorithms and complexity. Artificial Intelligence, 100(1-2):125-176, 1998. (Pubitemid 128403239)
17. H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of AAAI- 96, pages 1194-1201, 1996.
18. H. Kautz and B. Selman. The role of domain-specific knowledge in the planning as satisfiability framework. In Artificial Intelligence Planning Systems, pages 181-189, 1998.
19. H. Kautz and J. P. Walser. Integer optimization models of AI planning problems. The Knowledge Engineering Review, 15(1):101-117, 2000.
20. H. Kautz, D. McAllester, and B. Selman. Encoding plans in propositional logic. In Proceedings of KR-97, pages 374-384, 1996.
21. H. Kautz. SATPLAN04: Planning as satisfiability. In Proceedings of IPC4, ICAPS, 2004.
22. G. Kelleher and A. G. Cohn. Automatically synthesising domain constraints from operator descriptions. In Proceedings of ECAI-92, 1992.
23. T. L. McCluskey and J. M. Porteous. Engineering and compiling planning domain models to promote validity and efficiency. Artificial Intelligence, 95:1-65, 1997.
24. P. Morris and R. Feldman. Automatically derived heuristics for planning search. In Proceedings of the Second Irish Conference on Artificial Intelligence and Cognitive Science, 1989.
25. J. Penberthy and D. Weld. Temporal planning with continuous change. In Proc. 12th National Conf. on AI, pages 1010-1015. AAAI, 1994.
26. L. Ryan. Efficient algorithms for clause-learning SAT solvers. Master's thesis, Simon Fraser University, 2003.
27. B. Selman and H. Kautz. Planning as satisfiability. In Proceedings of ECAI-92, pages 359-363, 1992.
28. P. van Beek and X. Chen. CPlan: A constraint programming approach to planning. In Proceedings of AAAI-99, pages 585-590, 1999.
29. V. Vidal and H. Geffner. CPT: An optimal temporal POCL planner based on constraint programming. In Proc. IPC4, ICAPS, pages 59-60, 2004.
30. B. W. Wah and Y. Chen. Constraint partitioning in penalty formulations for solving temporal planning problems. Artificial Intelligence, 170(3):187-231, 2006. (Pubitemid 43134174)
31. S. Wolfman and D. Weld. Combining linear programming and satisfiability solving for resource planning. The Knowledge Engineering Review, 15(1), 2000.