Search Results for author:
Found 5 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.
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.
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.
