ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Partial-order planning: evaluating possible efficiency gains
Artificial Intelligence
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Act, and the rest will follow: exploiting determinism in planning as satisfiability
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Computer Model of Skill Acquisition
A Computer Model of Skill Acquisition
SAT-Encodings, Search Space Structure, and Local Search Performance
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Reachability, Relevance, Resolution and the Planning as Satisfiability Approach
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Automatic SAT-compilation of planning problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Learning first-order definitions of functions
Journal of Artificial Intelligence Research
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Evidence for invariants in local search
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Evaluating las vegas algorithms: pitfalls and remedies
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Beyond the Plan-Length Criterion
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
Pruning Techniques for the SAT-Based Bounded Model Checking Problem
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Constraint-based agents: an architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
Hi-index | 0.00 |
Stochastic local search (SLS) techniques are very effective in solving hard prepositional satisfiability problems. This has lead to the popularity of the encode & solve paradigm in which different problems are encoded as propositional satisfiability problems to which SLS techniques are applied. In AI, planning is the main area in which this methodology is used. Yet, it seems plausible that SLS methods should perform better when applied to the original problem space whose structure they can exploit. As part of our attempts to validate this thesis, we experimented with LPSP, a planner that applies SLS techniques to the space of linear plans. LPSP out-performs SLS applied to encoded planning problems that enforce a similar linearity assumption because of its ability to exploit the special structure of planning problems. Additional experiments (reported in a longer version of this paper) conducted on the Hamiltonian circuit problem lend farther support to our thesis.