Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Fast planning through planning graph analysis
Artificial Intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Planning via Model Checking: A Decision Procedure for AR
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Regression for Classical and Nondeterministic Planning
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Diagnosis of discrete-event systems using satisfiability algorithms
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Asymptotically optimal encodings of conformant planning in QBF
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
Unifying SAT-based and graph-based planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Planning as satisfiability: parallel plans and algorithms for plan search
Artificial Intelligence
A lightweight component caching scheme for satisfiability solvers
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Planning as satisfiability with relaxed ∃-step plans
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
A robust and fast action selection mechanism for planning
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Everything you always wanted to know about planning (but were afraid to ask)
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
Programming for modular reconfigurable robots
Programming and Computing Software
Planning with SAT, admissible heuristics and A*
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
On the utility of landmarks in SAT based planning
Knowledge-Based Systems
Planning as satisfiability: Heuristics
Artificial Intelligence
Revisiting regression in planning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performance by making the SAT solving process more application-specific. In this paper we propose a variable selection strategy for AI planning. The strategy is based on generic principles about properties of plans, and its performance with standard planning benchmarks often substantially improves on generic variable selection heuristics used in SAT solving, such as the VSIDS strategy. These improvements lift the efficiency of SAT based planning to the same level as best planners that use other search methods.