Planning as satisfiability: parallel plans and algorithms for plan search
Top Cited Papers
- 1 September 2006
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 170 (12-13) , 1031-1080
- https://doi.org/10.1016/j.artint.2006.08.002
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Temporal Induction by Incremental SAT SolvingElectronic Notes in Theoretical Computer Science, 2003
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSPArtificial Intelligence, 2001
- Least commitment in GraphplanArtificial Intelligence, 2001
- Planning as heuristic searchArtificial Intelligence, 2001
- The FF Planning System: Fast Plan Generation Through Heuristic SearchJournal of Artificial Intelligence Research, 2001
- Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction ProblemsJournal of Automated Reasoning, 2000
- Fast planning through planning graph analysisArtificial Intelligence, 1997
- A probabilistic analysis of prepositional STRIPS planningArtificial Intelligence, 1996
- Sequential and concurrent behaviour in Petri net theoryTheoretical Computer Science, 1987
- Bootstrap Methods for Standard Errors, Confidence Intervals, and Other Measures of Statistical AccuracyStatistical Science, 1986