A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Solving Max-SAT as Weighted CSP
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
We then solve Max-SAT instances using state-of-the-art algorithms for weighted Max-CSP, dedicated Max-SAT solvers and the state-of-the-art MIP solver CPLEX. ...
In this paper, we show how Max-SAT can be encoded as a weighted constraint network, either directly or using a dual encoding. ...
In this paper, we model the Max-SAT problem as a weighted CSP. ...
doi:10.1007/978-3-540-45193-8_25
fatcat:3bexqko4yvbpfdiexayiquqdqq
Encoding Max-CSP into Partial Max-SAT
2008
Proceedings - International Symposium on Multiple-Value Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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. ...
Moreover, we define a new variant of the support encoding from CSP into SAT which produces fewer clauses than the standard support encoding. * ...
As benchmarks we considered binary CSPs, which were obtained with a generator of uniform random binary CSPs 2 1 In weighted Max-CSP (Max-SAT), each constraint (clause) has a weight and the goal is to ...
doi:10.1109/ismvl.2008.22
dblp:conf/ismvl/ArgelichCLM08
fatcat:ev6ofyxumjgx5imzsliria2lce
Exact Max-SAT solvers for over-constrained problems
2006
Journal of Heuristics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We present a new generic problem solving approach for over-constrained problems based on Max-SAT. ...
Finally, we report an experimental investigation on a representative sample of instances (random 2-SAT, Max-CSP, graph coloring, pigeon hole and quasigroup completion) which provides experimental evidence ...
Weighted Max-SAT and Max-CSP encodings All the benchmarks encoded as Soft CNF formulas were also encoded as Boolean weighted Max-SAT instances in order to compare our solvers with Boolean weighted Max-SAT ...
doi:10.1007/s10732-006-7234-9
fatcat:fso2fx27lrdvbgelglqxm5apkm
Solving Over-Constrained Problems with SAT Technology
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
We present a new generic problem solving approach for overconstrained problems based on Max-SAT. ...
Finally, we present an experimental investigation to assess the performance of our approach on a representative sample of instances (random 2-SAT, Max-CSP, and graph coloring). ...
We performed experiments with ssoft-SAT solvers as well as with weighted Max-SAT solvers and a Max-CSP solver [10] . The solvers used are the following ones: -Soft-SAT-S with heuristic MO and csp. ...
doi:10.1007/11499107_1
fatcat:deqhgvnybfdj7jutifhwvrt4hy
Regular Encodings from Max-CSP into Partial Max-SAT
2009
2009 39th International Symposium on Multiple-Valued Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that regular encodings allow to solve more instances and more efficiently than using the existing encodings from Max-CSP into Partial Max-SAT. ...
We define a number of original encodings, called regular encodings, that map Max-CSP instances into Partial Max-SAT instances. ...
Partial Max-SAT. ...
doi:10.1109/ismvl.2009.23
dblp:conf/ismvl/ArgelichCLM09
fatcat:v766bxsvk5gbdlgcs3yf763k74
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
exponential space solving MAX-SAT and MAX-k-SAT, µ = Ω( 1 ck 2 ) and polynomial space solving MAX-k-CSP, µ = Ω( 1 √ ck 3 ) and exponential space solving MAX-k-CSP. ...
We give improved deterministic algorithms solving sparse instances of MAX-SAT and MAX-k-CSP. ...
MAX-k-CSP
Known algorithms for MAX-2-CSP Williams [19] gave an algorithm with constant savings solving general (nonsparse, weighted) MAX-2-CSP and MAX-2-SAT. ...
doi:10.1007/978-3-319-24318-4_4
fatcat:vcvuiznka5esbku2vktkt7qn7u
Optimal 2-constraint satisfaction via sum–product algorithms
2006
Information Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
As a corollary, MAX-2-SAT can be solved in O * (nm1.732 n ) time. ...
We show that for a given set of m pairwise constraints over n variables, a variable assignment that satisfies maximally many m constraints (MAX-2-CSP) can be found in O * (nm d nω/3 ) time, where d is ...
Thus, if an algorithm solves MAX-k-CSP, it trivially solves MAX-k-SAT as well. ...
doi:10.1016/j.ipl.2005.11.013
fatcat:fpus7uwhzbcxte4xb3w7bffiki
New exact algorithms for the 2-constraint satisfaction problem
2014
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
In particular MAX-2-SAT and MAX-2-CSP are known to generalize many hard combinatorial problems on graphs. ...
In this paper we continue this line of research and design new algorithms for the MAX-2-SAT and MAX-2-CSP problems. ...
Consider a problem instance of (n, ∆)-MAX-2-CSP given as a graph G = (V, E) and weight functions S = S v ∪ S e . ...
doi:10.1016/j.tcs.2014.01.010
fatcat:zn2v6j3xrzckfi2j24tfvhpn3u
Optimal Polynomial-Time Compression for Boolean Max CSP
2024
ACM Transactions on Computation Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
As another application of our reductions, we reveal tight connections between optimal running times for solving Max CSPΓ . ...
More precisely, we show that obtaining a running time of the form 𝒪(2 (1-ε) n ) for particular classes of Max CSP s is as hard as breaching this barrier for Max d -SAT for some d . ...
On the exponential-time front, we have shown that Max -CNF-SAT is as hard as any Max CSP of degree as long as negative weights are allowed. ...
doi:10.1145/3624704
fatcat:mlgufutumbenbcd4btxdtm5gkq
The First and Second Max-SAT Evaluations
2008
Journal on Satisfiability, Boolean Modeling and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We describe the organization and report on the results of the First and Second Max-SAT Evaluations, which were organized as affiliated events of the 2006 and 2007 editions of the International Conference ...
The main objectives of both evaluations were assessing the advancements in the field of Max-SAT solvers through a comparison of their performances, identifying successful solving techniques and encouraging ...
The present paper is structured as follows: In Section 2 we recall some basic definitions and define the problems solved in the evaluations (Max-SAT, Weighted Max-SAT, Partial Max-SAT, and Weighted Partial ...
doi:10.3233/sat190047
fatcat:5wy42jaburdpvlbd6n4j35e5je
A Dynamic Approach for MPE and Weighted MAX-SAT
2007
International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We describe reductions between MPE and weighted MAX-SAT, and show that both can be solved by a variant of weighted model counting. ...
The MPE-SAT algorithm is quite competitive with the state-of-the-art MAX-SAT, WCSP, and MPE solvers on a variety of problems. ...
It is a generic solver for weighted CSP and weighted MAX-SAT. We used version 3.0. ...
dblp:conf/ijcai/SangBK07
fatcat:huqbcmrzwncqvnfmdhjjsjqq2e
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
2012
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Since a pure 2-Sat input instance may be transformed to a general CSP instance in the course of being solved, the algorithm's efficiency and generality go hand in hand. ...
Parametrizing an instance by the fraction p of nonsimple clauses, we give an exact (exponential-time) algorithm that is the fastest polynomial-space algorithm known for Max 2-Sat (and other p = 0 formulas ...
To solve Max 2-Sat, all early algorithms treated pure 2-Sat formulas. ...
doi:10.1016/j.jcss.2011.05.010
fatcat:dztg6k2o5vdkfizzgmumslt6yu
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
[chapter]
2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Since a pure 2-Sat input instance may be transformed to a general CSP instance in the course of being solved, the algorithm's efficiency and generality go hand in hand. ...
Parametrizing an instance by the fraction p of nonsimple clauses, we give an exact (exponential-time) algorithm that is the fastest polynomial-space algorithm known for Max 2-Sat (and other p = 0 formulas ...
To solve Max 2-Sat, all early algorithms treated pure 2-Sat formulas. ...
doi:10.1137/1.9781611973068.67
fatcat:elpcxo2ukjbqdcqrrmdx3jn2dm
Optimal Polynomial-Time Compression for Boolean Max CSP
2020
European Symposium on Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
As another application of our reductions, we reveal tight connections between optimal running times for solving Max CSP(Γ). ...
More precisely, we show that obtaining a running time of the form 𝒪(2^{(1-ε)n}) for particular classes of Max CSPs is as hard as breaching this barrier for Max d-SAT for some d. ...
On the exponential-time front, we have shown that Max d-CNF-SAT is as hard as any Max CSP of degree d as long as negative weights are allowed. ...
doi:10.4230/lipics.esa.2020.63
dblp:conf/esa/Jansen020
fatcat:vdmlgng22nebvltgqwmnfgmei4
Solving Over-Constrained Problems with SAT
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We present a new generic problem solving approach for overconstrained problems based on Max-SAT. ...
We then present two Max-SAT-based solvers for our formalism and an experimental investigation. ...
This is a highly optimized solver from the Constraint Programming community for solving binary Max-CSP problems [2] . 4 http://carlit.toulouse.inra.fr/cgi-bin/awki.cgi/ToolBarIntro(version July, 2005) ...
doi:10.1007/11564751_76
fatcat:unin35gvyvgfzhjnu6mseckzwe
« Previous
Showing results 1 — 15 out of 1,685 results