On the combination of symbolic constraints, solution domains, and constraint solvers

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

Volumn 976, Issue , 1995, Pages 380-397

  Baader, Franz ^a   Schulz, Klans U ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; METALS; NETWORK SECURITY;

COMBINED SOLUTION; CONSTRAINT LOGIC PROGRAMMING; CONSTRAINT SOLVERS; CONSTRAINT SOLVING; EQUATIONAL THEORY; FEATURE STRUCTURE; MIXED CONSTRAINTS; SOLUTION STRUCTURES;

LOGIC PROGRAMMING;

EID: 84958042558     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60299-2_23     Document Type: Conference Paper

References (23)

1. P. Aczel, "Non-well-founded Sets," CSLI Lecture Notes 14, Stanford University, 1988.
2. H. Ait-Kaci, A. Podelski, and G. Smolka, "A feature-based constraint system for logic programming with entailment," Theoretical Comp. Science 122, 1994, pp.263-283.
3. F. Baader and K.U. Schulz, "Unification in the union of disjoint equational theories: Combining decision procedures," in: Proc. CADE-11, LNAI 607, 1992, pp.50-65.
4. F. Baader and K.U. Schulz, "Combination techniques and decision problems for disunificafion," in: Proc. RTA-93, LNCS 690, 1993.
5. F. Baader and K.U. Schulz, "Combination of Constraint Solving Techniques: An Algebraic Point of View," Research Report CIS-Rep-94-75, University Munich, 1994; short version in: Proc. RTA'95, Springer LNCS 914, 1995.
6. F. Baader and K.U. Schulz, "On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers," Research Report CIS-Rep-94-82, University Munich, 1994. Long version of this paper, available via anonymous ftp from ftp.cis.uni-muenchcn.de, directory"schulz".filename "SCstructures. ps.Z". A. Boudet, "Unification in a combination of equational theories: An efficient algorithm," in: Proc. CADE-10, LNCS 449, 1990, pp.292-307.
7. G. Cherlin, "Model Theoretic Algebra: Selected Topics," Springer Lecture Notes in Mathematics 521, 1976.
8. A. Colmerauer, "An introduction to PROLOG III," C. ACM 33, 1990, pp.69-90.
9. A. Dovier, E.G. Omodeo, E. Pontellio, G.F. Rossi, "{log}: A Logic Programming language with finite sets," in: Logic Programming: Proc. 8th International Conf., The MIT Press, 1991.
10. A. Dovier, G. Rossi, "Embedding extensional RaRe sets in CLP," in: Proc. International Logic Programming Symposium, 1993, pp. 540-556.
11. M. Droste, R. Göbel, "Universal domains and the amalgamation property," Math. Struct. in Comp. Science 3, pp. 137-159, 1993.
12. H. Kirchner and Ch. Ringeissen, "Combining symbolic constraint solvers on algebraic domains," J. Symbolic Computation, 18(2), 1994, pp. 113-155.
13. M.J. Maher, "Complete axiomatizations of the algebras of finite, rational and infinite trees," in: Proceedings of Third Annual Symposium on Logic in Computer Science, LICS'88, pp.348-357, Edinburgh, Scotland, 1988. IEEE Computer Society.
14. A.I. Mal'cev, "Algebraic Systems," Volume 192 of Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen, Springer-Verlag, Berlin, 1973.
15. K. Mukai, "Constraint Logic Programming and the Unification of Information," doctoral thesis, Dept. of Comp. Science, Faculty of Engineering, Tokyo Institute of Technology, 1991.
16. G. Nelson, D.C. Oppen, "Simplification by Cooperating Decision Procedures," ACM TOPLAS, Vol. 1, No. 2, October 1979, 245-257.
17. Ch. Ringeissen, "Unification in a combination of equational theories with shared constants and its application to primal algebras," in: Proc. LPAR'92, LNCS 624, 1992.
18. W.C. Rounds, "Set Values for Unification Based Grammar Formalisms and Logic Programming," Research Report CSLI-88-129, Stanford, 1988.
19. M. Schmidt-Schauß, "Unification Algebras: An Axiomatic Approach to Unification, Equation Solving and Constraint Solving," SEKI-Report, SR-88-23, University of Kalserslautern, 1988.
20. M. Sckmidt-Schauß, "Unification in a combination of arbitrary disjoint equational theories," J. Symbolic Computation 8, 1989, pp.51-99.
21. G. Smolka, R. Treinen, "Records for Logic Programming," J. of Logic Programming 18(3) (1994), pp. 229-258-556.
22. Y.M. Vazhenin and B.V. Rozenblat, "Decidability of the positive theory of a free countably generated semigroup," Math. USSR Sbornik 44 (1983), pp.109-116.
23. J.G. Williams, "Instantiation Theory: On the Foundation of Automated Deduction," Springer LNCS 518, 1991.