A General Similarity Framework for Horn Clause Logic

• Published in: Fundamenta informaticae Vol. 90; no. 1-2; pp. 43 - 66
• Main Authors: Ferilli, S., Basile, T.M.A., Biba, M., Di Mauro, N., Esposito, F.
• Format: Journal Article
• Language: English
• Published: London, England SAGE Publications 01.01.2009
• Subjects: Logic Programming; Similarity/Distance Measures; First-Order Logic
• ISSN: 0169-2968; 1875-8681
• DOI: 10.3233/FI-2009-0004

First-Order Logic formulæ are a powerful representation formalism characterized by the use of relations, that cause serious computational problems due to the phenomenon of indeterminacy (various portions of one description are possibly mapped in different ways onto another description). Being able to identify the correct corresponding parts of two descriptions would help to tackle the problem: hence, the need for a framework for the comparison and similarity assessment. This could have many applications in Artificial Intelligence: guiding subsumption procedures and theory revision systems, implementing flexible matching, supporting instance-based learning and conceptual clustering. Unfortunately, few works on this subject are available in the literature. This paper focuses on Horn clauses, which are the basis for the Logic Programming paradigm, and proposes a novel similarity formula and evaluation criteria for identifying the descriptions components that are more similar and hence more likely to correspond to each other, based only on their syntactic structure. Experiments on real-world datasets prove the effectiveness of the proposal, and the efficiency of the corresponding implementation in the above tasks.