A new clause learning scheme for efficient unsatisfiability proofs

Authors:
Knot Pipatsrisawat;Adnan Darwiche
Affiliations:
Computer Science Department, University of California, Los Angeles, Los Angeles, CA;Computer Science Department, University of California, Los Angeles, Los Angeles, CA
Venue:
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Year:
2008

Citing 5
Cited 17

GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Resolution With Merging

Journal of the ACM (JACM)
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
Towards a better understanding of the functionality of a conflict-driven SAT solver

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing

Minimizing Learned Clauses

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Comparing the performance of the genetic and local search algorithms for solving the satisfiability problems

Applied Soft Computing
Efficient SAT Techniques for Relative Encoding of Permutations with Constraints

AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Improving GASAT by replacing tabu search by DLM and enhancing the best members

Artificial Intelligence Review
On Modern Clause-Learning Satisfiability Solvers

Journal of Automated Reasoning
On the power of clause-learning SAT solvers with restarts

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Extended clause learning

Artificial Intelligence
A method for debugging of pipelined processors in formal verification by correspondence checking

Proceedings of the 2010 Asia and South Pacific Design Automation Conference
On the power of clause-learning SAT solvers as resolution engines

Artificial Intelligence
Method for formal verification of soft-error tolerance mechanisms in pipelined microprocessors

ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Clause-learning algorithms with many restarts and bounded-width resolution

Journal of Artificial Intelligence Research
Generalized conflict-clause strengthening for satisfiability solvers

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Automatic formal verification of multithreaded pipelined microprocessors

Proceedings of the International Conference on Computer-Aided Design
Conflict-driven answer set solving: From theory to practice

Artificial Intelligence
Concurrent clause strengthening

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Complexity issues related to propagation completeness

Artificial Intelligence
A survey of the satisfiability-problems solving algorithms

International Journal of Advanced Intelligence Paradigms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We formalize in this paper a key property of asserting clauses (the most common type of clauses learned by SAT solvers). We show that the formalized property, which is called empowerment, is not exclusive to asserting clauses, and introduce a new class of learned clauses which can also be empowering. We show empirically that (1) the new class of clauses tends to be much shorter and induce further backtracks than asserting clauses and (2) an empowering subset of this new class of clauses significantly improves the performance of the Rsat solver on unsatisfiable problems.