The following pages link to (Q4804883):
Displayed 11 items.
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction (Q352963) (← links)
- A pearl on SAT and SMT solving in Prolog (Q428887) (← links)
- Solving constraint satisfaction problems with SAT modulo theories (Q487632) (← links)
- New methods for proving the impossibility to solve problems through reduction of problem spaces (Q693286) (← links)
- Formalization and implementation of modern SAT solvers (Q839035) (← links)
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures (Q862395) (← links)
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- Processes and continuous change in a SAT-based planner (Q2457662) (← links)
- Building Bridges Between Sets of Partial Orders (Q2799169) (← links)
- An Algorithm for Direct Construction of Complete Merged Processes (Q3011883) (← links)