Computing small unsatisfiable cores in satisfiability modulo theories

Journal of Artificial Intelligence Research

Volumn 40, Issue , 2011, Pages 701-718

  Cimatti, Alessandro ^a   Griggio, Alberto ^a   Sebastiani, Roberto ^b  

^a ITC IRST   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ABSTRACTIONS; EMPIRICAL TEST; FORMAL VERIFICATIONS; PLUG-AND-PLAY; PROPOSITIONAL LOGIC; REDUCTION TECHNIQUES; SATISFIABILITY MODULO THEORIES; THEORY INFORMATION; UNSATISFIABLE CORE; VERIFICATION PROBLEMS;

FORMAL LOGIC;

EID: 79956352760     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3196     Document Type: Article

References (42)

1. Asin, R., Nieuwenhuis, R., Oliveras, A., & Rodríguez Carbonell, E. (2008). Effcient Gen- eration of Unsatisfiability Proofs and Cores in SAT. In Cervesato, I., Veith, H., & Voronkov, A. (Eds.), Proceedings of LPAR'08, Vol. 5330 of LNCS, pp. 16-30. Springer.
2. Audemard, G., Bertoli, P., Cimatti, A., Korni lowicz, A., & Sebastiani, R. (2002). A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propo- sitions. In Proc. CADE'2002., Vol. 2392 of LNAI. Springer.
3. Barrett, C., Nieuwenhuis, R., Oliveras, A., & Tinelli, C. (2006). Splitting on Demand in SAT Modulo Theories.. In Hermann, M., & Voronkov, A. (Eds.), LPAR, Vol. 4246 of LNCS, pp. 512-526. Springer. (Pubitemid 44850698)
4. Barrett, C., & Tinelli, C. (2007). CVC3. In Damm, W., & Hermanns, H. (Eds.), CAV, Vol. 4590 of LNCS, pp. 298-302. Springer.
5. Barrett, C. W., Dill, D. L., & Stump, A. (2002). Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT. In Brinksma, E., & Larsen, K. G. (Eds.), Computer Aided Verification, 14th International Conference, CAV 2002, Copenhagen, Denmark, July 27-31, 2002, Proceedings, Vol. 2404 of LNCS, pp. 236-249. Springer.
6. Barrett, C. W., Sebastiani, R., Seshia, S. A., & Tinelli, C. (2009). Satisfiability modulo theories. In Biere, A., Heule, M., & van Maaren, H. (Eds.), Handbook of Satisfiability. IOS Press.
7. Biere, A. (2008). Picosat essentials. Journal on Satisfiability, Boolean Modeling and Com- putation (JSAT), 4, 75-97.
8. Bruttomesso, R., Cimatti, A., Franzén, A., Griggio, A., & Sebastiani, R. (2008). The MathSAT 4 SMT Solver. In Gupta, A., & Malik, S. (Eds.), CAV, Vol. 5123 of LNCS, pp. 299-303. Springer.
9. Bryant, R. E., Kroening, D., Ouaknine, J., Seshia, S. A., Strichman, O., & Brady, B. (2009). An abstraction-based decision procedure for bit-vector arithmetic. Int. J. Softw. Tools Technol. Transf., 11 (2), 95-104.
10. Cimatti, A., Griggio, A., & Sebastiani, R. (2007). A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories.. In Marques-Silva, J., & Sakallah, K. A. (Eds.), SAT, Vol. 4501 of LNCS, pp. 334-339. Springer.
11. Davis, M., & Putnam, H. (1960). A computing procedure for quantification theory. Journal of the ACM, 7, 201-215.
12. Davis, M., Logemann, G., & Loveland, D. W. (1962). A machine program for theorem- proving.. Commun. ACM, 5 (7), 394-397.
13. de Moura, L., & Bjørner, N. (2008). Z3: An Effcient SMT Solver. In Ramakrishnan, C. R., & Rehof, J. (Eds.), TACAS, Vol. 4963 of LNCS, pp. 337-340. Springer.
14. Dershowitz, N., Hanna, Z., & Nadel, A. (2006). A Scalable Algorithm for Minimal Unsat- isfiable Core Extraction.. In Proceedings of SAT'06, Vol. 4121 of LNCS. Springer.
15. Dutertre, B., & de Moura, L. (2006). A Fast Linear-Arithmetic Solver for DPLL(T). In Proc. CAV'06, Vol. 4144 of LNCS. Springer.
16. Enderton, H. (1972). A Mathematical Introduction to Logic. Academic Pr.
17. Flanagan, C., Joshi, R., Ou, X., & Saxe, J. B. (2003). Theorem Proving Using Lazy Proof Explication.. In Jr., W. A. H., & Somenzi, F. (Eds.), CAV, Vol. 2725 of LNCS, pp. 355-367. Springer.
18. Gershman, R., Koifman, M., & Strichman, O. (2008). An approach for extracting a small unsatisfiable core. Formal Methods in System Design, 33 (1-3), 1-27.
19. Goel, A., Sajid, K., Zhou, H., Aziz, A., & Singhal, V. (1998). BDD Based Procedures for a Theory of Equality with Uninterpreted Functions.. In Hu, A. J., & Vardi, M. Y. (Eds.), CAV, Vol. 1427 of LNCS, pp. 244-255. Springer. (Pubitemid 128092343)
20. Goldberg, E. I., & Novikov, Y. (2003). Verification of Proofs of Unsatisfiability for CNF Formulas. In Proceedings of 2003 Design, Automation and Test in Europe Conference and Exposition (DATE 2003), pp. 886-891. IEEE Computer Society.
21. Grumberg, O., Lerda, F., Strichman, O., & Theobald, M. (2005). Proof-guided underapproximation-widening for multi-process systems. SIGPLAN Not., 40 (1), 122- 131.
22. Huang, J. (2005). MUP: A minimal unsatisfiability prover. In Proceedings of ASP-DAC '05. ACM Press.
23. Lffiton, M., & Sakallah, K. (2008). Algortithms for Computing Minimal Unsatisfiable Subsets of Constraints. Journal of Automated Reasoning, 40 (1).
24. Lynce, I., & Marques-Silva, J. P. (2004). On Computing Minimum Unsatisfiable Cores. In SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings.
25. Marques-Silva, J. P., & Sakallah, K. A. (1996). GRASP - A new Search Algorithm for Satisfiability. In Proc. ICCAD'96.
26. McMillan, K. L. (2002). Applying SAT Methods in Unbounded Symbolic Model Checking. In Brinksma, E., & Larsen, K. G. (Eds.), Proceedings of CAV'02, Vol. 2404 of LNCS, pp. 250-264. Springer.
27. McMillan, K. L., & Amla, N. (2003). Automatic abstraction without counterexamples. In Garavel, H., & Hatcliff, J. (Eds.), Proceedings of TACAS'03, Vol. 2619 of LNCS, pp. 2-17. Springer.
28. Mneimneh, M. N., Lynce, I., Andraus, Z. S., Marques-Silva, J. P., & Sakallah, K. A. (2005). A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable For- mulas.. In Proc. SAT'05, Vol. 3569 of LNCS. Springer.
29. Nadel, A. (2010). Boosting Minimal Unsatisfiable Core Extraction. In Bloem, R., & Shary- gina, N. (Eds.), Proceedings of the 10th International Conference on Formal Methods in Computer-Aided Design (FMCAD2010), pp. 221-229.
30. Nieuwenhuis, R., Oliveras, A., & Tinelli, C. (2006). Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM, 53 (6), 937-977. (Pubitemid 46276962)
31. Oh, Y., Mneimneh, M. N., Andraus, Z. S., Sakallah, K. A., & Markov, I. L. (2004). Amuse: A Minimally-Unsatisfiable Subformula Extractor. In Proceedings of DAC'04. ACM/IEEE.
32. Ranise, S., & Tinelli, C. (2006). The Satisfiability Modulo Theories Library (SMT-LIB). www.SMT-LIB.org .
33. Sebastiani, R. (2007). Lazy Satisfiability Modulo Theories. Journal on Satisfiability, Boolean Modeling and Computation, JSAT, Volume 3.
34. Strichman, O., Seshia, S. A., & Bryant, R. E. (2002). Deciding Separation Formulas with SAT. In Brinksma, E., & Larsen, K. G. (Eds.), CAV, Vol. 2404 of LNCS, pp. 209-222. Springer.
35. Suelow, A., Fey, G., Bloem, R., & Drechsler, R. (2008). Using unsatisfiable cores to debug multiple design errors. In Proceedings of GLSVLSI'08, pp. 77-82, New York, NY, USA. ACM.
36. Tseitin, G. S. (1983). On the complexity of derivation in propositional calculus. Automation of Reasoning: Classical Papers in Computational Logic 1967-1970Studies in Construc- tive Mathematics and Mathematical Logic, Part 2, 2. Originally published 1970.
37. van Maaren, H., & Wieringa, S. (2008). Finding Guaranteed MUSes Fast. In SAT, Vol. 4996 of LNCS, pp. 291-304. Springer. (Pubitemid 351775518)
38. Wang, C., Kim, H., & Gupta, A. (2007). Hybrid CEGAR: Combining variable hiding and predicate abstraction. In Proceedings of ICCAD'07, pp. 310-317, Piscataway, NJ, USA. IEEE Press.
39. Zhang, J., Li, S., & Shen, S. (2006). Extracting Minimum Unsatisfiable Cores with a Greedy Genetic Algorithm.. In Proceedings of ACAI, Vol. 4304 of LNCS. Springer.
40. Zhang, L., Madigan, C. F., Moskewicz, M. H., & Malik, S. (2001). Effcient conict driven learning in a boolean satisfiability solver. In Proceedings of ICCAD '01. IEEE Press.
41. Zhang, L., & Malik, S. (2002). The quest for efficient boolean satisfiability solvers.. In Voronkov, A. (Ed.), CADE, Vol. 2392 of LNCS, pp. 295-313. Springer.
42. Zhang, L., & Malik, S. (2003). Extracting Small Unsatisfiable Cores from Unsatisfiable Boolean Formulas. In Proceedings of 6th International Conference on Theory and Applications of Satisfiability Testing (SAT2003)