On preprocessing for weighted MaxSAT
From MaRDI portal
Recommendations
Cites work
- A linear-time transformation of linear inequalities into conjunctive normal form
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Algorithm and bound for the greatest common divisor of n integers
- Algorithms for computing backbones of propositional formulae
- Boolean lexicographic optimization: algorithms \& applications
- Core-boosted linear search for incomplete MaxSAT
- Dynamic polynomial watchdog encoding for solving weighted MaxSAT
- Efficient CNF encoding of Boolean cardinality constraints
- Exact algorithms for MAX-SAT
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- Incremental inprocessing in SAT solving
- Multi‐objective combinatorial optimization problems: A survey
- On computing backbones of propositional theories
- QMaxSAT: A partial Max-SAT solver
- The (D)QBF preprocessor HQSpre -- underlying theory and its implementation
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
Cited in
(6)- Dynamic polynomial watchdog encoding for solving weighted MaxSAT
- Clause redundancy and preprocessing in maximum satisfiability
- SAT-based preprocessing for MaxSAT
- A Preprocessor for Max-SAT Solvers
- scientific article; zbMATH DE number 1444320 (Why is no real title available?)
- Certified MaxSAT preprocessing
This page was built for publication: On preprocessing for weighted MaxSAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234104)