Most commonly, the Open World Assumption is adopted as a standard strategy for the design, construction and use of ontologies. This strategy limits the inferencing capabilities of any system because non-asserted statements (missing knowledge) could be assumed to be alternatively true or false. As we will demonstrate, this is especially the case of first-order logic (FOL) ontologies where non-asserted statements is nowadays one of the main obstacles to its practical application in automated commonsense reasoning tasks. In this paper, we investigate the application of the Closed World Assumption (CWA) to enable a better exploitation of FOL ontologies by using state-of-the-art automated theorem provers. To that end, we explore different CWA formulations for the structural knowledge encoded in a FOL translation of the SUMO ontology, discovering that almost 30 % of the structural knowledge is missing. We evaluate these formulations on a practical experimentation using a very large commonsense benchmark obtained from WordNet through its mapping to SUMO. The results show that the competency of the ontology improves more than 50 % when reasoning under the CWA. Thus, applying the CWA automatically to FOL ontologies reduces their ambiguity and more commonsense questions can be answered
University of Trento(特伦托大学);Institute for Globally Distributed Open Research and Education (IGDORE)(全球分布式开放研究与教育研究所(IGDORE));Dublin City University (DCU)(都柏林城市大学(DCU))
Building Rules on Top of Ontologies for the Semantic Web with Inductive Logic Programming
Università degli Studi di Bari(巴里大学)
在本体之上构建规则是语义Web逻辑层的最终目标。为此,目前正在讨论一种用于这一层的特别标记语言。它的目的是遵循传统的混合知识表示和推理系统,如$\mathcal{AL}$ -日志,集成了描述逻辑$\mathcal{ALC}$和无函数霍恩子句语言\textsc{Datalog}。在本文中,我们考虑的问题,这些规则的语义Web的自动化收购。我们提出了一个通用的规则归纳框架,采用归纳逻辑程序设计的方法装置,并依赖于$\mathcal{AL}$ -log的表达和演绎能力。无论归纳的范围(描述与预测)如何,该框架都是有效的。然而,为了说明的目的,我们还讨论了一个实例化的框架,其目的是描述和原来是有用的本体精化。关键词:归纳逻辑程序设计,混合知识表示和推理系统,本体,语义网。逻辑程序设计理论与实践(Theory and Practice of Logic Programming,TPLP)
Automated planning with ontologies under coherence update semantics (Extended Version)
Institute of Theoretical Computer Science, TU Dresden, Germany(德累斯顿技术大学理论计算机科学研究所);Department of Mathematics and Computer Science, University of Basel, Switzerland(巴塞尔大学数学与计算机科学系)
Answering Counting Queries over DL-Lite Ontologies
University of Bordeaux(波尔多大学);CNRS(法国国家科学研究中心);Bordeaux INP(波尔多国立理工学院);LaBRI(波尔多计算机科学研究实验室);Inria(法国国家信息与自动化研究所);DI ENS(巴黎高等师范学院计算机系);ENS(巴黎高等师范学院);University PSL(巴黎文理研究大学)
Connection-minimal Abduction in EL via Translation to FOL -- Technical Report
Max-Planck-Institut für Informatik(马克斯·普朗克信息学研究所);Graduate School of Computer Science(计算机科学研究生院);TU Dresden(德累斯顿工业大学);Université de Lorraine(洛林大学);CNRS(法国国家科学研究中心);Inria(法国国家信息与自动化研究所);LORIA(洛林信息学及其应用研究实验室)
Graph Neural Network based Hierarchy-Aware Embeddings of Knowledge Graphs: Applications to Yeast Phenotype Prediction
Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg(计算机科学与工程系,查尔姆斯理工大学和哥德堡大学);Department of Life Sciences, Chalmers University of Technology(生命科学系,查尔姆斯理工大学);Department of Industrial Biotechnology, KTH Royal Institute of Technology(工业生物技术系,皇家理工学院);Department of Chemical Engineering and Biotechnology, University of Cambridge(化学工程与生物技术系,剑桥大学)