Searching for "Planning and SAT." – sorted by Relevance.
-
SatPlan: Planning as satisfiability
- Henry Kautz Dept. Computer Science & Engr. University Of Washington Seattle, WA 98195 USA SatPlan
- Cited by 9 (1 self) – Add To MetaCart
-
CO-PLAN: Combining SAT-Based Planning with Forward-Search
- CO-PLAN: Combining SAT-Based Planning with Forward-Search Nathan Robinson, Charles Gretton and Duc
- Add To MetaCart
-
A Compact and Efficient SAT Encoding for Planning
- A Compact and Efficient SAT Encoding for Planning Nathan Robinson, Charles Gretton, Duc-Nghia Pham
- Cited by 1 (0 self) – Add To MetaCart
-
DSatz: A Directional SAT Solver for Planning
- DSatz: A Directional SAT Solver for Planning Mark Iwen and Amol Dattatraya Mali Electrical
- Add To MetaCart
-
Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning
- Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning
- Cited by 6 (2 self) – Add To MetaCart
-
Structure and problem hardness: Goal asymmetry and DPLL proofs in SAT-based planning
- Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning Jörg Hoffmann
- Cited by 4 (2 self) – Add To MetaCart
-
Encoding Plans in Propositional Logic
- of planning to SAT. We introduce a series of different SAT encodings for STRIPS-style planning, which
- Cited by 131 (6 self) – Add To MetaCart
-
Encoding Plans in Propositional Logic
- of planning to SAT. We introduce a series of different SAT encodings for STRIPS-style planning, which
- Add To MetaCart
-
Physical Schemas for Planning Domain Analysis
- such as GraphPlan and SAT-based algorithms can solve problems that are orders of magnitude more difficult than
- Add To MetaCart
-
Structural relaxations by variable renaming and their compilation for solving MinCostSAT
- obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however
- Cited by 4 (2 self) – Add To MetaCart

