Abstract
As we have already seen, free unification plays a fundamental role in SLD-resolution: more generally, it lies at the core of any form of resolution within predicate logic. This is why Prolog uses it as its parameter passing mechanism, gaining from this a certain degree of invertibility which stems from the fact that two terms being unified get treated on an equal basis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cantone, D., Omodeo, E., Policriti, A. (2001). Set/Hyperset Unification Algorithms. In: Set Theory for Computing. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3452-2_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3452-2_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2905-1
Online ISBN: 978-1-4757-3452-2
eBook Packages: Springer Book Archive