Clone: solving weighted Max-SAT in a reduced search space

Authors:
Knot Pipatsrisawat;Adnan Darwiche
Affiliations:
Computer Science Department, University of California, Los Angeles;Computer Science Department, University of California, Los Angeles
Venue:
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Year:
2007

Citing 13
Cited 13

GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Compiling propositional weighted bases

Artificial Intelligence - Special issue on nonmonotonic reasoning
New inference rules for Max-SAT

Journal of Artificial Intelligence Research
A knowledge compilation map

Journal of Artificial Intelligence Research
Existential arc consistency: getting closer to full arc consistency in weighted CSPs

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
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
Using CSP look-back techniques to solve real-world SAT instances

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
On solving the partial MAX-SAT problem

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

Solving (Weighted) Partial MaxSAT through Satisfiability Testing

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Exploiting Cycle Structures in Max-SAT

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Within-problem learning for efficient lower bound computation in Max-SAT solving

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
New compilation languages based on structured decomposability

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Modelling Max-CSP as partial Max-SAT

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A preprocessor for Max-SAT solvers

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

Constraints
Towards computing revised models for FO theories

INAP'09 Proceedings of the 18th international conference on Applications of declarative programming and knowledge management
Sequential diagnosis by abstraction

Journal of Artificial Intelligence Research
Computing minimum-cardinality diagnoses by model relaxation

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Measuring incompleteness under multi-valued semantics by partial MaxSAT solvers

ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Oblivious bounds on the probability of boolean functions

ACM Transactions on Database Systems (TODS)
A SAT-based approach to cost-sensitive temporally expressive planning

ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new branch-and-bound Max-SAT solver, Clone, which employs a novel approach for computing lower bounds. This approach allows Clone to search in a reduced space. Moreover, Clone is equipped with novel techniques for learning from soft conflicts. Experimental results show that Clone performs competitively with the leading Max-SAT solver in the broadest category of this year's Max-SAT evaluation and outperforms last year's leading solvers.