English
Related papers

Related papers: Ontology-Mediated Querying on Databases of Bounded…

200 papers

The quest for acquiring a formal representation of the knowledge of a domain of interest has attracted researchers with various backgrounds into a diverse field called ontology learning. We highlight classical machine learning and data…

Artificial Intelligence · Computer Science 2021-04-06 Ana Ozaki

The following contribution introduces a concept that employs Large Language Models (LLMs) and a chatbot interface to enhance SPARQL query generation for ontologies, thereby facilitating intuitive access to formalized knowledge. Utilizing…

Information Retrieval · Computer Science 2024-10-18 Jonathan Reif , Tom Jeleniewski , Milapji Singh Gill , Felix Gehlhoff , Alexander Fay

Finding a few solutions for a given problem that are diverse, as opposed to finding a single best solution to solve the problem, has recently become a notable topic in theoretical computer science. Recently, Baste, Fellows, Jaffke,…

Data Structures and Algorithms · Computer Science 2026-03-30 Karolina Drabik , Tomáš Masařík

Competency Questions (CQs) are a form of ontology functional requirements expressed as natural language questions. Inspecting CQs together with the axioms in an ontology provides critical insights into the intended scope and applicability…

Artificial Intelligence · Computer Science 2024-07-23 Reham Alharbi , Valentina Tamma , Floriana Grasso , Terry Payne

Amid the recent uptake of Generative AI, sociotechnical scholars and critics have traced a multitude of resulting harms, with analyses largely focused on values and axiology (e.g., bias). While value-based analyses are crucial, we argue…

Human-Computer Interaction · Computer Science 2025-04-07 Nava Haghighi , Sunny Yu , James Landay , Daniela Rosner

Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator ("find the most preferred tuples in a given relation"). Such queries are parameterized by specific preference relations. Semantic…

Databases · Computer Science 2007-05-23 Jan Chomicki

The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear…

Programming Languages · Computer Science 2007-05-23 M. Bozzano , G. Delzanno , M. Martelli

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

Query optimization has been studied using machine learning, reinforcement learning, and, more recently, graph-based convolutional networks. Ontology, as a structured, information-rich knowledge representation, can provide context,…

Databases · Computer Science 2025-11-11 Songhui Yue , Yang Shao , Sean Hayes

Competency Questions (CQs) are widely used in ontology development by guiding, among others, the scoping and validation stages. However, very limited guidance exists for formulating CQs and assessing whether they are good CQs, leading to…

Artificial Intelligence · Computer Science 2024-12-19 C. Maria Keet , Zubeida Casmod Khan

This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target…

Quantum Physics · Physics 2016-05-24 Harumichi Nishimura , Tomoyuki Yamakami

Query evaluation on probabilistic databases is generally intractable (#P-hard). Existing dichotomy results have identified which queries are tractable (or safe), and connected them to tractable lineages. In our previous work, using…

Databases · Computer Science 2023-04-14 Antoine Amarilli , Pierre Bourhis , Pierre Senellart

Possible forms of obstructed atomic limits in quasi-one-dimensional systems are studied using line group symmetry. This is accomplished by revisiting the standard theory with an emphasis on its group-theoretical background, synthesizing the…

Other Condensed Matter · Physics 2024-12-30 Milan Damnjanovic , Ivanka Milosevic

Ontology-based data access (OBDA) is a novel paradigm facilitating access to relational data, realized by linking data sources to an ontology by means of declarative mappings. DL-Lite_R, which is the logic underpinning the W3C ontology…

Artificial Intelligence · Computer Science 2015-12-02 Elena Botoeva , Diego Calvanese , Valerio Santarelli , Domenico Fabio Savo , Alessandro Solimando , Guohui Xiao

Multiple choice questions (MCQs) that can be generated from a domain ontology can significantly reduce human effort & time required for authoring & administering assessments in an e-Learning environment. Even though here are various methods…

Artificial Intelligence · Computer Science 2016-07-05 Vinu E. , Tahani Alsubait , P. Sreenivasa Kumar

Description Logics are knowledge representation formalisms that provide, for example, the logical underpinning of the W3C OWL standards. Conjunctive queries, the standard query language in databases, have recently gained significant…

Logic in Computer Science · Computer Science 2014-01-17 Sebastian Rudolph , Birte Glimm

Ontologies are a popular way of representing domain knowledge, in particular, knowledge in domains related to life sciences. (Semi-)automating the process of building an ontology has attracted researchers from different communities into a…

Artificial Intelligence · Computer Science 2021-03-26 Ana Ozaki

Rapid growth of documents, web pages, and other types of text content is a huge challenge for the modern content management systems. One of the problems in the areas of information storage and retrieval is the lacking of semantic data.…

Databases · Computer Science 2015-02-23 Mona Dadjoo , Esmaeil Kheirkhah

A strength of parameterized algorithmics is that each problem can be parameterized by an essentially inexhaustible set of parameters. Usually, the choice of the considered parameter is informed by the theoretical relations between…

Computational Complexity · Computer Science 2026-05-05 Christian Komusiewicz , Nils Morawietz , Frank Sommer , Luca Pascal Staus

As todays world grows with the technology on the other hand it seems to be small with the World Wide Web. With the use of Internet more and more information can be search from the web. When Users fires a query they want relevancy in…

Information Retrieval · Computer Science 2013-11-26 Debajyoti Mukhopadhyay , Sajeeda Shikalgar