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
HTN planning: complexity and expressivity
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
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
What Is the Expressive Power of Disjunctive Preconditions?
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
A survey on knowledge compilation
AI Communications
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Propositional planning in BDI agents
Proceedings of the 2004 ACM symposium on Applied computing
Artificial Intelligence
Automatic workflow verification and generation
Theoretical Computer Science
GOLOG and PDDL: what is the relative expressiveness?
PCAR '06 Proceedings of the 2006 international symposium on Practical cognitive agents and robots
Planning domain definition using GIPO
The Knowledge Engineering Review
Sequential Monte Carlo in reachability heuristics for probabilistic planning
Artificial Intelligence
Automated norm synthesis in an agent-based planning environment
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Regression for Classical and Nondeterministic Planning
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Planning for stream processing systems
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
A situation-calculus semantics for an expressive fragment of PDDL
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Expressiveness of ADL and golog: functions make a difference
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
The metric-FF planning system: translating "Ignoring delete lists" to numeric state variables
Journal of Artificial Intelligence Research
Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4
Journal of Artificial Intelligence Research
When is temporal planning really temporal?
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Artificial Intelligence
Soft goals can be compiled away
Journal of Artificial Intelligence Research
Exploiting domain knowledge to improve norm synthesis
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
A generative dialogue system for arguing about plans in situation calculus
ArgMAS'09 Proceedings of the 6th international conference on Argumentation in Multi-Agent Systems
Algorithms and limits for compact plan representations
Journal of Artificial Intelligence Research
Optimal delete-relaxed (and semi-relaxed) planning with conditional effects
IJCAI'13 Proceedings of the Twenty-Third 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 expressiveness of a large family of propositional planning formalisms, ranging from basic STRIPS to a formalism with conditional effects, partial state specifications, and propositional formulae in the preconditions. One of the results is that conditional effects cannot be compiled away if plan size should grow only linearly but can be compiled away if we allow for polynomial growth of the resulting plans. This result confirms that the recently proposed extensions to the GRAPHPLAN algorithm concerning conditional effects are optimal with respect to the "compilability" framework. Another result is that general propositional formulae cannot be compiled into conditional effects if the plan size should be preserved linearly. This implies that allowing general propositional formulae in preconditions and effect conditions adds another level of difficulty in generating a plan.