Arrow Research search
Back to SAT

SAT 2008

Modelling Max-CSP as Partial Max-SAT

Conference Paper Accepted Paper Logic in Computer Science · Satisfiability

Abstract

Abstract We define a number of original encodings that map Max-CSP instances into partial Max-SAT instances. Our encodings rely on the well-known direct and support encodings from CSP into SAT. Then, we report on an experimental investigation that was conducted to compare the performance profile of our encodings on random binary Max-CSP instances. Moreover, we define a new variant of the support encoding from CSP into SAT which produces fewer clauses than the standard support encoding.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
International Conference on Theory and Applications of Satisfiability Testing
Archive span
2003-2025
Indexed papers
824
Paper id
191968051347359861
v2026.09.13