Average case analysis of unification algorithms

DOI10.1007/BFB0020799MaRDI QIDQ4035669zbMATH OpenFDO

Authors Luc Albert, Rafael Casas, François Fages, A. Torrecillas, Paul Zimmermann

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

average case complexitygenerating functionsunification algorithm

Mathematics Subject Classification ID

Logic programming (68N17) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Symbolic computation and algebraic computation (68W30)

Recommendations

• Average-case analysis of unification algorithms
• Fast algorithms for uniform semi-unification
• Average-case analysis of Robinson's unification algorithm with two different variables
• scientific article; zbMATH DE number 4060709
• An almost linear Robinson unification algorithm

Cited in

(12)

• Average-case analysis of Robinson's unification algorithm with two different variables
• Unification: A case-study in data refinement
• Faster linear unification algorithm
• scientific article; zbMATH DE number 4060703 (Why is no real title available?)
• scientific article; zbMATH DE number 4060709 (Why is no real title available?)
• scientific article; zbMATH DE number 522867 (Why is no real title available?)
• scientific article; zbMATH DE number 3995082 (Why is no real title available?)
• scientific article; zbMATH DE number 862545 (Why is no real title available?)
• Analytic analysis of algorithms
• An almost linear Robinson unification algorithm
• Efficient tree pattern unification
• Average-case analysis of unification algorithms

This page was built for publication: Average case analysis of unification algorithms

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