Exploiting symmetry in SMT problems

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

Volumn 6803 LNAI, Issue , 2011, Pages 222-236

  Déharbe, David ^a   Fontaine, Pascal ^b   Merz, Stephan ^b   Woltzenlogel Paleo, Bruno ^c  

^a FEDERAL UNIVERSITY OF RIO GRANDE DO NORTE   (Brazil)

^b UNIVERSITÉ DE LORRAINE   (France)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PROGRAMMING; SAT-SOLVING; SEARCH SPACES;

AUTOMATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

ALGORITHMS;

EID: 80051693392     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22438-6_18     Document Type: Conference Paper

References (17)

1. Audemard, G., Cimatti, A., Kornilowicz, A., Sebastiani, R.: Bounded model checking for timed systems. In: Peled, D., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol. 2529, pp. 243-259. Springer, Heidelberg (2002)
2. Barrett, C., de Moura, L., Stump, A.: SMT-COMP: Satisfiability Modulo Theories Competition. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 20-23. Springer, Heidelberg (2005) (Pubitemid 41431717)
3. Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, ch.26, vol. 185, pp. 825-885. IOS Press, Amsterdam (2009)
4. Baumgartner, P., Fuchs, A., de Nivelle, H., Tinelli, C.: Computing finite models by reduction to function-free clause logic. J. Applied Logic 7(1), 58-74 (2009)
5. Bouton, T., Caminha B. de Oliveira, D., Déharbe, D., Fontaine, P.: veriT: An open, trustable and efficient SMT-solver. In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol. 5663, pp. 151-156. Springer, Heidelberg (2009)
6. Buss, S.R.: Polynomial size proofs of the propositional pigeonhole principle. Journal of Symbolic Logic 52, 916-927 (1987)
7. Claessen, K., Sörensson, N.: New techniques that improve MACE-style finite model finding. In: Proceedings of the CADE-19 Workshop: Model Computation-Principles, Algorithms, Applications (2003)
8. Déharbe, D., Fontaine, P., Merz, S., Woltzenlogel Paleo, B.: Exploiting symmetry in SMT problems (2011), http://www.loria.fr/~fontaine/ Deharbe6b.pdf
9. Gent, I.P., Petrie, K.E., Puget, J.-F.: Symmetry in Constraint Programming. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Foundations of Artificial Intelligence, vol. 2, pp. 329-376. Elsevier, Amsterdam (2006)
10. Haken, A.: The intractability of resolution. Theoretical Computer Science 39, 297-308 (1985)
11. Jia, X., Zhang, J.: A powerful technique to eliminate isomorphism in finite model search. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 318-331. Springer, Heidelberg (2006) (Pubitemid 44532685)
12. Krishnamurthy, B.: Short proofs for tricky formulas. Acta Inf. 22, 253-275 (1985)
13. Razborov, A.A.: Proof complexity of pigeonhole principles. In: Conference on Developments in Language Theory (DLT), pp. 100-116. Springer, Heidelberg (2002)
14. Roe, K.: The heuristic theorem prover: Yet another SMT modulo theorem prover. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 467-470. Springer, Heidelberg (2006) (Pubitemid 44560899)
15. Sakallah, K.A.: Symmetry and satisfiability. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 289-338. IOS Press, Amsterdam (2009)
16. Strichman, O., Seshia, S.A., Bryant, R.E.: Deciding separation formulas with SAT. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 265-279. Springer, Heidelberg (2002)
17. Szeider, S.: The complexity of resolution with generalized symmetry rules. Theory Comput. Syst. 38(2), 171-188 (2005) (Pubitemid 41201575)