Foundations of logic programming
Foundations of logic programming
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Complexity, decidability and undecidability results for domain-independent planning
Artificial Intelligence - Special volume on planning and scheduling
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Journal of the ACM (JACM)
Artificial Intelligence
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
SHOP: Simple Hierarchical Ordered Planner
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Planning with Uncertainty and Incomplete Information
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
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
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A survey on knowledge compilation
AI Communications
On the compilability and expressive power of propositional planning formalisms
Journal of Artificial Intelligence Research
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Journal of Artificial Intelligence Research
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Local search topology in planning benchmarks: an empirical analysis
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
SPIN'03 Proceedings of the 10th international conference on Model checking software
Planning with first-order temporally extended goals using heuristic search
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
The deterministic part of IPC-4: an overview
Journal of Artificial Intelligence Research
Where "Ignoring delete lists" works: local search topology in planning benchmarks
Journal of Artificial Intelligence Research
Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Brothers in Arms? On AI Planning and Cellular Automata
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Planning with domain rules based on state-independent activation sets
PKAW'06 Proceedings of the 9th Pacific Rim Knowledge Acquisition international conference on Advances in Knowledge Acquisition and Management
Hi-index | 0.00 |
There is controversy as to whether explicit support for PDDL-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers have deplored the lack of precise semantics for such axioms, while others have argued that it might be best to compile them away. We propose an adequate semantics for PDDL axioms and show that they are an essential feature by proving that it is impossible to compile them away if we restrict the growth of plans and domain descriptions to be polynomial. These results suggest that adding a reasonable implementation to handle axioms inside the planner is beneficial for the performance. Our experiments confirm this suggestion.