Theory and Applications of Satisfiability Testing
From MaRDI portal
(Redirected from Publication:5714742)
Theory and Applications of Satisfiability Testing (scientific article; zbMATH DE number 2239197)
Theory and Applications of Satisfiability Testing (scientific article; zbMATH DE number 2239197)
Recommendations
- meSAT: multiple encodings of CSP to SAT
- Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
- scientific article; zbMATH DE number 2080324
- Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
- Mapping CSP into Many-Valued SAT
Cited in
(16)- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
- Propagation via lazy clause generation
- Iterative and core-guided maxsat solving: a survey and assessment
- Automatic generation of redundant models for permutation constraint satisfaction problems
- Using variable-entered karnaugh maps to solve boolean equations
- On Inconsistent Clause-Subsets for Max-SAT Solving
- Towards Robust CNF Encodings of Cardinality Constraints
- Sequential Encodings from Max-CSP into Partial Max-SAT
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
- Technology for translating combinatorial problems into Boolean equations
- Mapping multivalued onto Boolean dynamics
- MaxSAT resolution for regular propositional logic
- SAT encoding of partial ordering models for graph coloring problems
- Maximum satisfiability formulations for nonlinear integer programming
This page was built for publication: Theory and Applications of Satisfiability Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714742)
