Efficient Generation of Unsatisfiability Proofs and Cores in SAT

Authors:
Roberto Asín;Robert Nieuwenhuis;Albert Oliveras;Enric Rodríguez-Carbonell
Affiliations:
No Affiliations,;No Affiliations,;No Affiliations,;No Affiliations,
Venue:
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2008

Citing 12
Cited 6

GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Alloy: a lightweight object modelling notation

ACM Transactions on Software Engineering and Methodology (TOSEM)
BerkMin: A Fast and Robust Sat-Solver

Proceedings of the conference on Design, automation and test in Europe
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
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
Algorithms for maximum satisfiability using unsatisfiable cores

Proceedings of the conference on Design, automation and test in Europe
Deciding bit-vector arithmetic with abstraction

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
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

Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
A Framework for Certified Boolean Branch-and-Bound Optimization

Journal of Automated Reasoning
Boosting minimal unsatisfiable core extraction

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Computing small unsatisfiable cores in satisfiability modulo theories

Journal of Artificial Intelligence Research
Faster extraction of high-level minimal unsatisfiable cores

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
A PLTL-prover based on labelled superposition with partial model guidance

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning

Quantified Score

Hi-index	0.01

Visualization

Abstract

Some modern DPLL-based propositional SAT solvers now have fast in-memory algorithms for generating unsatisfiability proofs and cores without writing traces to disk. However, in long SAT runs these algorithms still run out of memory. For several of these algorithms, here we discuss advantages and disadvantages, based on carefully designed experiments with our implementation of each one of them, as well as with (our implementation of) Zhang and Malik's one writing traces on disk. Then we describe a new in-memory algorithm which saves space by doing more bookkeeping to discard unnecessary information, and show that it can handle significantly more instances than the previously existing algorithms, at a negligible expense in time.