About the Paterson-Wegman linear unification algorithm

DOI10.1016/0022-0000(86)90003-6zbMath0645.68103OpenAlexW2008943547MaRDI QIDQ1103417

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

Related Items (8)

Accelerating tableaux proofs using compact representations ⋮ On the Parameterized Complexity of Associative and Commutative Unification ⋮ Automatic theorem proving. II ⋮ Unnamed Item ⋮ On the parameterized complexity of associative and commutative unification ⋮ A practical unification algorithm ⋮ Faster linear unification algorithm ⋮ Semi-unification

Cites Work

• Linear unification
• A Machine-Oriented Logic Based on the Resolution Principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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