Unions of non-disjoint theories and combinations of satisfiability procedures

Theoretical Computer Science

Volumn 290, Issue 1, 2003, Pages 291-353

  Tinelli, Cesare ^a   Ringeissen, Christophe ^b  

^a University of Iowa   (United States)

^b LORIA   (France)

Author keywords

Automated deduction; Combination of satisfiability procedures; Constraint based reasoning; Decision problems

Indexed keywords

AUTOMATA THEORY; BOOLEAN ALGEBRA; COMPUTER SIMULATION; PROBLEM SOLVING; THEOREM PROVING;

CONSTRAINT-BASED REASONING; DECISION PROBLEMS;

CONSTRAINT THEORY;

EID: 0037209794     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00332-2     Document Type: Article

References (51)

1. A. Armando, S. Ranise, Constraint contextual rewriting, in: R. Caferra, G. Salzer (Eds.), Proc. 2nd Internat. Workshop on First Order Theorem Proving, FTP'98, Vienna, Austria, 1998, pp. 65-75.
2. Baader F., Nipkow T. Term Rewriting and All That. 1998;Cambridge University Press, UK.
3. F. Baader, K.U. Schulz, Combination of constraint solving techniques: an algebraic point of view, Proc. 6th Internat. Conf. on Rewriting Techniques and Applications, RTA'95, Lecture Notes in Computer Science, Vol. 914, Springer, Berlin, 1995a, pp. 50-65.
4. Baader F., Schulz K.U. Combination techniques and decision problems for disunification. Theoret. Comput. Sci. 142:1995b;229-255.
5. F. Baader, K.U. Schulz, On the combination of symbolic constraints, solution domains, and constraint solvers, in: Proc. First Internat. Conf. on Principles and Practice of Constraint Programming, Cassis, France, Lecture Notes in Artificial Intelligence, Vol. 976, Springer, Berlin, 1995c.
6. Baader F., Schulz K.U. Unification in the union of disjoint equational theories. combining decision procedures J. Symbolic Comput. 21(2):1996;211-243.
7. Baader F., Schulz K.U. Combination of constraint solvers for free and quasi-free structures. Theoret. Comput. Sci. 192:1998;107-161.
8. Baader F., Tinelli C. A new approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method. McCune W. Proc. 14th Internat. Conf. on Automated Deduction, Townsville, Australia. Lecture Notes in Artificial Intelligence. Vol. 1249:1997;19-33 Springer, Berlin.
9. F. Baader, C. Tinelli, Deciding the word problem in the union of equational theories, Tech. Report UIUCDCS-R-98-2073, Department of Computer Science, University of Illinois at Urbana-Champaign, October 1998.
10. Baader F., Tinelli C. Deciding the word problem in the union of equational theories sharing constructors. Narendran P., Rusinowitch M. Proc. 10th Internat. Conf. on Rewriting Techniques and Applications, Trento, Italy. Lecture Notes in Computer Science. Vol. 1631:1999;175-189 Springer, Berlin.
11. F. Baader, C. Tinelli, Deciding the word problem in the union of equational theories, Inform. and Comput. (2001), to appear.
12. P. Baumgartner, U. Furbach, U. Petermann, A unified approach to theory reasoning, Research Report 15-92, Universität Koblenz-Landau, Koblenz, Germany, fachberichte Informatik, 1992.
13. Boudet A. Combining unification algorithms. J. Symbolic Comput. 16(6):1993;597-626.
14. Bürckert H.-J. A resolution principle for constraint logics. Artif. Intell. 66:1994;235-271.
15. Dershowitz N., Jouannaud J.-P. Rewriting systems. van Leeuwen J. Handbook of Theoretical Computer Science. 1990;243-320 Elsevier Publishers, Amsterdam.
16. Domenjoud E., Klay F., Ringeissen C. Combination techniques for non-disjoint equational theories. Bundy A. Proc. 12th Internat. Conf. on Automated Deduction, Nancy, France. Lecture Notes in Artificial Intelligence. Vol. 814:1994;267-281 Springer, Berlin.
17. H. Ehrig, B. Mahr, Fundamentals of Algebraic Specification 1: Equations and Initial Semantics, EATCS Monographs on Theoretical Computer Science, Vol. 6, Springer, Berlin, 1985, New York, NY.
18. H. Ehrig, B. Mahr, Fundamentals of Algebraic Specification 2: Module Specifications and Constraints, EATCS Monographs on Theoretical Computer Science, Vol. 21, Springer, Berlin, 1990, New York, NY.
19. C. Fiorentini, S. Ghilardi, Combining word problems through rewriting in categories with products, Theoret. Comput. Sci. (2001), to appear.
20. Goguen J.A., Meseguer J. Order sorted algebra I. Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoret. Comput. Sci. 105(2):1992;217-273.
21. Gramlich B. On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems. Theoret. Comput. Sci. 165(1):1996;97-131.
22. Herold J. Combination of unification algorithms. Siekmann J. Proc. 8th Internat. Conf. on Automated Deduction, Oxford (UK). Lecture Notes in Artificial Intelligence. Vol. 230:1986;450-469 Springer, Berlin.
23. Hodges W. Model Theory. Enclyclopedia of Mathematics and its Applications. Vol. 42:1993;Cambridge University Press, Cambridge.
24. M. Höhfeld, G. Smolka, Definite relations over constraint languages, LILOG Report 53, IWBS, IBM Deutschland, Postfach 80 08 80, 7000 Stuttgart 80, Germany, 1988.
25. Holland K.L. An introduction to fusions of strongly minimal sets: the geometry of fusions. Arch. Math. Logic. 34:1995;395-413.
26. Jaffar J., Maher M. Constraint logic programming: a survey. J. Logic Programming. 19/20:1994;503-581.
27. J.-P. Jouannaud, H. Kirchner, Completion of a set of rules modulo a set of equations, SIAM J. Comput. 15(4) (1986) 1155-1194, preliminary version in Proc. 11th ACM Symp. on Principles of Programming Languages, Salt Lake City, USA, 1984.
28. Kepser S., Schulz K.U. Combination of constraint systems II: Rational amalgamation. Freuder E.C. Proc. 2nd Internat. Conf. on Principles and Practice of Constraint Programming, Cambridge, MA, USA. Lecture Notes in Computer Science. Vol. 1118:1996;282-296 Springer, Berlin.
29. Kirchner C., Kirchner H., Rusinowitch M. Deduction with symbolic constraints (special issue on Automatic Deduction). Rev. Française Intell. Artif. 4(3):1990;9-52.
30. Kirchner H., Ringeissen C. Combining symbolic constraint solvers on algebraic domains. J. Symbolic Comput. 18(2):1994a;113-155.
31. Kirchner H., Ringeissen C. Constraint solving by narrowing in combined algebraic domains. Van Hentenryck P. Proc. 11th Internat. Conf. on Logic Programming. 1994b;617-631 The MIT Press, Cambridge, MA.
32. G. Nelson, Combining satisfiability procedures by equality-sharing,in: W.W. Bledsoe, D.W. Loveland (Eds.), Automated Theorem Proving: After 25 Years,Contemporary Mathematics. American Mathematical Society, Vol. 29, Providence, RI, 1984, pp. 201-211.
33. Nelson G., Oppen D.C. Simplification by cooperating decision procedures. ACM Trans. Programming Languages Systems. 1(2):1979;245-257.
34. Nipkow T. Combining matching algorithms. the regular case J. Symbolic Comput. 12:1991;633-653.
35. Ohlebusch E. Modular properties of composable term rewriting systems. J. Symbolic Comput. 20(1):1995;1-41.
36. Oppen D.C. Complexity, convexity and combinations of theories. Theoret. Comput. Sci. 12:1980;291-302.
37. 0-categoricity The J. Symbolic Logic. 62(4):1997;1070-1074.
38. Ringeissen C. Unification in a combination of equational theories with shared constants and its application to primal algebras. Voronkov A. Proc. 1st Internat. Conf. on Logic Programming and Automated Reasoning. Lecture Notes in Artificial Intelligence. Vol. 624:1992;261-272 Springer, Berlin.
39. C. Ringeissen, Combinaison de résolutions de contraines, Thèse de Doctorat d' Université, Université de Nancy 1, Nancy, France, 1993.
40. Ringeissen C. Combining decision algorithms for matching in the union of disjoint equational theories. Inform. and Comput. 126(2):1996a;144-160.
41. Ringeissen C. Cooperation of decision procedures for the satisfiability problem. Baader F., Schulz K. Frontiers of Combining Systems: Proc. 1st Internat. Workshop, Munich, Germany, Applied Logic. 1996b;121-140 Kluwer Academic Publishers, Dordrecht.
42. M. Schmidt-Schauß, Unification in a combination of arbitrary disjoint equational theories, J. Symbolic Comput. 8 (1-2) (1989) 51-100, special issue on unification. Part II.
43. Schulz K.U. Why combined decision problems are often intractable. Kirchner H., Ringeissen C. Proc. 3rd Internat. Workshop on Frontiers of Combining Systems, FroCoS'2000, Nancy, France. Lecture Notes in Artificial Intelligence. Vol. 1794:2000;217-244 Springer, Berlin.
44. Shostak R.E. A practical decision procedure for arithmetic with function symbols. J. ACM. 26(2):1979;351-360.
45. Shostak R.E. Deciding combinations of theories. J. ACM. 31:1984;1-12.
46. C. Tinelli, Combination of decidability procedures for automated deduction and constraint-based reasoning, Ph.D. Dissertation, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana-Champaign, Illinois, 1999.
47. Tinelli C., Harandi M.T. A new correctness proof of the Nelson-Oppen combination procedure. Baader F., Schulz K. Frontiers of Combining Systems: Proc. 1st Internat. Workshop, Munich, Germany, Applied Logic. 1996;103-120 Kluwer Academic Publishers, Dordrecht.
48. C. Tinelli, C. Ringeissen, Non-disjoint unions of theories and combinations of satisfiability procedures: first results, Tech. Report UIUCDCS-R-98-2044, Department of Computer Science, University of Illinois at Urbana-Champaign, 1998 (also available as INRIA research report no. RR-3402).
49. C. Tinelli, C. Ringeissen, Unions of non-disjoint theories and combinations of satisfiability procedures, Tech. Report 01-02, Department of Computer Science, University of Iowa, 2001 (extended version of this paper).
50. Wechler W. Universal Algebra for Computer Scientists. EATCS Monographs on Theoretical Computer Science. Vol. 25:1992;Springer, Berlin, Heidelberg, New York.
51. Wolter F. Fusions of modal logics revisited. Kracht M., de Rijke M., Wansing H., Zakharyaschev M. Advances in Modal Logic, CSLI. 1998;Stanford, CA.