An almost linear Robinson unification algorithm

DOI10.1007/BF00263501MaRDI QIDQ582141zbMATH OpenOpenAlexFDO

Authors Peter Ružička, Igor Prívara

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) Thue and Post systems, etc. (03D03) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 4060709
• A practical unification algorithm
• A practically efficient and almost linear unification algorithm
• Faster linear unification algorithm
• scientific article; zbMATH DE number 176505

Cites work

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

Cited in

(15)

• A practical unification algorithm
• Verification of the Completeness of Unification Algorithms à la Robinson
• A Robin algorithm for unilateral contact problems
• About the Paterson-Wegman linear unification algorithm
• scientific article; zbMATH DE number 4060709 (Why is no real title available?)
• Source-tracking unification
• Fast algorithms for uniform semi-unification
• An ordering linear unification algorithm
• A practically efficient and almost linear unification algorithm
• Faster linear unification algorithm
• scientific article; zbMATH DE number 4035119 (Why is no real title available?)
• An algorithm for the retrieval of unifiers from discrimination trees
• The negation elimination from syntactic equational formula is decidable
• Efficient tree pattern unification
• scientific article; zbMATH DE number 176505 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582141)