A brief Introduction to First-Order Logic Unification at the example of Corbin and Bidoit's variation of Robinson's Unification Algorithm release_b2graaepdfhn7ayluo45gholyu

by Johannah Sprinz

Published by LMU Munich.



Automated reasoning and deduction have interested computer scientists and logicians since the earliest days of modern information technology. One of the fundamental processes of this field is unification, meaning the automated solving of equations containing symbolic expressions. This paper revisits the 1965 Robinson Unification algorithm, which is now recognized as being the first machine-oriented unification algorithm for first-order logic. The primary criticism to be brought against this algorithm is its exponential space complexity. Corbin and Bidoit proposed a revised version of the algorithm that aims to address this problem in 1983, which is discussed here as well.
Unknown format

Archived Files and Locations

439.5 kB
www.cip.ifi.lmu.de (web)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   published
Date   2021-09-16
Language   en ?
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: a734140d-439b-4188-aef2-cf1daefcbdcc