On variable-inactivity and polynomial T-satisfiability procedures

Journal of Logic and Computation

Volumn 18, Issue 1, 2008, Pages 77-96

  Bonacina, Maria Paola ^a   Echenim, Mnacho ^a  

^a UNIVERSITY OF VERONA   (Italy)

Author keywords

Decision procedures; Rewrite based theorem proving; Satisfiability modulo theories; Theories of data structures; Theory reasoning

Indexed keywords

DATA STRUCTURES; DECISION THEORY; PROBLEM SOLVING; THEOREM PROVING;

DECISION PROCEDURES; REWRITE-BASED THEOREM-PROVING; SATISFIABILITY MODULO THEORIES; THEORIES OF DATA STRUCTURES; THEORY REASONING;

POLYNOMIAL APPROXIMATION;

EID: 38749083817     PISSN: 0955792X     EISSN: 1465363X     Source Type: Journal    
DOI: 10.1093/logcom/exm055     Document Type: Article

References (32)

1. A. Armando, M. P. Bonacina, S. Ranise, and S. Schulz. New results on rewrite-based satisfiability procedures. ACM TOCL, in press.
2. A. Armando, C. Castellini, E. Giunchiglia, and M. Maratea. A SAT-based decision procedure for the boolean combination of difference constraints. In Online Proceedings of SAT-7, 2004. http://www.satisfiability.org/SAT04.
3. A. Armando, S. Ranise, and M. Rusinowitch. A rewriting approach to satisfiability procedures. Information and Computation, 183, 140-164, 2003.
4. C. W. Barrett and S. Berezin. CVC Lite: a new implementation of the Cooperating Validity Checker. In Proceedings of CAV-16, R. Alur and D. A. Peled, eds, Vol. 3114 of LNCS, pp. 515-518. Springer, Berlin, Germany, 2004.
5. C. W. Barrett, D. L. Dill, and A. Stump. Checking satisfiability of first-order formulas by incremental translation to SAT. In Proceedings of CAV-14, K. G. Larsen and E. Brinksma, eds, Vol. 2404 of LNCS, pp. 236-249. Springer, Berlin, Germany, 2002.
6. M. P. Bonacina and N. Dershowitz. Abstract canonical inference. ACM Transactions on Computational Logic, 8, 180-208, 2007.
7. M. P. Bonacina and M. Echenim. Rewrite-based decision procedures. In Proceedings of 6th STRATEGIES Work-shop, 4th FLoC, August 2006, M. Archer, T. B. de la Tour, and C. Munoz, eds, Vol. 174(11) of ENTCS, pp. 27-45, Elsevier, Amsterdam, The Netherlands, 2007.
8. M. P. Bonacina and M. Echenim. Rewrite-based satisfiability procedures for recursive data structures. In Proceedings of 4th PDPAR Workshop, 4th FLoC, August 2006, B. Cook and R. Sebastiani, eds, Vol. 174(8) of ENTCS, pp. 55-70. Elsevier, Amsterdam, The Netherlands, 2007.
9. M. P. Bonacina, M. Echenin. T-decision by decomposition. In Proceedings of CADE-21, F. Pfenning, ed., Vol. 4603 of LNAI, pp. 199-214. Springer, Berlin, Germany, 2007.
10. M. P. Bonacina, S. Ghilardi, E. Nicolini, S. Ranise, and D. Zucchelli. Decidability and undecidability results for Nelson-Oppen and rewrite-based decision procedures. In Proceedings of 3rd IJCAR, U. Furbach and N. Shankar, eds, Vol. 4130 of LNAI, pp. 513-527. Springer, Berlin, Germany, 2006.
11. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. van Rossum, S. Schulz, and R. Sebastiani. MathSAT: Tight integration of SAT and mathematical decision procedures. Journal of Automated Reasoning, 35, 265-293, Springer, Berlin, Germany, 2005.
12. R. Caferra, A. Leitsch, and N. Peltier. Automated Model Building. Kluwer Academic Publishers, Dordrecht, The Netherlands, 2004.
13. L. de Moura, H. Rueß, and M. Sorea. Lazy theorem proving for bounded model checking over infinite domains. In Proceedings of CADE-18, A. Voronkov, ed., Vol. 2392 of LNAI, pp. 438-455. Springer, Berlin, Germany, 2002.
14. D. Déharbe and S. Ranise. Light-weight theorem proving for debugging and verifying units of code. In Proceedings of SEFM03, IEEE Computer Society Press, Washington DC, U.S.A, 2003.
15. N. Dershowitz and D. A. Plaisted. Rewriting. In Handbook of Automated Reasoning, J.A. Robinson and A. Voronkov, eds, Vol. B, pp. 535-610. Elsevier, Amsterdam, The Netherlands, 2001.
16. D. L. Detlefs, G. Nelson, and J. B. Saxe. Simplify: a theorem prover for program checking. Journal of ACM, 52, 365-473, 2005.
17. B. Dutertre and L. de Moura. A fast linear-arithmetic solver for DPLL(T). In Proceedings of CAV-18, T. Ball and R. B. Jones, eds, Vol. 4144 of LNCS, pp. 81-94. Springer, Berlin, Germany, 2006.
18. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In Proceedings of CA V-16, R. Alur and D. A. Peled, eds, Vol. 3114 of LNCS, pp. 175-188. Springer, Berlin, Germany, 2004.
19. H. Ganzinger and D. A. McAllester. A new meta-complexity theorem for bottom-up logic programs. In Proceedings of 1st IJCAR, R. Gore, A. Leitsch, and T. Nipkow, eds, Vol. 2083 of LNCS, pp. 514-528. Springer, Berlin, Germany, 2001.
20. S. Ghilardi, E. Nicolini, and D. Zucchelli. A comprehensive framework for combined decision procedures. In Proceedings of 5th FroCoS, B. Gramlich, ed., Vol. 3717 of LNAI, pp. 1-30. Springer, Berlin, Germany, 2005.
21. M. Kaufmann, P. Manolios, and J. S. Moore, eds. Computer Aided Reasoning: ACL2 Case Studies. Kluwer, Academic Publishers, Dordrecht, The Netherlands, 2000.
22. H. Kirchner, S. Ranise, C. Ringeissen, and D.-K. Tran. Automatic combinability of rewriting-based satisfiability procedures. In Proceedings of LPAR-13, M. Hermann and A. Voronkov, eds, Volume 4246 of LNCS, pp. 542-556. Springer, Berlin, Germany, 2006.
23. S. K. Lahiri and M. Musuvathi. An efficient decision procedure for UTVPI constraints. In Proceedings of 5th FroCoS, B. Gramlich, ed., Volume 3717 of LNAI, pp. 168-183. Springer, Berlin, Germany, 2005.
24. C. Lynch and B. Morawska. Automatic decidability. In Proceedings of LICS-17, pp. 7-16. IEEE Computer Society Press, Washington D.C., U.S.A., 2002.
25. C. Lynch and D.-K. Tran. Automatic decidability and combinability revisited. In Proceedings of CADE-21, F. Pfenning, ed., Volume 4603 of LNAI, pp. 328-344, Springer, Berlin, Germany, 2007.
26. G. Necula and P. Lee. Efficient representation and validation of proofs. In Proceedings of LICS-13, V. Pratt, ed., pp. 93-104. IEEE Computer Society Press, Washington D.C., U.S.A., 1998.
27. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM TOPLAS, 1, 245-257, 1979.
28. R. Nieuwenhuis and A. Oliveras. Fast congruence closure and extensions. Information and Computation, 205, 557-580, 2007.
29. R. Nieuwenhuis and A. Rubio. Paramodulation-based theorem proving. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, eds, Vol. B, pp. 371-443. Elsevier, Amsterdam, The Netherlands, 2001.
30. D. C. Oppen. Reasoning about recursively defined data structures. Journal of ACM, 27, 403-411, 1980.
31. S. Owre, J. Rushby, N. Shankar, and D. Stringer-Calvert. PVS: an experience report. In Applied Formal Methods - FM-Trends 98, D. Hutter, W. Stephan, P. Traverso, and M. Ullman, eds, Vol. 1641 of LNCS, pp. 338-345. Springer, Berlin, Germany, 1998.
32. S. Schulz. E - a brainiac theorem prover. Journal of AI Communications, 15, 111-126, 2002.