A novel transition based encoding scheme for planning as satisfiability

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2010, Pages 89-94

  Huang, Ruoyun ^a   Chen, Yixin ^a   Zhang, Weixiong ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ENCODING (SYMBOLS); FORMAL LOGIC;

ENCODING SCHEMES; ENCODINGS; MEMORY EFFICIENCY; PLANNING AS SATISFIABILITY; SAT INSTANCES; STRUCTURAL INFORMATION;

SIGNAL ENCODING;

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

References (15)

1. Bäckström, C, and Nebel, B. 1996. Complexity results for sas+ planning. Computational Intelligence 11:625-655.
2. Biere, A. 2009. Pr{e,i}coSAT. In SAT'09 Competition.
3. Blum, A., and Furst, M. 1997. Fast Planning Through Planning Graph Analysis. Artificial Intelligence 90:1636-1642.
4. Castellini, C; Giunchiglia, E.; and Tacchella, A. 2003. SAT-based planning in complex domains: Concurrency, constraints and nondeterminism. Artificial Intelligence 147:85-117.
5. Chen, Y.; Huang, R.; Xing, Z.; and Zhang, W. 2009. Longdistance mutual exclusion for planning. Artificial Intelligence 173:197-412.
6. Ernst, M.; Millstein, T.; and Weld, D. 1997. Automatic SAT-compilation of planning problems. In Proc. of IJCAI.
7. Helmert, M. 2006. The Fast Downward planning system. J. of AI Research 26:191-246.
8. Hoffmann, J.; Kautz, H.; Gomes, C; and Selman, B. 2007. SAT encodings of state-space reachability problems in numeric domains. In Proc. of IJCAI.
9. Huang, R.; Chen, Y; and Zhang, W. 2009. An Optimal Temporally Expressive Planner: Initial Results and Application to P2P Network Optimization. In Proc. of ICAPS.
10. Kautz, H.; Selman, B.; and Hoffmann, J. 1999. Unifying sat-based and graph-based planning. In Proc. of IJCAI.
11. Kautz, H.; Selman, B.; and Hoffmann, J. 2006. SatPlan: Planning as Satisfiability. In Abstracts IPCS.
12. Richter, S.; Helmert, M.; and Westphal, M. 2008. Landmarks Revisited. In Proc. of 23rd AAAI.
13. Rintanen, J.; Heljanko, K.; and Niemelà, I. 2006. Planning as satisfiability: parallel plans and algorithms for plan search. Artificial Intelligence 12-13:1031-1080.
14. Rintanen, J. 2006. Biclique-based representations of binary constraints for making SAT planning applicable to larger problems. In Proc. of ECAI.
15. Robinson, N.; Gretton, C; Pham, D.; and Sattar, A. 2009. SAT-Based Parallel Planning Using a Split Representation of Actions. In Proc. of 19th ICAPS.