Search Results for author:
Found 13 papers, 1 papers with code
Towards Ontology Construction with Language Models
We present a method for automatically constructing a concept hierarchy for a given domain by querying a large language model.
Temporalising Unique Characterisability and Learnability of Ontology-Mediated Queries
Recently, the study of the unique characterisability and learnability of database queries by means of examples has been extended to ontology-mediated queries.
SAT-Based PAC Learning of Description Logic Concepts
We propose bounded fitting as a scheme for learning description logic concepts in the presence of ontologies.
On the non-efficient PAC learnability of conjunctive queries
This note serves three purposes: (i) we provide a self-contained exposition of the fact that conjunctive queries are not efficiently learnable in the Probably-Approximately-Correct (PAC) model, paying clear attention to the complicating fact that this concept class lacks the polynomial-size fitting property, a property that is tacitly assumed in much of the computational learning theory literature; (ii) we establish a strong negative PAC learnability result that applies to many restricted classes of conjunctive queries (CQs), including acyclic CQs for a wide range of notions of "acyclicity"; (iii) we show that CQs (and UCQs) are efficiently PAC learnable with membership queries.
Frontiers and Exact Learning of ELI Queries under DL-Lite Ontologies
We study ELI queries (ELIQs) in the presence of ontologies formulated in the description logic DL-Lite.
Conservative Extensions for Existential Rules
We study the problem to decide, given sets T1, T2 of tuple-generating dependencies (TGDs), also called existential rules, whether T2 is a conservative extension of T1.
Actively Learning Concepts and Conjunctive Queries under ELr-Ontologies
We also show that EL-concepts are not polynomial query learnable in the presence of ELI-ontologies.
Conservative Extensions in Horn Description Logics with Inverse Roles
We investigate the decidability and computational complexity of conservative extensions and the related notions of inseparability and entailment in Horn description logics (DLs) with inverse roles.
Answering Regular Path Queries Over SQ Ontologies
We study query answering in the description logic $\mathcal{SQ}$ supporting qualified number restrictions on both transitive and non-transitive roles.
On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles
We study the description logic SQ with number restrictions applicable to transitive roles, extended with either nominals or inverse roles.
Separating Positive and Negative Data Examples by Concepts and Formulas: The Case of Restricted Signatures
We study the separation of positive and negative data examples in terms of description logic (DL) concepts and formulas of decidable FO fragments, in the presence of an ontology.
Logical Separability of Labeled Data Examples under Ontologies
Finding a logical formula that separates positive and negative examples given in the form of labeled data items is fundamental in applications such as concept learning, reverse engineering of database queries, generating referring expressions, and entity comparison in knowledge graphs.
Quantified Markov Logic Networks
Markov Logic Networks (MLNs) are well-suited for expressing statistics such as "with high probability a smoker knows another smoker" but not for expressing statements such as "there is a smoker who knows most other smokers", which is necessary for modeling, e. g. influencers in social networks.
