Tableau methods for reasoning with link keys

Manuel Atencia (1) , Jérôme Euzenat (1) , Khadija Jradeh (1, 2) , Chan Le Duc (3)

1 MOEX - Evolution de la connaissance
2 LIASD - Laboratoire d'Informatique Avancée de Saint-Denis
3 LIMICS - Laboratoire d'Informatique Médicale et Ingénierie des Connaissances en e-Santé

Data interlinking is a critical task for widening and enhancing linked open data. One way to tackle data interlinking is to use link keys, which generalise keys to the case of two RDF datasets described using different ontologies. Link keys specify pairs of properties to compare for finding same-as links between instances of two classes of two different datasets. Hence, they can be used for finding links. Link keys can also be considered as logical axioms just like keys, ontologies and ontology alignments. We introduce the logic ALC+LK extending the description logic ALC with link keys. It may be used to reason and infer entailed link keys that may be more useful for a particular data interlinking task. We show that link key entailment can be reduced to consistency checking without introducing the negation of link keys. For deciding the consistency of an ALC+LK ontology, we introduce a new tableau-based algorithm. Contrary to the classical ones, the completion rules concerning link keys apply to pairs of individuals not directly related. We show that this algorithm is sound, complete and always terminates.

Mots clés: tableaux; reasoning; link keys; data interlinking; consistency; description logics

Domaines: Intelligence artificielle [cs.AI]; Web

Manuel Atencia, Jérôme Euzenat, Khadija Jradeh, Chan Le Duc. Tableau methods for reasoning with link keys. [Contract] 2.1, Laboratoire d'Informatique de Grenoble; INRIA Grenoble Rhône-Alpes; Université Paris 8. 2019, pp.1-32. ⟨hal-02090087v2⟩