Combining the expressivity of UCPOP with the efficiency of Graphplan

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1348 LNAI, Issue , 1997, Pages 221-233

  Gazen, B Cenk ^a   Knoblock, Craig A ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONDITIONAL EFFECTS; DOMAIN REPRESENTATIONS; HARD PROBLEMS; NEW APPROACHES; PLANNING PROBLEM; PREPROCESSING TIME; REPRESENTATION LANGUAGES; TEST PROBLEM;

PLANNING;

EID: 84898688040     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63912-8_88     Document Type: Conference Paper

References (8)

1. Edwin P.D. Pednault. ADL: Exploring the middle ground between STRIPS and the situation calculus. In Proc. 1st. Int. Con}. On Principles of Knowledge Representation and Reasoning, 1989.
2. Steven Minton, Craig A. Knoblock, D. Koukka, Yolanda Gil, Robert L. Joseph, and Jaime G. Carbonell. Prodigy 2.0: The manual and the tutorial. Technical report, Department of Computer Science, Carnegie Mellon University, 1989.
3. Daniel S. Weld. An introduction to least commitment planning. AI Magazine, 15(4), 1994.
4. Avrim L. Blum and Merrick L. Fürst. Fast planning through planning graph analysis. Artifical Intelligence, 90(1-2):281-300, 1991.
5. Jana Koehler, Bernhard Nebel, Jörg Hoffman, and Yannis Dimopoulos. Extending planning graphs to an ADL subset. In Proc. ECP-97, Toulouse, France, 1997.
6. Henry Kautz and Bart Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proc. AAAI-96, Portland, OR, 1996.
7. A. Barrett, Dave Christianson, Marc Friedman, Chung Kwok, Keith Golden, Scott Penberthy, Ying Sun, and Daniel Weld. UCPOP user's manual, version 4.0. Technical report, Department of Computer Science and Engineering, University of Washington, 1995.
8. Richard E. Fikes and Nils J. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2(3/4):189-208, 1971.