About the Paterson-Wegman linear unification algorithm

DOI10.1016/0022-0000(86)90003-6MaRDI QIDQ1103417zbMATH OpenOpenAlexFDO

Authors Dennis De Champeaux

Publication date 1986

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(86)90003-6

zbMATH Keywords

core algorithmPaterson-Wegman unification algorithmpost-processorpre-processorstructure sharing

Mathematics Subject Classification ID

Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Recommendations

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

Cites work

• A Machine-Oriented Logic Based on the Resolution Principle
• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 3568056 (Why is no real title available?)
• scientific article; zbMATH DE number 3569825 (Why is no real title available?)
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• Linear unification

Cited in

(8)

• Accelerating tableaux proofs using compact representations
• Faster linear unification algorithm
• On the parameterized complexity of associative and commutative unification
• Automatic theorem proving. II
• scientific article; zbMATH DE number 7455734 (Why is no real title available?)
• On the parameterized complexity of associative and commutative unification
• A practical unification algorithm
• Semi-unification

This page was built for publication: About the Paterson-Wegman linear unification algorithm

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