Read-once resolution for unsatisfiability-based Max-SAT algorithms

Authors:
Federico Heras;Joao Marques-Silva
Affiliations:
University College Dublin, Dublin, Ireland;University College Dublin, Dublin, Ireland
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Year:
2011

Citing 15
Cited 2

Intriactability of Read-Once Resolution

SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
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
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
Towards understanding and harnessing the potential of clause learning

Journal of Artificial Intelligence Research
New inference rules for Max-SAT

Journal of Artificial Intelligence Research
MINIMAXSAT: an efficient weighted max-SAT solver

Journal of Artificial Intelligence Research
Soft arc consistency revisited

Artificial Intelligence
Variable dependency in local search: prevention Is better than cure

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A Max-SAT inference-based pre-processing for Max-clique

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Resolution-based lower bounds in MaxSAT

Constraints
On solving the partial MAX-SAT problem

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

Resolution procedures for multiple-valued optimization

Information Sciences: an International Journal
Iterative and core-guided MaxSAT solving: A survey and assessment

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes the integration of the resolution rule for Max-SAT with unsatisfiability-based Max-SAT solvers. First, we show that the resolution rule for Max-SAT can be safely applied as dictated by the resolution proof associated with an unsatisfiable core when such proof is read-once, that is, each clause is used at most once in the resolution process. Second, we study how this property can be integrated in an unsatisfiability-based solver. In particular, the resolution rule for Max-SAT is applied to read-once proofs or to read-once subparts of a general proof. Finally, we perform an empirical investigation on structured instances from recent Max-SAT evaluations. Preliminary results show that the use of read-once resolution substantially improves the performance of the solver.