English
Related papers

Related papers: Unique Characterisability and Learnability of Temp…

200 papers

We aim to determine which temporal instance queries can be uniquely characterised by a (polynomial-size) set of positive and negative temporal data examples. We start by considering queries formulated in fragments of propositional linear…

Logic in Computer Science · Computer Science 2022-05-04 Marie Fortin , Boris Konev , Vladislav Ryzhikov , Yury Savateev , Frank Wolter , Michael Zakharyaschev

We answer the question which conjunctive queries are uniquely characterized by polynomially many positive and negative examples, and how to construct such examples efficiently. As a consequence, we obtain a new efficient exact learning…

Logic in Computer Science · Computer Science 2022-08-25 Balder ten Cate , Victor Dalmau

We investigate the extent to which Linear Temporal Logic (LTL) formulas can be uniquely characterized by a finite set of labeled examples. We consider different types of examples, ranging from finite words to transfinite words, as well as…

Logic in Computer Science · Computer Science 2026-04-27 Balder ten Cate , Dana Fisman , Roi Ohayon , Patrik Sestic

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

In reverse engineering of database queries, we aim to construct a query from a given set of answers and non-answers; it can then be used to explore the data further or as an explanation of the answers and non-answers. We investigate this…

Logic in Computer Science · Computer Science 2023-05-08 Marie Fortin , Boris Konev , Vladislav Ryzhikov , Yury Savateev , Frank Wolter , Michael Zakharyaschev

We investigate the problem of learning description logic ontologies from entailments via queries, using epistemic reasoning. We introduce a new learning model consisting of epistemic membership and example queries and show that polynomial…

Artificial Intelligence · Computer Science 2019-02-12 Ana Ozaki , Nicolas Troquard

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

We investigate the data complexity of answering queries mediated by metric temporal logic ontologies under the event-based semantics assuming that data instances are finite timed words timestamped with binary fractions. We identify classes…

Logic in Computer Science · Computer Science 2019-07-02 Vladislav Ryzhikov , Przemyslaw Andrzej Walega , Michael Zakharyaschev

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

We introduce and study several notions of approximation for ontology-mediated queries based on the description logics ALC and ALCI. Our approximations are of two kinds: we may (1) replace the ontology with one formulated in a tractable…

Artificial Intelligence · Computer Science 2022-07-01 Anneke Haga , Carsten Lutz , Leif Sabellek , Frank Wolter

Our aim is to investigate ontology-based data access over temporal data with validity time and ontologies capable of temporal conceptual modelling. To this end, we design a temporal description logic, TQL, that extends the standard ontology…

Logic in Computer Science · Computer Science 2013-05-01 Alessandro Artale , Roman Kontchakov , Frank Wolter , Michael Zakharyaschev

We study the enumeration of answers to ontology-mediated queries (OMQs) where the ontology is a set of guarded TGDs or formulated in the description logic ELI and the query is a conjunctive query (CQ). In addition to the traditional notion…

Databases · Computer Science 2022-03-18 Carsten Lutz , Marcin Przybyłko

We investigate learnability of possibilistic theories from entailments in light of Angluin's exact learning model. We consider cases in which only membership, only equivalence, and both kinds of queries can be posed by the learner. We then…

Logic in Computer Science · Computer Science 2020-05-08 Cosimo Persia , Ana Ozaki

We propose a novel framework to facilitate the on-demand design of data-centric systems by exploiting domain knowledge from an existing ontology. Its key ingredient is a process that we call focusing, which allows to obtain a schema for a…

Logic in Computer Science · Computer Science 2019-04-02 Tomasz Gogacz , Víctor Gutiérrez-Basulto , Yazmín A. Ibáñez-García , Filip Murlak , Magdalena Ortiz , Mantas Šimkus

Ontologies provide formal representation of knowledge shared within Semantic Web applications. Ontology learning involves the construction of ontologies from a given corpus. In the past years, ontology learning has traversed through shallow…

Information Retrieval · Computer Science 2024-06-18 Rick Du , Huilong An , Keyu Wang , Weidong Liu

Temporal logics over finite traces have recently seen wide application in a number of areas, from business process modelling, monitoring, and mining to planning and decision making. However, real-life dynamic systems contain a degree of…

Logic in Computer Science · Computer Science 2019-11-19 Fabrizio M. Maggi , Marco Montali , Rafael Peñaloza

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

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

We consider modeling the conception of knowledge in terms of temporal logic. The study of knowledge logical operations is originated around 1962 by representation of knowledge and belief using modalities. Nowadays, it is very good…

Logic in Computer Science · Computer Science 2014-05-06 Vladimir Rybakov

Identifying temporal relations between events is an essential step towards natural language understanding. However, the temporal relation between two events in a story depends on, and is often dictated by, relations among other events.…

Computation and Language · Computer Science 2019-06-13 Qiang Ning , Zhili Feng , Dan Roth
‹ Prev 1 2 3 10 Next ›