English
Related papers

Related papers: Rewriting Ontological Queries into Small Nonrecurs…

200 papers

A prominent approach to implementing ontology-mediated queries (OMQs) is to rewrite into a first-order query, which is then executed using a conventional SQL database system. We consider the case where the ontology is formulated in the…

Artificial Intelligence · Computer Science 2018-04-20 Peter Hansen , Carsten Lutz

Despite the many advantages that ontology-based data access (OBDA) has brought to a range of application domains, state-of-the-art OBDA systems still do not support popular graph database management systems such as Neo4j. Algorithms for…

Databases · Computer Science 2025-04-24 Bianca Löhnert , Nikolaus Augsten , Cem Okulmus , Magdalena Ortiz

Query rewriting plays a vital role in enhancing conversational search by transforming context-dependent user queries into standalone forms. Existing approaches primarily leverage human-rewritten queries as labels to train query rewriting…

Human-Computer Interaction · Computer Science 2023-10-19 Fanghua Ye , Meng Fang , Shenghui Li , Emine Yilmaz

To address the requirement of enabling a comprehensive perspective of life-sciences data, Semantic Web technologies have been adopted for standardized representations of data and linkages between data. This has resulted in data warehouses…

Databases · Computer Science 2016-02-03 HyeongSik Kim , Kemafor Anyanwu

Ontology-based query answering (OBQA) augments classical query answering in databases by domain knowledge encoded in an ontology. Systems for OBQA use the ontological knowledge to infer new information that is not explicitly given in the…

Logic in Computer Science · Computer Science 2020-03-24 Stefan Borgwardt , Veronika Thost

SPARQL query rewriting is a fundamental mechanism for uniformly querying heterogeneous ontologies in the Linked Data Web. However, the complexity of ontology alignments, particularly rich correspondences (c : c), makes this process…

Databases · Computer Science 2025-12-08 Anicet Lepetit Ondo , Laurence Capus , Mamadou Bousso

A typical workflow for solving a linear programming problem is to first write a linear program parametrized by the data in a language such as Math GNU Prog or AMPL then call the solver on this program while providing the data. When the data…

Databases · Computer Science 2019-07-22 Florent Capelli , Nicolas Crosetti , Joachim Niehren , Jan Ramon

Counting answers to a query is an operation supported by virtually all database management systems. In this paper we focus on counting answers over a Knowledge Base (KB), which may be viewed as a database enriched with background knowledge…

Databases · Computer Science 2020-07-20 Diego Calvanese , Julien Corman , Davide Lanti , Simon Razniewski

In ontology-based data access (OBDA), ontologies have been successfully employed for querying possibly unstructured and incomplete data. In this paper, we advocate using ontologies not only to formulate queries and compute their answers,…

Logic in Computer Science · Computer Science 2018-08-09 Medina Andreşel , Yazmin Ibáñez-García , Magdalena Ortiz , Mantas Šimkus

We study the problem of fitting a description logic (DL) ontology to a given set of positive and negative examples that take the form of an ABox and a Boolean query. While previous work has investigated this problem for the expressive DLs…

Logic in Computer Science · Computer Science 2026-05-01 Marvin Grosser , Carsten Lutz

Aiming at ontology-based data access to temporal data, we design two-dimensional temporal ontology and query languages by combining logics from the (extended) DL-Lite family with linear temporal logic LTL over discrete time (Z,<). Our main…

Logic in Computer Science · Computer Science 2022-10-24 Alessandro Artale , Roman Kontchakov , Alisa Kovtunova , Vladislav Ryzhikov , Frank Wolter , Michael Zakharyaschev

In this paper, we introduce the problem of rewriting finite formal languages using syntactic macros such that the rewriting is minimal in size. We present polynomial-time algorithms to solve variants of this problem and show their…

Artificial Intelligence · Computer Science 2023-12-19 Christian Kindermann , Anne-Marie George , Bijan Parsia , Uli Sattler

We study the problem of learning description logic (DL) ontologies in Angluin et al.'s framework of exact learning via queries. We admit membership queries ("is a given subsumption entailed by the target ontology?") and equivalence queries…

Machine Learning · Computer Science 2017-09-22 Boris Konev , Carsten Lutz , Ana Ozaki , Frank Wolter

While classical planning languages make the closed-domain and closed-world assumption, there have been various approaches to extend those with DL reasoning, which is then interpreted under the usual open-world semantics. Current approaches…

Artificial Intelligence · Computer Science 2023-08-17 Tobias John , Patrick Koopmann

To answer database queries over incomplete data the gold standard is finding certain answers: those that are true regardless of how incomplete data is interpreted. Such answers can be found efficiently for conjunctive queries and their…

Databases · Computer Science 2023-10-20 Amélie Gheerbrant , Leonid Libkin , Alexandra Rogova , Cristina Sirangelo

End users of recent biomedical information systems are often unaware of the storage structure and access mechanisms of the underlying data sources and can require simplified mechanisms for writing domain specific complex queries. This…

Databases · Computer Science 2008-12-16 Kamran Munir , Mohammed Odeh , Richard McClatchey

In ontology-mediated querying, description logic (DL) ontologies are used to enrich incomplete data with domain knowledge which results in more complete answers to queries. However, the evaluation of ontology-mediated queries (OMQs) over…

Databases · Computer Science 2020-07-30 Pablo Barcelo , Cristina Feier , Carsten Lutz , Andreas Pieris

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

Large language models (LLMs) have shown significant achievements in solving a wide range of tasks. Recently, LLMs' capability to store, retrieve and infer with symbolic knowledge has drawn a great deal of attention, showing their potential…

Artificial Intelligence · Computer Science 2024-10-11 Keyu Wang , Guilin Qi , Jiaqi Li , Songlin Zhai

Ontology-mediated query answering (OMQA) is a promising approach to data access and integration that has been actively studied in the knowledge representation and database communities for more than a decade. The vast majority of work on…

Logic in Computer Science · Computer Science 2020-09-22 Meghyn Bienvenu , Quentin Manière , Michaël Thomazo