The following pages link to (Q4539619):
Displayed 5 items.
- Backjumping for quantified Boolean logic satisfiability (Q814445) (← links)
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (Q814472) (← links)
- Answer set programming based on propositional satisfiability (Q861709) (← links)
- The SAT-based approach to separation logic (Q862390) (← links)
- (Q2741533) (← links)