A new encoding from MinSAT into MaxSAT

Authors:
Zhu Zhu;Chu-Min Li;Felip Manyà;Josep Argelich
Affiliations:
MIS, Université de Picardie Jules Verne, Amiens, France;MIS, Université de Picardie Jules Verne, Amiens, France;Artificial Intelligence Research Institute (IIIA, CSIC), Bellaterra, Spain;Dept. of Computer Science, Universitat de Lleida, Lleida, Spain
Venue:
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Year:
2012

Citing 11
Cited 0

Pseudo-boolean optimization

Discrete Applied Mathematics
Resolution for Max-SAT

Artificial Intelligence
A logical approach to efficient Max-SAT solving

Artificial Intelligence
New inference rules for Max-SAT

Journal of Artificial Intelligence Research
Soft arc consistency revisited

Artificial Intelligence
Resolution-based lower bounds in MaxSAT

Constraints
Analyzing the instances of the MaxSAT evaluation

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Exact MinSAT solving

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Minimum satisfiability and its applications

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Optimizing with minimum satisfiability

Artificial Intelligence
Natural Max-SAT encoding of Min-SAT

LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

MinSAT is the problem of finding a truth assignment that minimizes the number of satisfied clauses in a CNF formula. When we distinguish between hard and soft clauses, and soft clauses have an associated weight, then the problem, called Weighted Partial MinSAT, consists in finding a truth assignment that satisfies all the hard clauses and minimizes the sum of weights of satisfied soft clauses. In this paper we define a novel encoding from Weighted Partial MinSAT into Weighted Partial MaxSAT, which is also valid for encoding Weighted Partial MaxSAT into Weighted Partial MinSAT. Moreover, we report on an empirical investigation that shows that our encoding significantly outperforms existing encodings on weighted and unweighted Min2SAT and Min3SAT instances.