Exact MinSAT solving

Authors:
Chu Min Li;Felip Manyà;Zhe Quan;Zhu Zhu
Affiliations:
Hunan Normal University, Changsha, China;Artificial Intelligence Research Institute (IIIA-CSIC), Bellaterra, Spain;MIS, Université de Picardie Jules Verne, Amiens, France;MIS, Université de Picardie Jules Verne, Amiens, France
Venue:
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Year:
2010

Citing 5
Cited 4

On approximation algorithms for the minimum satisfiability problem

Information Processing Letters
A fast algorithm for the maximum clique problem

Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Solving (Weighted) Partial MaxSAT through Satisfiability Testing

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Algorithms for Weighted Boolean Optimization

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
New inference rules for Max-SAT

Journal of Artificial Intelligence Research

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
A new encoding from MinSAT into MaxSAT

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
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

We present an original approach to exact MinSAT solving based on solving MinSAT using MaxSAT encodings and MaxSAT solvers, and provide empirical evidence that our generic approach is competitive.