ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Fast planning through planning graph analysis
Artificial Intelligence
Using regression-match graphs to control search in planning
Artificial Intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Automatic predicate abstraction of C programs
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Extending Planning Graphs to an ADL Subset
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Ignoring Irrelevant Facts and Operators in Plan Generation
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Modular verification of software components in C
Proceedings of the 25th International Conference on Software Engineering
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Long-distance mutual exclusion for planning
Artificial Intelligence
Domain-independent construction of pattern database heuristics for cost-optimal planning
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Accuracy of admissible heuristic functions in selected planning domains
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm
Journal of Artificial Intelligence Research
Automatic SAT-compilation of planning problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
On reachability, relevance, and resolution in the planning as satisfiability approach
Journal of Artificial Intelligence Research
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Planning through stochastic local search and temporal action graphs in LPG
Journal of Artificial Intelligence Research
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
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
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
Unifying SAT-based and graph-based planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Planning in a hierarchy of abstraction spaces
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Planning as satisfiability: parallel plans and algorithms for plan search
Artificial Intelligence
SPIN'03 Proceedings of the 10th international conference on Model checking software
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Abstraction refinement for bounded model checking
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Optimal admissible composition of abstraction heuristics
Artificial Intelligence
Relative-Order Abstractions for the Pancake Problem
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Implicit abstraction heuristics
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Planning as satisfiability, as implemented in, for instance, the SATPLAN tool, is a highly competitive method for finding parallel step-optimal plans. A bottleneck in this approach is to prove the absence of plans of a certain length. Specifically, if the optimal plan has n steps, then it is typically very costly to prove that there is no plan of length n-1. We pursue the idea of leading this proof within solution length preserving abstractions (over-approximations) of the original planning task. This is promising because the abstraction may have a much smaller state space; related methods are highly successful in model checking. In particular, we design a novel abstraction technique based on which one can, in several widely used planning benchmarks, construct abstractions that have exponentially smaller state spaces while preserving the length of an optimal plan. Surprisingly, the idea turns out to appear quite hopeless in the context of planning as satisfiability. Evaluating our idea empirically, we run experiments on almost all benchmarks of the international planning competitions up to IPC 2004, and find that even handmade abstractions do not tend to improve the performance of SATPLAN. Exploring these findings from a theoretical point of view, we identify an interesting phenomenon that may cause this behavior. We compare various planning-graph based CNF encodings Φ of the original planning task with the CNF encodings Φσ of the abstracted planning task. We prove that, in many cases, the shortest resolution refutation for Φσ can never be shorter than that for Φ. This suggests a fundamental weakness of the approach, and motivates further investigation of the interplay between declarative transition-systems, over-approximating abstractions, and SAT encodings.