T-decision by decomposition

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

Volumn 4603 LNAI, Issue , 2007, Pages 199-214

  Bonacina, Maria Paola ^a   Echenim, Mnacho ^a  

^a UNIVERSITY OF VERONA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; DOMAIN DECOMPOSITION METHODS; PROBLEM SOLVING; THEOREM PROVING;

BOOLEAN REASONING; REWRITE-BASED APPROACH; SATISFIABILITY MODULO THEORIES;

DECISION TREES;

EID: 35148865251     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-73595-3_14     Document Type: Conference Paper

References (18)

1. Armando, A., Bonacina, M.P., Ranise, S., Schulz, S.: On a rewriting approach to satisfiability procedures: Extension, combination of theories and an experimental appraisal. In: Gramlich, B. (ed.) Frontiers of Combining Systems. LNCS (LNAI), vol. 3717, pp. 65-80. Springer, Heidelberg (2005)
2. Armando, A., Bonacina, M.P., Ranise, S., Schulz, S.: New results on rewritebased satisfiability procedures. ACM Transactions on Computational Logic, Accepted pending revision, February 2007, full version of [1] (2007) available at http://profs.sci.univr.it/~bonacina/rewsat.html
3. Armando, A., Ranise, S., Rusinowitch, M.: A rewriting approach to satisfiability procedures. Inf. Comput. 183(2), 140-164 (2003)
4. Bonacina, M.P.: A taxonomy of theorem-proving strategies. In: Veloso, M.M., Wooldridge, M.J. (eds.) Artificial Intelligence Today. LNCS (LNAI), vol. 1600, pp. 43-84. Springer, Heidelberg (1999)
5. Bonacina, M.P., Echenim, M.: On variable-inactivity and polynomial T-satisfiability procedures (submitted)
6. Bonacina, M.P., Echenim, M.: Rewrite-based satisfiability procedures for recursive data structures. In: Cook, B., Sebastiani, R. (eds.) Proc. 4th PDPAR Workshop, FLoC 2006, ENTCS, Elsevier, Amsterdam (to appear)
7. Bonacina, M.P., Echenim, M.: Theory decision by decomposition. Technical Report RR 50/2007 Dipartimento di Informatica, Università degli Studi di Verona (2007) Available at http://profs.sci.univr.it/~echenim
8. Bradley, A.R., Manna, Z., Sipma, H.B.: What's decidable about arrays? In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 427-442. Springer, Heidelberg (2005)
9. Cyrluk, D., Möller, O., Rueß, H.: An efficient decision procedure for a theory of fixed-sized bitvectors with composition and extraction. Technical Report UIB96-08, Fakultät für Informatik, Universität Ulm, Ulm, Germany (1996)
10. Dershowitz, N., Plaisted, D.A.: Rewriting. In: Robinson, J., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, pp. 535-610. Elsevier, Amsterdam (2001)
11. Detlefs, D.L., Nelson, G., Saxe, J.B.: Simplify: a theorem prover for program checking. J. ACM 52(3), 365-473 (2005)
12. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM TOPLAS 1(2), 245-257 (1979)
13. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: from an Abstract Davis-Putnam-Logemann-Loveland Procedure to DPLL(T). J. ACM 53(6), 937-977 (2006)
14. Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 371-443. Elsevier and MIT Press (2001)
15. Peltier, N.: A calculus combining resolution and enumeration for building finite models. Journal of Symbolic Computation 36(1-2), 49-77 (2003)
16. Schulz, S.: E - a brainiac theorem prover. J. of AI Communications 15(2-3), 111-126 (2002)
17. Stump, A., Barrett, C.W., Dill, D.L., Levitt, J.R.: A decision procedure for an extensional theory of arrays. In: LICS, pp. 29-37 (2001)
18. Zhang, L., Malik, S.: The quest for efficient boolean satisfiability solvers. In: Voronkov, A. (ed.) Automated Deduction - CADE-18. LNCS (LNAI), vol. 2392, pp. 295-313. Springer, Heidelberg (2002)