The following pages link to SAS+ planning as satisfiability (Q2887072):
Displaying 11 items.
- Planning as satisfiability: heuristics (Q359984) (← links)
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models (Q785238) (← links)
- Planning as satisfiability: parallel plans and algorithms for plan search (Q2457605) (← links)
- Encoding domain and control knowledge for propositional planning (Q2734936) (← links)
- Introducing Preferences in Planning as Satisfiability (Q3006114) (← links)
- Planning as satisfiability with IPC simple preferences and action costs (Q3164979) (← links)
- plasp 3: Towards Effective ASP Planning (Q4957186) (← links)
- Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings (Q5190260) (← links)
- Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning (Q5310682) (← links)
- Logics in Artificial Intelligence (Q5394133) (← links)
- Lilotane: A Lifted SAT-based Approach to Hierarchical Planning (Q5856493) (← links)