Practical algorithms for unsatisfiability proof and core generation in SAT solvers

AI Communications

Volumn 23, Issue 2-3, 2010, Pages 145-157

  Achá, Roberto Asín ^a   Nieuwenhuis, Robert ^a   Oliveras, Albert ^a   Rodríguez Carbonell, Enric ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

DPLL; SAT; SAT proofs; SAT solvers; Unsatisfiable cores

Indexed keywords

ALGORITHMIC APPROACH; CORE GENERATION; DEPTH FIRST; DESIGNED EXPERIMENTS; MEMORY USAGE; OUT-OF-MEMORY; PRACTICAL ALGORITHMS; RESOLUTION PROOFS; SAT PROOFS; SAT SOLVERS; UNSATISFIABLE CORE;

ALGORITHMS; AUTOMATA THEORY; DECISION THEORY; DISKS (STRUCTURAL COMPONENTS); TRACE ANALYSIS;

BOOLEAN FUNCTIONS;

EID: 77950191142     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: 10.3233/AIC-2010-0462     Document Type: Conference Paper

References (19)

1. R.J. Bayardo Jr. and R.C. Schrag, Using CSP look-back techniques to solve real-world SAT instances, in: Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), Providence, RI, 1997, pp. 203-208.
2. A. Biere, Picosat essentials, JSAT 4(2-4) (2008), 75-97.
3. R.E. Bryant, D. Kroening, J. Ouaknine, S.A. Seshia, O. Strichman and B.A. Brady, Deciding bit-vector arithmetic with abstraction, in: Proceedings of 13th Tools and Algorithms for the Construction and Analysis of Systems (TACAS) Conference, LNCS, Vol.4424, Springer, 2007, pp. 358-372.
4. M. Davis, G. Logemann and D. Loveland, A machine program for theorem-proving, Communications of the ACM 5(7) (1962), 394-397.
5. M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the ACM 7 (1960), 201-215.
6. J.R.G. Denzinger and S. Schulz, Recording and analysing knowledge-based distributed deduction processes, Journal of Symbolic Computation 21(4-6) (1996), 523-541.
7. Z. Fu and S. Malik, On solving the partialMAX-SAT problem, in: Proceedings of the International Conference on Theory and Applications of Satisfiability Testing (SAT), Seattle, WA, USA, 2006, pp. 252-265.
8. A. Van Gelder, Extracting (easily) checkable proofs from a satisfiability solver that employs both preorder and postorder resolution, in: Seventh Int'l Symposium on AI and Mathematics (AMAI), Lauderdale, FL, USA, 2002.
9. E. Goldberg and Y. Novikov, BerkMin: A fast and robust SATsolver, in: Design, Automation, and Test in Europe (DATE'02), Paris, France, 2002, pp. 142-149.
10. E. Goldberg and Y. Novikov, Verification of proofs of unsatisfiability for cnf formulas, in: DATE'03: Proceedings of the conference on Design, Automation and Test in Europe, Washington, DC, USA, IEEE Computer Society, 2003, p. 10886.
11. A. Haken, The intractability of resolution, Theoretical Computer Science 39 (1985), 297-308.
12. D. Jackson, Alloy: a lightweight object modelling notation, ACM Transactions on Software Engineering and Methodology (TOSEM) 11(2) (2002), 256-290.
13. J. Marques-Silva and J. Planes, Algorithms for maximum satisfiability using unsatisfiable cores, in: DATE'08: Proceedings of the Conference on Design, Automation and Test in Europe, New York, NY, USA, ACM, 2008, pp. 408-413.
14. J. Marques-Silva and K.A. Sakallah, GRASP: A search algorithm for propositional satisfiability, IEEE Transactions on Computer 48(5) (1999), 506-521.
15. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang and S. Malik, Chaff: engineering an efficient SAT solver, in: Proceedings of the 38th Design Automation Conference (DAC'01), Las Vegas, NV, USA, 2001, pp. 530-535.
16. R. Nieuwenhuis, A. Oliveras and C. Tinelli, Solving sat and sat modulo theories: From an abstract Davis-Putnam-Logemann- Loveland procedure to dpll(t), Journal of the ACM 53(6) (2006), 937-977.
17. A. Riazanov and A. Voronkov, The design and implementation of VAMPIRE, AI Communications 15 (2002), 91-110.
18. L. Zhang, C.F. Madigan, M.W. Moskewicz and S. Malik, Efficient conflict driven learning in a Boolean satisfiability solver, in: International Conference on Computer-Aided Design (ICCAD'01), San Jose, CA, USA, 2001, pp. 279-285.
19. L. Zhang and S. Malik, Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications, in: Proceedings of Design, Automation and Test in Europe Conference (DATE'2003), Munich, Germany, IEEE Computer Society, 2003, pp. 10880-10885.