Faster linear unification algorithm

DOI10.1007/S10817-022-09635-1MaRDI QIDQ2102937zbMATH OpenOpenAlexFDO

Authors Dennis de Champeaux

Publication date 12 December 2022

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10817-022-09635-1

zbMATH Keywords

theorem provinglinear unificationplanning action precondition checking

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

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

Cites work

• A Machine-Oriented Logic Based on the Resolution Principle
• A Proof Procedure Using Connection Graphs
• About the Paterson-Wegman linear unification algorithm
• An Efficient Unification Algorithm
• Linear unification
• Unification theory

Cited in

(5)

• An almost linear Robinson unification algorithm
• About the Paterson-Wegman linear unification algorithm
• scientific article; zbMATH DE number 4060709 (Why is no real title available?)
• An ordering linear unification algorithm
• A practically efficient and almost linear unification algorithm

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: Faster linear unification algorithm

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