zbMATH — the first resource for mathematics

Prototyping combination of unification algorithms with the \(\mathsf{ELAN}\) rule-based programming language. (English) Zbl 1379.68204
Comon, Hubert (ed.), Rewriting techniques and applications. 8th international conference, RTA ’97, Sitges, Spain, June 2–5, 1997. Proceedings. Berlin: Springer (ISBN 978-3-540-62950-4/pbk; 978-3-540-69051-1/ebook). Lecture Notes in Computer Science 1232, 323-326 (1997).
Summary: The implementation of the general non-deterministic method provides now a convenient and useful \(\mathsf{ELAN}\) platform to tackle some non-disjoint cases [H. Kirchner and C. Ringeissen, J. Symb. Comput. 18, No. 2, 113–155 (1994; Zbl 0819.68111)] (only one additional non-deterministic step) or to realize other combination algorithms based on the same techniques but in different contexts: satisfiability, the word-problem, matching [C. Ringeissen, Inf. Comput. 126, No. 2, 144–160 (1996; Zbl 0853.68105)], free amalgamation [F. Baader and K. U. Schulz, “On the combination of symbolic constraints, solution domains, and constraint solvers”, Lect. Notes Comput. Sci. 976, 380–397 (1995; doi:10.1007/3-540-60299-2_23)],…Most of them can be viewed as a way to decrease the non-determinism inherent in the general method.
For the entire collection see [Zbl 1360.68009].

68Q42 Grammars and rewriting systems
Full Text: DOI