ADL: exploring the middle ground between STRIPS and the situation calculus
Proceedings of the first international conference on Principles of knowledge representation and reasoning
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Expressive equivalence of planning formalisms
Artificial Intelligence - Special volume on planning and scheduling
Fast planning through planning graph analysis
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Extending Planning Graphs to an ADL Subset
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Understanding and Extending Graphplan
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Combining the Expressivity of UCPOP with the Efficiency of Graphplan
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
On the Compilability and Expressive Power of Propositional Planning
On the Compilability and Expressive Power of Propositional Planning
A survey on knowledge compilation
AI Communications
STRIPS: a new approach to the application of theorem proving to problem solving
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
| Hi-index | 0.00 |
The recent approaches of extending the graphplan algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of "expressive power" is. We formalize the intuition that expressive power is a measure of how concisely planning domains and plans can be expressed in a particular formalism by introducing the notion of "compilation schemes" between planning formalisms. Using this notion, we analyze the expressive power of a large family of propositional planning formalisms and show, e.g., that Gazen and Kno-block's approach to compiling conditional effects away is optimal.