Prototyping combination of unification algorithms with the ELAN rule-based programming language

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

Volumn 1232, Issue , 1997, Pages 323-326

  Ringeissen, Christophe ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84947813261     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62950-5_81     Document Type: Conference Paper

References (7)

1. F. Baader and K. Schulz. On the combination of symbolic constraints, solution domains, and constraint solvers. In Proc. of GP'95, volume 976 of LNCS, pages 380-397, 1995.
2. F. Baader and K. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. Journal of Symbolic Computation, 21(2):211-243, February 1996.
3. Peter Borovanský, Claude Kirchner, Hélène Kirchner, Pierre-Etienne Moreau, and Marian Vittek. ELAN: A logical framework based on computational systems. In José Meseguer, editor, Proceedings of the first international workshop on rewriting logic, volume 4 of Electronic Notes in TCS, Asilomar (California), September 1996.
4. Claude Kirchner, Hélène Kirchner, and Marian Vittek. Designing constraint logic programming languages using computational systems. In P. Van Hentenryck and V. Saraswat, editors, Principles and Practice of Constraint Programming. The Newport Papers., chapter 8, pages 131-158. The MIT press, 1995.
5. H. Kirchner and C. Ringeissen. Combining symbolic constraint solvers on algebraic domains. Journal of Symbolic Computation, 18(2):113-155, 1994.
6. C. Ringeissen. Combining decision algorithms for matching in the union of disjoint equational theories. Information and Computation, 126(2):144-160, May 1996.
7. M. Schmidt-Schauß. Combination of unification algorithms. Journal of Symbolic Computation, 8(1 & 2):51-100, 1989. Special issue on unification. Part two.