Affiliations: [a] AI Reasoning, IBM Research, 1101 Kitchawan Rd, Yorktown Heights, NY 10598, USA. E-mail: firstname.lastname@example.org | [b] TWC, Rensselaer Polytechnic Institute, 110 8th St, Troy, NY 12180, USA. E-mail: email@example.com
Note:  The code, models and datasets for this paper are available at: https://github.com/Bassem-Makni/NMT4RDFS.
Abstract: Since the 2001 envisioning of the Semantic Web (SW) (Scientific American 284(5) 2001(2001) 34–43), the main research focus in SW reasoning has been on the soundness and completeness of reasoners. While these reasoners assume the veracity of input data, the reality is that the Web of data is inherently noisy. Although there has been recent work on noise-tolerant reasoning, it has focused on type inference rather than full RDFS reasoning. Even though RDFS closure generation can be seen as a Knowledge Graph (KG) completion problem, the problem setting is different – making KG embedding techniques that were designed for link prediction not suitable for RDFS reasoning. This paper documents a novel approach that extends noise-tolerance in the SW to full RDFS reasoning. Our embedding techniqu – that is tailored for RDFS reasoning – consists of layering RDF graphs and encoding them in the form of 3D adjacency matrices where each layer layout forms a graph word. Each input graph and its entailments are then represented as sequences of graph words, and RDFS inference can be formulated as translation of these graph words sequences, achieved through neural machine translation. Our evaluation on LUBM1 synthetic dataset shows 97% validation accuracy and 87.76% on a subset of DBpedia while demonstrating a noise-tolerance unavailable with rule-based reasoners.
Keywords: Deep learning, Semantic Web, RDFS reasoning, noise-tolerance, neural machine translation, graph words
Journal: Semantic Web, vol. Pre-press, no. Pre-press, pp. 1-40, 2019