Decidability and undecidability results for Nelson-Oppen and rewrite-based decision procedures

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

Volumn 4130 LNAI, Issue , 2006, Pages 513-527

  Bonacina, Maria Paola ^a   Ghilardi, Silvio ^b   Nicolini, Enrica ^b   Ranise, Silvio ^b,c   Zucchelli, Daniele ^b,c  

^a UNIVERSITY OF VERONA   (Italy)

^b UNIVERSITY OF MILAN   (Italy)

^c INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; CONSTRAINT THEORY; DECISION MAKING; MATHEMATICAL MODELS;

DECISION PROCEDURES; DISJOINT SIGNATURES; INFINITE MODELS; NELSON OPPEN DECIDABILITY TRANSFER;

COMPUTATION THEORY;

EID: 33749544980     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814771_42     Document Type: Conference Paper

References (24)

1. A. Armando, M. P. Bonacina, S. Ranise, and S. Schulz. On a rewriting approach to satisfiability procedures: extension, combination of theories and an experimental appraisal. In Proc. of FroCoS'05, volume 3717 of LNCS, pages 65-80. Springer, 2005. Full version available as DI RR 36/2005, Università degli Studi di Verona, http://www.sci.univr.it/~bonacina/ verify.html.
2. A. Armando, S. Ranise, and M. Rusinowitch. A rewriting approach to satisfiability procedures. Information and Computation, 183(2): 140-164, 2003.
3. G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, and R. Sebastiani. A SAT based approach for solving formulas over boolean and linear mathematical propositions. In Proc. of CADE-18, volume 2392 of LNCS, pages 195-210. Springer, 2002.
4. F. Baader and T. Nipkow. Term, Rewriting and All That. Cambridge University Press, United Kingdom, 1998.
5. F. Baader and C. Tinelli. Deciding the word problem in the union of equational theories. Information and Computation, 178(2):346-390, 2002.
6. M. P. Bonacina and N. Dershowitz. Abstract canonical inference. ACM Transactions on Computational Logic, (to appear), 2006.
7. M. P. Bonacina and J. Hsiang. Towards a foundation of completion procedures as semidecision procedures. Theoretical Computer Science, 146:199-242, July 1995.
8. H. Comon, P. Narendran, R. Nieuwenhuis, and M. Rusinowitch. Decision problems in ordered rewriting. In Proc. of LICS'98, pages 276-286. IEEE Computer Society Press, 1998.
9. D. Déharbe and S. Ranise. Light-weight theorem proving for debugging and verifying units of code. In Proc. of SEFM'03. IEEE Computer Society Press, 2003.
10. J.-C. Filliâtre, S. Owre, H. Rueß, and N. Shankar. ICS: Integrated canonizer and solver. In Proc. of CAV'01, LNCS, pages 246-249. Springer, 2001.
11. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In Proc. of CAV'04, volume 3114 of LNCS, pages 175-188. Springer, 2004.
12. S. Ghilardi. Model theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning, 33(3-3):221-249, 2005.
13. A. Middeldorp and H. Zantema. Simple termination revisited. In Proc. of CADE'94, LNCS, pages 451-465. Springer, 1994.
14. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Trans. on Programming Languages and Systems, 1(2):245-257, 1979.
15. R. Nieuwenhuis and A. Rubio. Paramodulation-based theorem proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier and MIT Press, 2001.
16. P. Odifreddi. Classical recursion theory, volume 125 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1989.
17. D. C. Oppen. Complexity, convexity and combinations of theories. Theoretical Computer Science, 12:291-302, 1980.
18. D. Pigozzi. The join of equational theories. Colloquium Mathematicum, 30(1):15-25, 1974.
19. S. Ranise, C. Ringeissen, and D.-K. Tran. Nelson-Oppen, Shostak and the extended canonizer: A family picture with a newborn. In Proc. of ICTAC 2004, LNCS. Springer, 2004.
20. S. Schulz. E - a brainiac theorem prover. AI Communications, 15(2/3): 11-126, 2002.
21. C. Tinelli and M. T. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In Proc. of FroCoS'96, pages 103-120. Kluwer Academic Publishers, 1996.
22. C. Tinelli and C. G. Zarba. Combining non-stably infinite theories. Journal of Automated Reasoning, 2006. (to appear).
23. D. van Dalen. Logic and Structure. Springer-Verlag, 1989. Second edition.
24. C. Weidenbach. Combining superposition, sorts and splitting. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier and MIT Press, 2001.