Modelling Max-CSP as Partial Max-SAT
نویسندگان
چکیده
We define a number of original encodings that map MaxCSP 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.
منابع مشابه
Sequential Encodings from Max-CSP into Partial Max-SAT
We define new encodings from Max-CSP into Partial MaxSAT which are obtained by modelling the at-most-one condition with the sequential SAT encoding of the cardinality constraint ≤ 1(x1, . . . , xn). They have fewer clauses than the existing encodings, and the experimental results indicate that they have a better performance profile.
متن کاملImproved Algorithms for Sparse MAX-SAT and MAX-k-CSP
We give improved deterministic algorithms solving sparse instances of MAX-SAT and MAX-k-CSP. For instances with n variables and cn clauses (constraints), we give algorithms running in time poly(n)· 2n(1−μ) for – μ = Ω( 1 c ) and polynomial space solving MAX-SAT and MAX-kSAT, – μ = Ω( 1 √ c ) and exponential space solving MAX-SAT and MAX-kSAT, – μ = Ω( 1 ck2 ) and polynomial space solving MAX-k-...
متن کاملComparative Studies of Constraint
Maximum satissability (MAX-SAT) is an extension of satissability (SAT), in which a partial solution is sought that satisses the maximum number of clauses in a logical formula. Enumerative methods giving guaranteed optimal solutions can be derived from traditional search algorithms used to solve SAT problems, in particular the Davis-Putnam procedure. Algorithms have also been developed for the m...
متن کاملSolving Max-SAT as Weighted CSP
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We wanted to see how recent progress in the weighted CSP (WCSP) field could compete with other approaches in related fields. One of these fields is propositional logic and the well-known Max-SAT problem. In this paper, we...
متن کاملNew Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree
MAX-2-SAT and MAX-2-CSP are important NP-hard optimization problems generalizing many graph problems. Despite many efforts, the only known algorithm (due to Williams) solving them in less than 2 steps uses exponential space. Scott and Sorkin give an algorithm with 2 2 d+1 ) time and polynomial space for these problems, where d is the average variable degree. We improve this bound to O∗(2 10/3 d...
متن کامل