paper-with-me

Papers

Actively Learning Concepts and Conjunctive Queries under ELr-Ontologies

2021-05-18 · Maurice Funk, Jean Christoph Jung, Carsten Lutz

We consider the problem to learn a concept or a query in the presence of an ontology formulated in the description logic ELr, in Angluin's framework of active learning that allows the learning algorithm to interactively query an oracle (such as a domain expert). We show that the following can be learned in polynomial time: (1) EL-concepts, (2) symmetry-free ELI-concepts, and (3) conjunctive queries (CQs) that are chordal, symmetry-free, and of bounded arity. In all cases, the learner can pose to the oracle membership queries based on ABoxes and equivalence queries that ask whether a given concept/query from the considered class is equivalent to the target. The restriction to bounded arity in (3) can be removed when we admit unrestricted CQs in equivalence queries. We also show that EL-concepts are not polynomial query learnable in the presence of ELI-ontologies.

📄 PDF Abstract BibTeX arXiv:2105.08326

Code (0)

등록된 구현이 없습니다.

Tasks

Active Learning

Similar Papers 제목 키워드 기반

The Data Complexity of Description Logic Ontologies

2016-11-08 · Carsten Lutz, Frank Wolter

We analyze the data complexity of ontology-mediated querying where the ontologies are formulated in a description logic (DL) of the ALC family and queries are conjunctive queries, positive existential queries, or acyclic…

Finite Entailment of UCRPQs over ALC Ontologies

2022-04-29 · Vıctor Gutiérrez-Basulto, Albert Gutowski, Yazmın Ibáñez-Garcıa, Filip Murlak

We investigate the problem of finite entailment of ontology-mediated queries. We consider the expressive query language, unions of conjunctive regular path queries (UCRPQs), extending the well-known class of union of con…

Answering Fuzzy Queries over Fuzzy DL-Lite Ontologies

2021-11-23 · Gabriella Pasi, Rafael Peñaloza

A prominent problem in knowledge representation is how to answer queries taking into account also the implicit consequences of an ontology representing domain knowledge. While this problem has been widely studied within …

First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics

2020-11-19 · Meghyn Bienvenu, Peter Hansen, Carsten Lutz, Frank Wolter

We study FO-rewritability of conjunctive queries in the presence of ontologies formulated in a description logic between EL and Horn-SHIF, along with related query containment problems. Apart from providing characterizat…

Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results

2014-06-11 · Meghyn Bienvenu, Stanislav Kikot, Vladimir Podolskii

This paper investigates the impact of query topology on the difficulty of answering conjunctive queries in the presence of OWL 2 QL ontologies. Our first contribution is to clarify the worst-case size of positive existen…