Pages that link to "Item:Q814472"
From MaRDI portal
The following pages link to SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (Q814472):
Displayed 10 items.
- Conformant planning via symbolic model checking and heuristic search (Q814631) (← links)
- Task decomposition on abstract states, for planning under nondeterminism (Q835827) (← links)
- The SAT-based approach to separation logic (Q862390) (← links)
- A self-adaptive multi-engine solver for quantified Boolean formulas (Q1020496) (← links)
- Strong planning under partial observability (Q2457630) (← links)
- Understanding planning with incomplete information and sensing (Q2457676) (← links)
- (Q2741533) (← links)
- Complexity of Planning in Action Formalisms Based on Description Logics (Q3498484) (← links)
- Probabilistic Reasoning by SAT Solvers (Q3638188) (← links)
- Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming (Q5297630) (← links)