A preprocessor for Max-SAT solvers

Authors:
Josep Argelich;Chu Min Li;Felip Manyà
Affiliations:
Computer Science Department, Universitat de Lleida, Lleida, Spain;LaRIA, Université de Picardie Jules Verne, Amiens Cedex 01, France;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 14
Cited 0

Exact Max-SAT solvers for over-constrained problems

Journal of Heuristics
Resolution for Max-SAT

Artificial Intelligence
Algorithms for maximum satisfiability using unsatisfiable cores

Proceedings of the conference on Design, automation and test in Europe
New inference rules for efficient Max-SAT solving

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a preprocessor that incorporates a variable saturation procedure for Max-SAT, and provide empirical evidence that it improves the performance of some of the most successful state-of-the-art solvers on several partial (weighted) Max-SAT instances of the 2007 Max-SAT Evaluation.