Logical foundations of artificial intelligence
Logical foundations of artificial intelligence
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)
Extending Planning Graphs to an ADL Subset
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Automatic SAT-compilation of planning problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Accelerating partial-order planners: some techniques for effective search control and pruning
Journal of Artificial Intelligence Research
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Control knowledge in planning: benefits and tradeoffs
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Encoding domain knowledge for prositional planning
Logic-based artificial intelligence
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
Temporal Planning through Mixed Integer Programming: A Preliminary Report
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Exploring artificial intelligence in the new millennium
Declarative Formalization of Reasoning Strategies: A Case Study on Heuristic Nonlinear Planning
Annals of Mathematics and Artificial Intelligence
Processes and continuous change in a SAT-based planner
Artificial Intelligence
Plan execution in dynamic environments
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
State-set branching: Leveraging BDDs for heuristic search
Artificial Intelligence
Long-distance mutual exclusion for planning
Artificial Intelligence
Concise finite-domain representations for PDDL planning tasks
Artificial Intelligence
Regression for Classical and Nondeterministic Planning
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Domain-independent structured duplicate detection
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Compiling causal theories to successor state axioms and STRIPS-like systems
Journal of Artificial Intelligence Research
Planning through stochastic local search and temporal action graphs in LPG
Journal of Artificial Intelligence Research
The automatic inference of state invariants in TIM
Journal of Artificial Intelligence Research
The GRT planning system: backward heuristic construction in forward state-space planning
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Constructing conditional plans by a theorem-prover
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
Long-distance mutual exclusion for propositional planning
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Reviving partial order planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Processes and continuous change in a SAT-based planner
Artificial Intelligence
Understanding planning tasks: domain complexity and heuristic decomposition
Understanding planning tasks: domain complexity and heuristic decomposition
Automatic induction of bellman-error features for probabilistic planning
Journal of Artificial Intelligence Research
A weighted CSP approach to cost-optimal planning
AI Communications
On-line planning and scheduling: an application to controlling modular printers
Journal of Artificial Intelligence Research
Analyzing search topology without running any search: on the connection between causal graphs and h+
Journal of Artificial Intelligence Research
Planning as satisfiability: Heuristics
Artificial Intelligence
Reasoning about state constraints in the situation calculus
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Computing upper bounds on lengths of transition sequences
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We describe some new preprocessing techniques that enable faster domain-independent planning. The first set of techniques is aimed at inferring state constraints from the structure of planning operators and the initial state. Our methods consist of generating hypothetical state constraints by inspection of operator effects and preconditions, and checking each hypothesis against all operators and the initial conditions. Another technique extracts (supersets of) predicate domains from sets of ground literals obtained by Graphplan-like forward propagation from the initial state. Our various techniques are implemented in a package called DISCOPLAN. We show preliminary results on the effectiveness of adding computed state constraints and predicate domains to the specification of problems for SAT-based planners such as SATPLAN or MEDIC. The results suggest that large speedups in planning can be obtained by such automated methods, potentially obviating the need for adding hand-coded state constraints.