|
111
|
Conformant Graphplan
– D E Smith, D S Weld
- 1998
|
|
68
|
Improvements to the evaluation of quantified Boolean formulae
– Jussi Rintanen
- 1999
|
|
174
|
Planning with Incomplete Information as Heuristic Search in Belief Space
– Blai Bonet, Hector Geffner
- 2000
|
|
118
|
An Algorithm to Evaluate Quantified Boolean Formulae and its Experimental Evaluation
– Marco Cadoli, Marco Schaerf, Massimo Giovanardi, Massimo Giovanardi
- 1999
|
|
852
|
Fast Planning Through Planning Graph Analysis
– Avrim L. Blum, Merrick L. Furst
- 1995
|
|
636
|
A machine program for theorem proving
– M Davis, G Logemann, D Loveland
- 1962
|
|
141
|
Extending Graphplan to Handle Uncertainty Sensing Actions
– Daniel Weld, Corin R. Anderson, David E. Smith
- 1998
|
|
107
|
Conformant Planning via Symbolic Model Checking and Heuristic Search
– A. Cimatti, M. Roveri, P. Bertoli
- 2003
|
|
1208
|
Symbolic Model Checking
– K L McMillan
- 1993
|
|
235
|
An Algorithm for Probabilistic Planning
– Nicholas Kushmerick, Steve Hanks, Daniel Weld
- 1995
|
|
21
|
Decision-Theoretic Planning
– M Peot
- 1998
|
|
29
|
Planning as satisfiability in nondeterministic domains
– P Ferraris, E Giunchiglia
- 2000
|
|
61
|
Resolution for quantified boolean formulas
– H Kleine-Bning, M Karpinski, A Flgel
- 1995
|
|
25
|
Planning for Contingency: a Decision Based Approach
– L Pryor, G Collins
- 1996
|
|
19
|
A.: Resolution for Quantified Boolean Formulas
– H Kleine-Büning, M Karpinski, Flögel
- 1995
|
|
47
|
Strong Planning in Non-Deterministic Domains via Model Checking
– A. Cimatti, Marco Roveri, Paolo Traverso
- 1998
|
|
82
|
Automatic OBDD-based Generation of Universal Plans in Non-Deterministic Domains
– A. Cimatti, M. Roveri, P. Traverso
- 1998
|
|
157
|
A Structure-preserving Clause Form Translation
– D A Plaisted, S Greenbaum
- 1986
|
|
909
|
Chaff: Engineering an Efficient SAT Solver
– Matthew W. Moskewicz , Conor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik
- 2001
|
