Continuous time in a SAT-based planner

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 531-536

  Shin, Ji Ae ^a   Davis, Ernest ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

Continuous time; LPSAT; Numerical quantities; Processes; Propositional planning

Indexed keywords

CONTINUOUS TIME; LPSAT; NUMERICAL QUANTITIES; PROCESSES; PROPOSITIONAL PLANNING; REUSABLE RESOURCE;

CONSTRAINT THEORY; DECODING; DISCRETE TIME CONTROL SYSTEMS; PARAMETER ESTIMATION; SET THEORY; TIME MEASUREMENT;

PLANNING;

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

References (20)

1. Alessandro, A., Castellini, C., Giunchiglia, E., Giunchiglia, F., and Tacchella, A. 2002. SAT-Based Decision Procedures for Automated Reasoning: a Unifying Perspective. Journal of Automated Reasoning 28.
2. Audemard, G., Bertoli, P., Cimatti, A., Kornilowicz, A., and Sebastiani, R. 2002. A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. In Proceedings of the International Conference of Automated Deduction.
3. Barrett, C., and Berezin, S. 2004. CVC Lite: A New Implementation of the Cooperating Validity Checker. In Proceedings of the International Conference on Computer Aided Verification.
4. Blum, A. and Furst, M. 1997. Fast Planning through Planning Graph Analysis. Artificial Intelligence 97.
5. Davis, E. 1992. Axiomatizing Qualitative Process Theory. In Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning.
6. Ernst, M., Millstein, T., and Weld, D. 1997. Automatic SAT-Compilation of Planning Problems. In Proceedings of the International Joint Conference on Artificial Intelligence.
7. Forbus, K. 1984. Qualitative Process Theory. Artificial Intelligence 24.
8. Fox, M., and Long, D. 2001. PDDL+ Level 5: An Extension to PDDL2.1 for Modelling Planning Domains Continuous Time-dependent Effects. Available at http://www.dur.ac.uk/d.p.long/competition.html.
9. Fox, M., and Long, D. 2003. PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains. Journal of Artificial Intelligence Research 20.
10. Kautz, H., and Selman, B, 1992. Planning as Satisfiability. In Proceedings of the European Conference on Artificial Intelligence.
11. Kautz, H., McAllester, D., and Selman, B. 1996. Encoding Plans in Propositional Logic. In Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning.
12. Kautz, H., and Selman, B. 1996. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search. In Proceedings of the National Conference on Artificial Intelligence.
13. Kautz, H., and Selman, B. 1999. Unifying SAT-based and Graph-based Planning. In Proceedings of the International Joint Conference on Artificial Intelligence.
14. McDermott, D. 1998. PDDL - the Planning Domain Definition Language. Available at http://www.cs.yale.edu/homes/dvm.
15. McDermott, D. 2000. The 1998 AI Planning Systems Competition. AI Magazine 21.
16. McDermott, D. 2003. Reasoning about Autonomous Processes in an Estimated-Regression Planner. In Proceedings of the International Conference on Automated Planning and Scheduling.
17. Penberthy, J., and Weld, D. 1994. Temporal Planning with Continuous Change. In Proceedings of the National Conference on Artificial Intelligence.
18. Shin, J. 2004. TM-LPSAT: Encoding Temporal Metric Planning in Continuous Time. Ph.D. Dissertation, Dept. of Computer Science, New York University.
19. Wolfman, S., and Weld, D. 1999. The LPSAT Engine and its application to Resource Planning. In Proceedings of the International Joint Conference on Artificial Intelligence.
20. Wolfman, S., and Weld, D. 2000. Combining Linear Programming and Satisfiability Solving for Resource Planning. Knowledge Engineering Review 15.