A practically efficient and almost linear unification algorithm

DOI10.1016/0004-3702(88)90005-7zbMath0648.68042OpenAlexW2073164949MaRDI QIDQ1105360

Gonzalo Escalada-Imaz, Malik Ghallab

Publication date: 1988

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(88)90005-7

zbMATH Keywords

first-order termsalmost linear worst- case complexityefficient unification algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract data types; algebraic specification (68Q65)

Related Items (1)

Unnamed Item

Cites Work

• A unification algorithm for typed \(\overline\lambda\)-calculus
• Linear unification
• On the sequential nature of unification
• An Efficient Unification Algorithm
• Efficiency of a Good But Not Linear Set Union Algorithm
• A Machine-Oriented Logic Based on the Resolution Principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A practically efficient and almost linear unification algorithm