English
Related papers

Related papers: Large-scale Ontological Reasoning via Datalog

200 papers

We study the problem of rewriting an ontology O1 expressed in a DL L1 into an ontology O2 in a Horn DL L2 such that O1 and O2 are equisatisfiable when extended with an arbitrary dataset. Ontologies that admit such rewritings are amenable to…

Artificial Intelligence · Computer Science 2015-04-22 Mark Kaminski , Bernardo Cuenca Grau

The W3C Web Ontology Language (OWL) is a powerful knowledge representation formalism at the basis of many semantic-centric applications. Since its unrestricted usage makes reasoning undecidable already in case of very simple tasks,…

Artificial Intelligence · Computer Science 2020-08-06 Alessio Fiorentino , Jessica Zangari , Marco Manna

OWL 2 has been standardized by the World Wide Web Consortium (W3C) as a family of ontology languages for the Semantic Web. The most expressive of these languages is OWL 2 Full, but to date no reasoner has been implemented for this language.…

Artificial Intelligence · Computer Science 2011-08-02 Michael Schneider , Geoff Sutcliffe

Rewriting-based approaches for answering queries over an OWL 2 DL ontology have so far been developed mainly for Horn fragments of OWL 2 DL. In this paper, we study the possibilities of answering queries over non-Horn ontologies using…

Artificial Intelligence · Computer Science 2013-04-09 Bernardo Cuenca Grau , Boris Motik , Giorgos Stoilos , Ian Horrocks

Magic sets are a Datalog to Datalog rewriting technique to optimize query answering. The rewritten program focuses on a portion of the stable model(s) of the input program which is sufficient to answer the given query. However, the…

Artificial Intelligence · Computer Science 2020-02-19 Mario Alviano , Nicola Leone , Pierfrancesco Veltri , Jessica Zangari

We show that, for OWL 2 QL ontology-mediated queries with (i) ontologies of bounded depth and conjunctive queries of bounded treewidth, (ii) ontologies of bounded depth and bounded-leaf tree-shaped conjunctive queries, and (iii) arbitrary…

Logic in Computer Science · Computer Science 2016-04-19 Meghyn Bienvenu , Stanislav Kikot , Roman Kontchakov , Vladimir V. Podolskii , Michael Zakharyaschev

Large Language Models (LLMs), despite their success in question answering, exhibit limitations in complex multi-hop question answering (MQA) tasks that necessitate non-linear, structured reasoning. This limitation stems from their inability…

Computation and Language · Computer Science 2025-09-25 Haonan Bian , Yutao Qi , Rui Yang , Yuanxi Che , Jiaqian Wang , Heming Xia , Ranran Zhen

We introduce ontology-mediated planning, in which planning problems are combined with an ontology. Our formalism differs from existing ones in that we focus on a strong separation of the formalisms for describing planning problems and…

Artificial Intelligence · Computer Science 2024-08-15 Tobias John , Patrick Koopmann

DatalogMTL is a powerful rule-based language for temporal reasoning. Due to its high expressive power and flexible modeling capabilities, it is suitable for a wide range of applications, including tasks from industrial and financial…

Artificial Intelligence · Computer Science 2025-12-16 Shaoyu Wang , Kaiyue Zhao , Dongliang Wei , Przemysław Andrzej Wałęga , Dingmin Wang , Hongming Cai , Pan Hu

In ontology-mediated query answering, access to incomplete data sources is mediated by a conceptual layer constituted by an ontology, which can be formulated in a description logic (DL) or using existential rules. In the literature, there…

Logic in Computer Science · Computer Science 2022-08-31 Christian Alrabbaa , Stefan Borgwardt , Patrick Koopmann , Alisa Kovtunova

The ability of Large Language Models (LLMs) to perform reasoning tasks such as deduction has been widely investigated in recent years. Yet, their capacity to generate proofs-faithful, human-readable explanations of why conclusions…

Artificial Intelligence · Computer Science 2026-01-21 Hui Yang , Jiaoyan Chen , Uli Sattler

We study the problem of rewriting a disjunctive datalog program into plain datalog. We show that a disjunctive program is rewritable if and only if it is equivalent to a linear disjunctive program, thus providing a novel characterisation of…

Artificial Intelligence · Computer Science 2014-04-14 Mark Kaminski , Yavor Nenov , Bernardo Cuenca Grau

The ability to conduct logical reasoning is a fundamental aspect of intelligent human behavior, and thus an important problem along the way to human-level artificial intelligence. Traditionally, logic-based symbolic methods from the field…

Artificial Intelligence · Computer Science 2021-01-11 Patrick Hohenecker , Thomas Lukasiewicz

With the growth of the Semantic Web in size and importance, more and more knowledge is stored in machine-readable formats such as the Web Ontology Language OWL. This paper outlines common approaches for efficient reasoning on large-scale…

Artificial Intelligence · Computer Science 2016-02-16 Michael Ruster

In this paper we use results from Computable Set Theory as a means to represent and reason about description logics and rule languages for the semantic web. Specifically, we introduce the description logic $\mathcal{DL}\langle…

Logic in Computer Science · Computer Science 2015-05-11 Domenico Cantone , Cristiano Longo , Marianna Nicolosi-Asmundo , Daniele Francesco Santamaria

Recent years witnessed a rising interest towards Datalog-based ontological reasoning systems, both in academia and industry. These systems adopt languages, often shared under the collective name of Datalog$+/-$, that extend Datalog with the…

Databases · Computer Science 2023-11-22 Teodoro Baldazzi , Luigi Bellomarini , Marco Favorito , Emanuel Sallinger

In this paper, we introduce a novel interpreting framework that learns an interpretable model based on an ontology-based sampling technique to explain agnostic prediction models. Different from existing approaches, our algorithm considers…

Machine Learning · Computer Science 2020-04-02 Phung Lai , NhatHai Phan , Han Hu , Anuja Badeti , David Newman , Dejing Dou

To appear in Theory and Practice of Logic Programming (TPLP), 2008. We are researching the interaction between the rule and the ontology layers of the Semantic Web, by comparing two options: 1) using OWL and its rule extension SWRL to…

Artificial Intelligence · Computer Science 2007-11-22 Ken Samuel , Leo Obrst , Suzette Stoutenberg , Karen Fox , Paul Franklin , Adrian Johnson , Ken Laskey , Deborah Nichols , Steve Lopez , Jason Peterson

SHACL and OWL are two prominent W3C standards for managing RDF data. These languages share many features, but they have one fundamental difference: OWL, designed for inferring facts from incomplete data, makes the open-world assumption,…

Logic in Computer Science · Computer Science 2026-01-21 Anouk Oudshoorn , Magdalena Ortiz , Mantas Simkus

Ontologies are known to improve the accuracy of Large Language Models (LLMs) when translating natural language queries into a formal query language like SQL or SPARQL. There are two ways to leverage ontologies when working with LLMs. One is…

Databases · Computer Science 2024-10-15 C. Civili , E. Sherkhonov , R. E. K. Stirewalt
‹ Prev 1 2 3 10 Next ›