✦ LIBER ✦

Fast matching in combinations of regular equational theories

✍ Scribed by S. Eker

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 964 KB
Volume: 4
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00035-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Complexity of Counting Problems in E

The Complexity of Counting Problems in Equational Matching

✍ Miki Hermann; Phokion G. Kolaitis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 805 KB

Complements in lattices of varieties and

Complements in lattices of varieties and equational theories

✍ V. Diercks; M. Erné; J. Reinhold 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 506 KB

Complete sets of unifiers and matchers i

Complete sets of unifiers and matchers in equational theories

✍ François Fages; Gérard Huet 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 735 KB

Non-covering in the interpretability lat

Non-covering in the interpretability lattice of equational theories

✍ Ralph McKenzie; Stanislaw Świerczkowski 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 664 KB

Problems in the regularity theory of fun

Problems in the regularity theory of functional equations

✍ Zs. Páles 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 257 KB

Unification in the Union of Disjoint Equ

Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures

✍ FRANZ BAADER; KLAUS U. SCHULZ 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 756 KB

Most of the work on the combination of unification algorithms for the union of disjoint equational theories has been restricted to algorithms that compute finite complete sets of unifiers. Thus the developed combination methods usually cannot be used to combine decision procedures, i.e., algorithms