✦ LIBER ✦

Matching, unification and complexity

✍ Scribed by Kapur, Deepak; Narendran, Paliath

Book ID: 111859081
Publisher: Association for Computing Machinery
Year: 1987
Weight: 250 KB
Volume: 21
Category: Article
ISSN: 0163-5824
DOI: 10.1145/36330.36332

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of Nilpotent Unification and

Complexity of Nilpotent Unification and Matching Problems

✍ Qing Guo; Paliath Narendran; D.A. Wolfram 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 214 KB

Efficient parallel term matching and ant

Efficient parallel term matching and anti-unification

✍ Arthur L. Delcher; Simon Kasif 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 861 KB

On the time and tape complexity of weak

On the time and tape complexity of weak unification

✍ W. Erni; R. Lapsien 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 732 KB

An Algorithm for General Set Unification

An Algorithm for General Set Unification and Its Complexity

✍ Frieder Stolzenburg 📂 Article 📅 1999 🏛 Springer Netherlands 🌐 English ⚖ 139 KB

A Remark on Infinite Matching vs Infinit

A Remark on Infinite Matching vs Infinite Unification

✍ BENEDETTO INTRIGILA; MARISA VENTURINI ZILLI 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 381 KB

In this note we refine a result in Berarducci and Venturini Zilli (1993), by showing that the limit of iterations of a matching gives rise to the most general unifying substitution.

Complex rishon-type unification

✍ Aharon Davidson; Jacob Sonnenschein 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 305 KB