Constraint CNF: SAT and CSP Language Under One Roof.
From MaRDI portal
Recommendations
- Constraint satisfaction using constraint logic programming
- A synthesis of constraint satisfaction and constraint solving
- Satisfiability of \(\mathrm{CTL}^{*}\) with constraints
- Bridging constraint satisfaction and Boolean satisfiability
- scientific article; zbMATH DE number 1759715
- Constraint satisfaction from a deductive viewpoint
- SAT-solving in CSP trace refinement
- scientific article; zbMATH DE number 2096830
- scientific article; zbMATH DE number 1234562
Cites work
- Abstract Answer Set Solvers
- Abstract answer set solvers with backjumping and learning
- Compiling finite linear CSP into SAT
- Conflict-driven answer set solving: from theory to practice
- Constraint Answer Set Solving
- scientific article; zbMATH DE number 2080324 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Propagation via lazy clause generation
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Theory and Applications of Satisfiability Testing
Cited in
(1)
This page was built for publication: Constraint CNF: SAT and CSP Language Under One Roof.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5240215)
