The following pages link to (Q4539619):
Displaying 10 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)
- Heuristic-based backtracking relaxation for propositional satisfiability (Q862398) (← links)
- Selection of search strategies for solving 3-SAT problems (Q2511762) (← links)
- Towards an efficient library for SAT: A manifesto (Q2741533) (← links)
- (Q3455631) (← links)
- Evaluation of a Catalytic Search Algorithm (Q3578813) (← links)
- Theory and Applications of Satisfiability Testing (Q5714754) (← links)