Rewrite-Based Decision Procedures

Electronic Notes in Theoretical Computer Science

Volumn 174, Issue 11 SPEC. ISS., 2007, Pages 27-45

  Bonacina, Maria Paola ^a   Echenim, Mnacho ^a  

^a UNIVERSITY OF VERONA   (Italy)

Author keywords

Rewrite based inference systems; T decision procedures

Indexed keywords

DATA STRUCTURES; FORMAL LOGIC; THEOREM PROVING;

REWRITE-BASED INFERENCE SYSTEMS; T-DECISION PROCEDURES;

DECISION THEORY;

EID: 34250782797     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.11.042     Document Type: Article

References (15)

1. Armando A., Bonacina M.P., Ranise S., and Schulz S. On a rewriting approach to satisfiability procedures: Extension, combination of theories and an experimental appraisal. In: Gramlich B. (Ed). Proc. 5th FroCoS. LNAI volume 3717 (2005), Springer 65-80. http://profs.sci.univr.it/~bonacina/rewsat.html The full version is available at
2. Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, and Marco Maratea. A SAT-based decision procedure for the boolean combination of difference constraints. In Online Proc. SAT-7, 2004
3. Armando A., Ranise S., and Rusinowitch M. A Rewriting Approach to Satisfiability Procedures. Info. and Comp. 183 2 (June 2003) 140-164
4. Barrett C.W., and Berezin S. CVC lite: A new implementation of the Cooperating Validity Checker. In: Alur R., and Peled D. (Eds). Proc. CAV-16. LNCS volume 3114 (2004), Springer 515-518
5. Bozzano M., Bruttomesso R., Cimatti A., Junttila T., van Rossum P., Schulz S., and Sebastiani R. MathSAT: Tight integration of SAT and mathematical decision procedures. J. of Autom. Reason. 35 1-3 (Oct. 2005) 265-293
6. Barrett C.W., Dill D.L., and Stump A. A framework for cooperating decision procedures. In: McAllester D.A. (Ed). Proc. CADE-17. LNAI volume 1831 (2000), Springer 79-98
7. Barrett C.W., Dill D.L., and Stump A. Checking satisfiability of first-order formulas by incremental translation to SAT. In: Larsen K.G., and Brinksma E. (Eds). Proc. CAV-14. LNCS volume 2404 (2002), Springer 236-249
8. Bonacina M.P., and Echenim M. Generic theorem proving for decision procedures. Technical Report RR 41/2006, Università degli studi di Verona. Full version available at (2006). http://profs.sci.univr.it/~echenim/
9. Maria Paola Bonacina and Mnacho Echenim. Rewrite-based satisfiability procedures for recursive data structures. In Byron Cook and Roberto Sebastiani, editors, Proceedings of the Fourth Workshop on Pragmatics of Decision Procedures in Automated Reasoning (PDPAR), Third International Joint Conference on Automated Reasoning (IJCAR) and Fourth Federated Logic Conference (FLoC), Electronic Notes in Theoretical Computer Science. Elsevier, August 2006. To appear
10. de Moura L., Rueß H., and Sorea M. Lazy theorem proving for bounded model checking over infinite domains. In: Voronkov A. (Ed). Proc. CADE-18. LNAI volume 2392 (2002), Springer 438-455
11. Dershowitz N., and Plaisted D.A. Rewriting. In: Robinson J.A., and Voronkov A. (Eds). Handbook of Automated Reasoning, volume I (2001), Elsevier Science Publishers 535-610
12. Ganzinger H., Hagen G., Nieuwenhuis R., Oliveras A., and Tinelli C. DPLL(T): Fast decision procedures. In: Alur R., and Peled D.A. (Eds). Proc. CAV-16. LNCS volume 3114 (2004), Springer 175-188
13. Nieuwenhuis R., and Rubio A. Paramodulation-based theorem proving. In: Robinson J.A., and Voronkov A. (Eds). Handbook of Automated Reasoning (2001), Elsevier and MIT Press 371-443
14. Riazanov A., and Voronkov A. Splitting without backtracking. In: Nebel B. (Ed). Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. IJCAI 2001, Seattle, Washington, USA, August 4-10, 2001 (2001), Morgan Kaufmann 611-617
15. Stump A., Barrett C.W., and Dill D.L. CVC: A Cooperating Validity Checker. In: Alur R., and Peled D. (Eds). Proc. CAV-16. LNCS volume 3114 (2004), Springer 500-504