Planning for conjunctive goals
Artificial Intelligence
Planning as search: a quantitative approach
Artificial Intelligence
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
Iterative-deepening-A: an optimal admissible tree search
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
The Nature of Knowledge in an Abductive Event Calculus Planner
EKAW '00 Proceedings of the 12th European Workshop on Knowledge Acquisition, Modeling and Management
Learning from planner performance
Artificial Intelligence
Reviving partial order planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Planning and acting in partially observable stochastic domains
Artificial Intelligence
Branching and pruning: An optimal temporal POCL planner based on constraint programming
Artificial Intelligence
Computational research on interaction and agency
Artificial Intelligence
Kernel functions for case-based planning
Artificial Intelligence
Efficient Plan Adaptation through Replanning Windows and Heuristic Goals
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Scientific and Technical Information Processing
The complexity of plan existence and evaluation in robabilistic domains
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence
Middleware'06 Proceedings of the 7th ACM/IFIP/USENIX international conference on Middleware
Poplar: Java composition with labels and AI planning
Proceedings of the 2nd workshop on Free composition @ onward! 2011
An agent specific planning algorithm
Expert Systems with Applications: An International Journal
A formal model for semantic web service composition
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Advanced user assistance based on AI planning
Cognitive Systems Research
Narrative planning: compilations to classical planning
Journal of Artificial Intelligence Research
Planning as satisfiability: Heuristics
Artificial Intelligence
Block-Structured plan deordering
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
This paper presents a simple, sound, complete, and systematic algorithm for domain independent STRIPS planning. Simplicity is achieved by starting with a ground procedure and then applying a general, and independently verifiable, lifting transformation. Previous planners have been designed directly as lifted procedures. Our ground procedure is a ground version of Tate's NONLIN procedure. In Tate's procedure one is not required to determine whether a prerequisite of a step in an unfinished plan is guaranteed to hold in all linearizations. This allows Tate's procedure to avoid the use of Chapman's modal truth criterion. Systematicity is the property that the same plan, or partial plan, is never examined more than once. Systematicity is achieved through a simple modification of Tate's procedure.