Planning in Action Formalisms based on DLs: First Results.

[1]  V. S. Subrahmanian,et al.  Complexity, Decidability and Undecidability Results for Domain-Independent Planning , 1995, Artif. Intell..

[2]  Patrik Haslum,et al.  Some Results on the Complexity of Planning with Incomplete Information , 1999, ECP.

[3]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[4]  V. S. Subrahmanian,et al.  Complexity, Decidability and Undecidability Resultsfor Domain-Independent Planning: A Detailed Analysis , 1998 .

[5]  Michael Thielscher,et al.  Introduction to the Fluent Calculus , 1998, Electron. Trans. Artif. Intell..

[6]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[7]  Jussi Rintanen,et al.  Complexity of Planning with Partial Observability , 2004, ICAPS.

[8]  John G. Gibbons.  Knowledge in Action , 2001 .

[9]  Carsten Lutz,et al.  Updating Description Logic ABoxes , 2006, KR.

[10]  Hector Geffner,et al.  Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes) , 2006, AAAI.

[11]  Franz Baader,et al.  Integrating Description Logics and Action Formalisms: First Results , 2005, Description Logics.

[12]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[13]  Armando Tacchella,et al.  SAT-based planning in complex domains: Concurrency, constraints and nondeterminism , 2003, Artif. Intell..

[14]  Carsten Lutz,et al.  Reasoning About Actions Using Description Logics with General TBoxes , 2006, JELIA.