Fitting Description Logic Ontologies to ABox and Query Examples
Maurice Funk, Marvin Grosser, Carsten Lutz

TL;DR
This paper investigates the problem of finding description logic ontologies that fit given positive and negative examples of ABoxes and queries, providing complexity results for various logic and query types.
Contribution
It offers effective characterizations and complexity classifications for the ontology fitting problem in LC and LCI with different query languages.
Findings
Fitting problems are NP-complete for AQs and CQs.
Fitting problems are 2EXPTIME-complete for CQs and UCQs.
Results hold for both LC and LCI.
Abstract
We study a fitting problem inspired by ontology-mediated querying: given a collection of positive and negative examples of the form with an ABox and a Boolean query, we seek an ontology that satisfies for all positive examples and for all negative examples. We consider the description logics and as ontology languages and a range of query languages that includes atomic queries (AQs), conjunctive queries (CQs), and unions thereof (UCQs). For all of the resulting fitting problems, we provide effective characterizations and determine the computational complexity of deciding whether a fitting ontology exists. This problem turns out to be for AQs and full CQs and $2E{\scriptsize XP}T{\scriptsize…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies · Advanced Database Systems and Queries · Graph Theory and Algorithms
