Combination of constraint solvers for free and quasi-free structures

Theoretical Computer Science

Volumn 192, Issue 1, 1998, Pages 107-161

  Baader, Franz ^a   Schulz, Klaus U ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

Combination; Constraint solving; Unification; Universal algebra

Indexed keywords

EID: 0001425670     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00147-3     Document Type: Article

References (45)

1. P. Aczel, Non-well-founded sets, CSLI Lecture Notes 14, Stanford University, 1988.
2. H. Ait-Kaci, A. Podelski, G. Smolka, A feature-based constraint system for logic programming with entailment, Theoret. Comput. Sci. 122 (1994) 263-283.
3. F. Baader, K.U. Schulz, Unification in the union of disjoint equational theories: combining decision procedures, J. Symbol. Comput. 21 (1996) 211-243. A short version of this article has appeared in Proc. CADE'92, LNAI, vol. 607, Springer, Berlin, 1992.
4. F. Baader, K.U. Schulz, Unification in the union of disjoint equational theories: combining decision procedures, J. Symbol. Comput. 21 (1996) 211-243. A short version of this article has appeared in Proc. CADE'92, LNAI, vol. 607, Springer, Berlin, 1992.
5. F. Baader, K.U. Schulz, Combination techniques and decision problems for disunification, in: Proc. RTA-93, Lecture Notes in Computer Science, vol. 690, Springer, Berlin, 1993, pp. 301-315.
6. F. Baader, K.U. Schulz, Combination of constraint solving techniques: an algebraic point of view, Research Report CIS-Rep-94-75, University Munich, 1994; a short version has appeared in Proc. RTA- 95, Lecture Notes in Computer Science, vol. 914, Springer, Berlin, 1995, pp. 352-366.
7. F. Baader, K.U. Schulz, Combination of constraint solving techniques: an algebraic point of view, Research Report CIS-Rep-94-75, University Munich, 1994; a short version has appeared in Proc. RTA-95, Lecture Notes in Computer Science, vol. 914, Springer, Berlin, 1995, pp. 352-366.
8. F. Baader, K.U. Schulz, On the combination of symbolic constraints, solution domains, and constraint solvers, in: U. Montanari, F. Rossi (Eds.), Proc. CP'95, Lecture Notes in Computer Science, vol. 976, Springer, Berlin, 1995, pp. 380-397.
9. F. Baader, K.U. Schulz, On the combination of symbolic constraints, solution domains, and constraint solvers, extended version of [6], Research Report CIS-Rep-95-120, University Munich, 1995.
10. R. Backofen, R. Treinen, How to win a game with features, in: Constraints in Computational Logics, Proc. CCL-94, Lecture Notes in Computer Science, vol. 845, Springer, Berlin, 1994, pp. 320-335.
11. K. Ben Khalifa, Äquivalenzbeweis zweier Definitionen zur Kombination freier Strukturen, Diplomarbeit (Master Thesis), Dept. of Computer Science, RWTH Aachen, Germany, 1996.
12. A. Boudet, Combining unification algorithms, J. Symbolic Comput. 16 (1993) 597-626.
13. H.-J. Bürckert, A resolution principle for a logic with restricted quantifiers, Lecture Notes in Computer Science, vol. 568, Springer, Berlin, 1991.
14. G. Cherlin, Model theoretic algebra: selected topics, Lecture Notes in Mathematics, vol. 521, Springer, Berlin, 1976.
15. P.M. Cohn, Universal Algebra, Harper & Row, New York, 1965.
16. A. Colmerauer, Equations and inequations on finite and infinite trees, in: Proc. 2nd Internat. Conf. on Fifth Generation Computer Systems, 1984, pp. 85-99.
17. A. Colmerauer, An introduction to PROLOG III, Comm. ACM 33 (1990) 69-90.
18. H. Comon, P. Lescanne, Equational problems and disunification, J. Symbolic Comput. 7 (1989) 371-425.
19. H. Comon, R. Treinen, Ordering constraints on trees, in: Colloquium on Trees in Algebra and Programming (CAAP), Lecture Notes in Computer Science, vol. 787, Springer, Berlin, 1994, pp. 1-14.
20. N. Dershowitz, Termination of rewriting, J. Symbolic Comput. 3 (1987) 69-116.
21. A. Dovier, E.G. Omodeo, E. Pontellio, G.F. Rossi, {log}: A logic programming language with finite sets, in: Logic Programming: Proc. 8th Internat. Conf., The MIT Press, Cambridge, MA, 1991.
22. A. Dovier, G. Rossi, Embedding extensional finite sets in CLP, in: Proc. Internat. Logic Programming Symp., 1993, pp. 540-556.
23. M. Droste, R. Göbel, Universal domains and the amalgamation property, Math. Struct. Comput. Sci. 3 (1993) 137-159.
24. F. Fages, Associative-commutative unification, in: Proc. 7th Internat. Conf. on Automated Deduction, Lecture Notes in Computer Science, vol. 170, Springer, Berlin, 1984, pp. 194-208.
25. J. Jaffar, J.-L. Lassez, Constraint logic programming, in: Proc. 14th ACM Symp. on Principles of Programming Languages, Munich, Germany, 1987, pp. 111-119.
26. S. Kepser, K.U. Schulz, Combination of constraint solvers II: rational amalgamation, in: E.C. Freuder (Ed.), Proc. CP-96, Lecture Notes in Computer Science, vol. 1118, Springer, Berlin, 1996, pp. 282-296.
27. C. Kirchner, H. Kirchner, Constrained equational reasoning, in: Proc. SIGSAM 1989 Internat Symp. on Symbolic and Algebraic Computation, ACM Press, New York, 1989.
28. H. Kirchner, Ch. Ringeissen, Combining symbolic constraint solvers on algebraic domains, J. Symbolic Comput. 18 (2) (1994) 113-155.
29. M.J. Maher, Complete axiomatizations of the algebras of finite, rational and infinite trees, in: Proc. 3rd Annual Symp. on Logic in Computer Science, LICS'88, Edinburgh, Scotland, IEEE Computer Soc. Press, Silver Spring, MD, 1988, pp. 348-357.
30. A.I. Mal'cev, The metamathematics of Algebraic Systems, Studies in Logic and the Foundation of Mathematics, vol. 66, North-Holland, Amsterdam, London, 1971.
31. A.I. Mal'cev, Algebraic Systems, Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen, vol. 192, Springer, Berlin, 1973.
32. K. Meinke, J.V. Tucker, Universal algebra, in: Handbook of Logic in Computer Science, vol. 1, Oxford University Press, Oxford, UK, 1992, pp. 189-411.
33. K. Mukai, Constraint logic programming and the unification of information, Doctoral Thesis, Dept. of Computer Science, Faculty of Engineering, Tokyo Institute of Technology, 1991.
34. G. Nelson, D.C. Oppen, Simplification by cooperating decision procedures, ACM TOPLAS 1 (2) (1979) 245-257.
35. D.C. Oppen, Complexity, convexity and combination of theories, Theoret. Comput. Sci. 12 (1980) 291-302.
36. Ch. Ringeissen, Unification in a combination of equational theories with shared constants and its application to primal algebras, in: Proc. LPAR'92, Lecture Notes in Computer Science, vol. 624, Springer, Berlin, 1992.
37. W.C. Rounds, Set values for unification based grammar formalisms and logic programming, Research Report CSLI-88-129, Stanford, 1988.
38. M. Schmidt-Schauß, Unification algebras: an axiomatic approach to unification, equation solving and constraint solving, SEKI-Report SR-88-23, University of Kaiserslautern, 1988.
39. M. Schmidt-Schauß, Unification in a combination of arbitrary disjoint equational theories, J. Symbolic Comput. 8 (1989) 51-99.
40. G. Smolka, R. Treinen, Records for logic programming, J. Logic Programming 18 (3) (1994) 229-258.
41. R.E. Shostak, A practical decision procedure for arithmetic with function symbols, J. ACM 26 (2) (1979) 351-360.
42. M.E. Stickel, A unification algorithm for associative commutative functions, J. ACM 28 (3) (1981) 423-434.
43. Y.M. Vazhenin, B.V. Rozenblat, Decidability of the positive theory of a free countably generated semigroup, Math. USSR Sbornik 44 (1983) 109-116.
44. N. Weaver, Generalized varieties, Algebra Universalis 30 (1993) 27-52.
45. J.G. Williams, Instantiation Theory: on the foundation of automated deduction, Lecture Notes in Computer Science, vol. 518, Springer, Berlin, 1991.