Complexity of the unification algorithm for first-order expressions

DOI10.1007/BF02575754zbMath0332.68063OpenAlexW2141104250WikidataQ56092430 ScholiaQ56092430MaRDI QIDQ1228213

K. Appert

Publication date: 1976

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02575754

Mathematics Subject Classification ID

Related Items (6)

An efficient labelled nested multiset unification algorithm ⋮ Checking termination of bottom-up evaluation of logic programs with function symbols ⋮ Using linear constraints for logic program termination analysis ⋮ Average-case analysis of unification algorithms ⋮ Complete sets of unifiers and matchers in equational theories ⋮ Unification problem in equational theories

Cites Work

• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: Complexity of the unification algorithm for first-order expressions