Abstract
The traditional unification is strict in the sense that it requires a perfect agreement between the terms being unified. In practice, data is seldom error-free and can contain incorrect information. Traditional unification fails when the data is imperfect. We propose relaxed unification as a new theory that relaxes the constraints of the traditional unification. The goal of relaxed unification is to tolerate possible errors and inconsistencies in the data and facilitate reasoning under uncertainty.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abou-Assaleh, T., Cercone, N. (2002). Relaxed Unification — Proposal. In: Cohen, R., Spencer, B. (eds) Advances in Artificial Intelligence. Canadian AI 2002. Lecture Notes in Computer Science(), vol 2338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47922-8_37
Download citation
DOI: https://doi.org/10.1007/3-540-47922-8_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43724-6
Online ISBN: 978-3-540-47922-2
eBook Packages: Springer Book Archive