The following pages link to Logics in Artificial Intelligence (Q5394133):
Displaying 16 items.
- Planning as satisfiability: heuristics (Q359984) (← links)
- Robust planning with incomplete domain models (Q514145) (← links)
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (Q814472) (← links)
- Planning parallel actions (Q1128648) (← links)
- Programming for modular reconfigurable robots (Q1758696) (← links)
- Planning as satisfiability: parallel plans and algorithms for plan search (Q2457605) (← links)
- SAS+ planning as satisfiability (Q2887072) (← links)
- Gearing Up for Effective ASP Planning (Q2900527) (← links)
- Using Satisfiability for Non-optimal Temporal Planning (Q2915070) (← links)
- SAT Modulo Graphs: Acyclicity (Q2938490) (← links)
- Encoding Domain Transitions for Constraint-Based Planning (Q2985114) (← links)
- Planning as satisfiability with IPC simple preferences and action costs (Q3164979) (← links)
- Solving μ-Calculus Parity Games by Symbolic Planning (Q3614877) (← links)
- Relaxing non-interference requirements in parallel plans (Q5018767) (← 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)