An almost linear Robinson unification algorithm

DOI10.1007/BF00263501zbMath0689.68110OpenAlexW2035216974MaRDI QIDQ582141

Igor Prívara, Peter Ružička

Publication date: 1989

Published in: Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

Robinson unification algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Abstract data types; algebraic specification (68Q65) Thue and Post systems, etc. (03D03)

Related Items (3)

The negation elimination from syntactic equational formula is decidable ⋮ Fast algorithms for uniform semi-unification ⋮ Source-tracking unification

Cites Work

• Linear unification
• An Efficient Unification Algorithm
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: An almost linear Robinson unification algorithm