Paper Info
Title
Solving Over-Constrained Problems with SAT
Abstract
We present a new generic problem solving approach for over- constrained problems based on Max-SAT. We rst dene a clausal form formalism that deals with blocks of clauses and distinguish between hard and soft blocks. We then present two Max-SAT-based solvers for our formalism and an experimental investigation.
Year
DOI
Venue
2005
10.1007/11564751_76
LECTURE NOTES IN COMPUTER SCIENCE
Field
DocType
Volume
ENCODE,Discrete mathematics,Mathematical optimization,Vertex (geometry),Computer science,Formalism (philosophy),Encoding (memory)
Conference
3709
ISSN
Citations 
PageRank 
0302-9743
1
0.47
References 
Authors
2
2
Name
Order
Citations
PageRank
Josep Argelich119018.95
Felip Manyà278759.52