Combination of constraint systems II: Rational amalgamation

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

Volumn 1118, Issue , 1996, Pages 282-296

  Kepser, Stephan ^a   Schulz, Klaus U ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21444456769     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61551-2_81     Document Type: Conference Paper

References (16)

1. P. Aczel, "Non-well-founded Sets," CSLI Lecture Notes 14, Stanford Univ., 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, "On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers," in: Proceedings CP'95, U. Montanari, F.Rossi (Eds.), Springer LNCS 976. pp. 380-397.
4. F. Baader, J. Siekmann, "Unification Theory," in D.M. Gabbay, C. Hogger, and J. Robinson, Editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, Oxford, UK, 1994, pp. 41-125.
5. R. Backofen and R. Treinen, "How to Win a Game with Features," in Constraints in Computational Logics, Proc. CCL'94-. J.-P. Jouannaud (Ed.), Springer LNCS 845, 1994, pp. 320-335.
6. A. Colmerauer, "Equations and inequations on finite and infinite trees," in: Proc. 2nd Int. Conf. on Fifth Generation Computer Systems, 1984, pp.85-99.
7. A. Colmerauer, "An introduction to PROLOG III," C. ACM 33, 1990, pp. 69-90.
8. B. Courcelle, "Fundamental Properties of Infinite Trees," Theoretical Computer Science 25, 1983, pp. 95-169.
9. D.M. Gabbay, "An Overview of Fibred Semantics and the Combination of Logics," to appear in Proceedings of the First International Workshop "Frontiers of Combining Systems" FroCoS'96, F. Baader and K.U. Schulz, Eds., Kluwer Academic Publishers, 1996.
10. S. Kepser and K.U. Schulz, "Combination of Constraint Systems II: Rational Amalgamation," long version of this paper, available via anonymous ftp from ftp.cis.uni-inuenchen.de (directory "schulz", file name "RationalAmalgamation.ps.Z").
11. 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.
12. A.I. Mal'cev, "The Metamathematics of Algebraic Systems," volume 66 of Studies in Logic and the Foundation of Mathematics, North Holland, Amsterdam, London, 1971.
13. J. Pfalzgraf, "Logical Fiberings and Polycontextural Systems," In Fundamentals of Artificial Intelligence Research, Ph. Jorrand and J. Kelemen, Eds., Springer LNCS 535 (1991).
14. J. Pfalzgraf and K. Stokkerman, "On Robotics Scenarios and Modeling with Fibered Structures," In Springer series Texts and Monographs in Symbolic Computation, Automated Practical Reasoning: Algebraic Approaches, J. Pfalzgraf and D. Wang, Eds., Springer Verlag, 1994.
15. W.C. Rounds, "Set values for unification based grammar formalisms and logic programming," Research Report CSLI-88-129, Stanford, 1988.
16. G. Smolka, R. Treinen, "Records for Logic Programming," J. of Logic Programming 18(3) (1994), pp. 229-258.