Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 427-440
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms2008
- Algorithms for Maximum Satisfiability using Unsatisfiable Cores2008
- Clone: Solving Weighted Max-SAT in a Reduced Search Space2007
- New Inference Rules for Max-SATJournal of Artificial Intelligence Research, 2007
- MiniMaxSat: A New Weighted Max-SAT Solver2007
- Partial Max-SAT Solvers with Clause Learning2007
- On Inconsistent Clause-Subsets for Max-SAT Solving2007
- On Solving the Partial MAX-SAT Problem2006
- Mapping Problems with Finite-Domain Variables to Problems with Boolean VariablesLecture Notes in Computer Science, 2005
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints2005