Research map / Learning theory and algorithms / Combinatorial and search optimization
A Model for Learning Description Logic Ontologies Based on Exact Learning
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use conjunctive queries instead of instance queries for data retrieval examples | ELrhs TBox learning · Polynomial query learnability | learnability | Hurt |
| Add role inclusions to EL dialects | EL TBox learning · Polynomial query learnability | learnability | No clear effect |
| Use atomic queries as data retrieval language | EL TBox learning · Polynomial query learnability | unique identifiability of TBox | Hurt |
Closest papers by meaning
- Learning Query Inseparable εℒℋ Ontologies (AAAI 2020 · similarity 0.88)
- Data Complexity of Querying Description Logic Knowledge Bases Under Cost-Based Semantics (AAAI 2026 · similarity 0.88)
- Answering Conjunctive Queries with Safe Negation and Inequalities over RDFS Knowledge Bases (AAAI 2025 · similarity 0.86)
- Spectra of Cardinality Queries over Description Logic Knowledge Bases (AAAI 2025 · similarity 0.85)
- Stable Model Semantics for Description Logic Terminologies (AAAI 2024 · similarity 0.85)
- Consistent Query Answering over Existential Rules with Open and Closed Predicates (AAAI 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.