GOLOG and PDDL: what is the relative expressiveness?
暂无分享,去创建一个
Gerhard Lakemeyer | Bernhard Nebel | Patrick Eyerich | G. Lakemeyer | Patrick Eyerich | Jens Claßen | Jens Claßen | Bernhard Nebel
[1] Hector J. Levesque,et al. GOLOG: A Logic Programming Language for Dynamic Domains , 1997, J. Log. Program..
[2] John G. Gibbons. Knowledge in Action , 2001 .
[3] Maria Fox,et al. PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..
[4] Vladimir Lifschitz,et al. ON THE SEMANTICS OF STRIPS , 1987 .
[5] Gerhard Lakemeyer,et al. Towards an Integration of Golog and Planning , 2007, IJCAI.
[6] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[7] Craig A. Knoblock,et al. PDDL-the planning domain definition language , 1998 .
[8] Derek Long,et al. Plan Constraints and Preferences in PDDL3 , 2006 .
[9] Bernhard Nebel,et al. On the Compilability and Expressive Power of Propositional Planning Formalisms , 2000, J. Artif. Intell. Res..
[10] Tonya Lewis,et al. Knowledge in Action , 1977 .
[11] C. Cordell Green,et al. Application of Theorem Proving to Problem Solving , 1969, IJCAI.
[12] Edwin P. D. Pednault,et al. ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.