Solving Over-Constrained Problems with SAT Technology

@inproceedings{Argelich2005SolvingOP,
  title={Solving Over-Constrained Problems with SAT Technology},
  author={Josep Argelich and Felip Many{\`a}},
  booktitle={SAT},
  year={2005}
}
We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clauses instead of individual clauses, and that allows one to declare each block either as hard (i.e., must be satisfied by any solution) or soft (i.e., can be violated by some solution). We then present two Max-SAT solvers that find a truth assignment that satisfies all the hard blocks of clauses and the maximum number of soft… CONTINUE READING
5 Citations
18 References
Similar Papers

Similar Papers

Loading similar papers…