Efficient generation of unsatisfiability proofs and cores in SAT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5330 LNAI, Issue , 2008, Pages 16-30

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

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DISKS (STRUCTURAL COMPONENTS);

DESIGNED EXPERIMENTS; OUT OF MEMORIES; SAT SOLVERS; UNSATISFIABILITY;

BOOLEAN FUNCTIONS;

EID: 58049128266     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89439-1_2     Document Type: Conference Paper

References (14)

1. Biere, A.: PicoSAT essentials, Private communication. Journal on Satisfiability, Boolean Modeling and Computation (submitted, 2008)
2. Bryant, R.E., Kroening, D., Ouaknine, J., Seshia, S.A., Strichman, O., Brady, B.A.: Deciding bit-vector arithmetic with abstraction. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 358-372. Springer, Heidelberg (2007)
3. Bayardo Jr., R.J., Schrag, R.C.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI 1997), Providence, Rhode Island, pp. 203-208 (1997)
4. Davis, M., Logemann, G., Loveland, D.: A machine program for theoremproving. Comm. of the ACM 5(7), 394-397 (1962)
5. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7, 201-215 (1960)
6. Fu, Z., Malik, S.: On solving the partial max-sat problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 252-265. Springer, Heidelberg (2006)
7. Goldberg, E., Novikov, Y.: BerkMin: A fast and robust SAT-solver. In: Design, Automation, and Test in Europe (DATE 2002), pp. 142-149 (2002)
8. Haken, A.: The intractability of resolution. Theor. Comput. Sci. 39, 297-308 (1985)
9. Jackson, D.: Alloy: a lightweight object modelling notation. ACM Trans. Softw. Eng. Methodol. 11(2), 256-290 (2002)
10. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proc. 38th Design Automation Conference (DAC 2001) (2001)
11. Marques-Silva, J., Planes, J.: Algorithms for maximum satisfiabilhy using unsatisfiable cores. In: Proceedings of Design, Automation and Test in Europe (DATE 2008), pp. 408-413 (2008)
12. Marques-Silva, J., Sakallah, K.A.: GRASP: A search algorithm for propositioned satisfiability. IEEE Trans. Comput. 48(5), 506-521 (1999)
13. Nieuwenhuis, R., Oliveras, A., Tinelli, C: Solving SAT and SAT Modulo Theories: from an Abstract Davis-Putnam-Logemann-Loveland Procedure to DPLL(T). Journal of the ACM 53(6), 937-977 (2006)
14. Zhang, L., Malik, S.: Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications. In: 2003 Design, Automation and Test in Europe Conference (DATE 2003), pp. 10880-10885. IEEE Computer Society, Los Alamitos (2003)