On using incremental encodings in unsatisfiability-based MaxSAT solving
From MaRDI portal
Recommendations
- Incremental Encoding and Solving of Cardinality Constraints
- Resizing cardinality constraints for MaxSAT
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Exploiting resolution-based representations for MaxSAT solving
- N-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
Cites work
- A linear-time transformation of linear inequalities into conjunctive normal form
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Algorithms for Weighted Boolean Optimization
- An overview of parallel SAT solving
- Boolean lexicographic optimization: algorithms \& applications
- Cardinality networks: a theoretical and empirical study
- Cores in core based MaxSat algorithms: an analysis
- Curriculum-based course timetabling with SAT and MaxSAT
- Efficient and accurate haplotype inference by combining parsimony and pedigree information
- Efficient CNF encoding of Boolean cardinality constraints
- Efficient SAT solving under assumptions
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 1852147 (Why is no real title available?)
- Improvements to core-guided binary search for MaxSAT
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
- Incremental Encoding and Solving of Cardinality Constraints
- Incremental QBF solving by DepQBF
- Iterative and core-guided maxsat solving: a survey and assessment
- New Encodings of Pseudo-Boolean Constraints into CNF
- On Solving the Partial MAX-SAT Problem
- Open-WBO: a modular MaxSAT solver
- Progression in maximum satisfiability
- QMaxSAT: A partial Max-SAT solver
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Solving the incremental satisfiability problem
- Temporal induction by incremental SAT solving
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Unsatisfiability-based optimization in clasp
Cited in
(7)- Solving MaxSAT with bit-vector optimization
- N-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Solving the incremental satisfiability problem
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
- Resizing cardinality constraints for MaxSAT
- Progression in maximum satisfiability
This page was built for publication: On using incremental encodings in unsatisfiability-based MaxSAT solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015594)
