Modelling Max-CSP as partial Max-SAT

Authors:
Josep Argelich;Alba Cabiscol;Inês Lynce;Felip Manyà
Affiliations:
Computer Science Department, Universitat de Lleida, Lleida, Spain;Computer Science Department, Universitat de Lleida, Lleida, Spain;IST, INESC-ID, Technical University of Lisbon, Lisboa, Portugal;Computer Science Department, Universitat de Lleida, Lleida, Spain
Venue:
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Year:
2008

Citing 17
Cited 5

On the parallel complexity of discrete relaxation in constraint satisfaction networks

Artificial Intelligence
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Exact Max-SAT solvers for over-constrained problems

Journal of Heuristics
Resolution for Max-SAT

Artificial Intelligence
A logical approach to efficient Max-SAT solving

Artificial Intelligence
Algorithms for maximum satisfiability using unsatisfiable cores

Proceedings of the conference on Design, automation and test in Europe
Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
New inference rules for Max-SAT

Journal of Artificial Intelligence Research
Resolution in Max-SAT and its relation to local consistency in weighted CSPs

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Partial max-SAT solvers with clause learning

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
MiniMaxSAT: a new weighted Max-SAT solver

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Structural relaxations by variable renaming and their compilation for solving MinCostSAT

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
The log-support encoding of CSP into SAT

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Clone: solving weighted Max-SAT in a reduced search space

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Improved exact solvers for weighted Max-SAT

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
A complete calculus for Max-SAT

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
On solving the partial MAX-SAT problem

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Sequential Encodings from Max-CSP into Partial Max-SAT

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
A declarative approach to robust weighted Max-SAT

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Restoring CSP Satisfiability with MaxSAT

Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
An empirical study of encodings for group MaxSAT

Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Reformulation based MaxSAT robustness

Constraints

Quantified Score

Hi-index	0.00

Visualization

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.