Ontologies often require knowledge representation on multiple
levels of abstraction, but description logics (DLs) are not
well-equipped for supporting this. We propose an extension of
DLs in which abstraction levels are first-class citizens and
which provides explicit operators for the abstraction and
refinement of concepts and roles across multiple abstraction
levels, based on conjunctive queries. We prove that reasoning
in the resulting family of DLs is decidable while several
seemingly harmless variations turn out to be undecidable. We
also pinpoint the precise complexity of our logics and
several relevant fragments.
%0 Journal Article
%1 Lutz2023-ob
%A Lutz, Carsten
%A Schulze, Lukas
%D 2023
%I arXiv
%J arXiv cs.AI
%K Abstraction Description Logics Refinement
%T Description Logics with Abstraction and Refinement
%X Ontologies often require knowledge representation on multiple
levels of abstraction, but description logics (DLs) are not
well-equipped for supporting this. We propose an extension of
DLs in which abstraction levels are first-class citizens and
which provides explicit operators for the abstraction and
refinement of concepts and roles across multiple abstraction
levels, based on conjunctive queries. We prove that reasoning
in the resulting family of DLs is decidable while several
seemingly harmless variations turn out to be undecidable. We
also pinpoint the precise complexity of our logics and
several relevant fragments.
@article{Lutz2023-ob,
abstract = {Ontologies often require knowledge representation on multiple
levels of abstraction, but description logics (DLs) are not
well-equipped for supporting this. We propose an extension of
DLs in which abstraction levels are first-class citizens and
which provides explicit operators for the abstraction and
refinement of concepts and roles across multiple abstraction
levels, based on conjunctive queries. We prove that reasoning
in the resulting family of DLs is decidable while several
seemingly harmless variations turn out to be undecidable. We
also pinpoint the precise complexity of our logics and
several relevant fragments.},
added-at = {2025-01-07T14:22:29.000+0100},
author = {Lutz, Carsten and Schulze, Lukas},
biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/2ed257ace626bf69f710c29a4e836ddbc/scadsfct},
interhash = {655a32932b75c5519deb1073d72e2ad1},
intrahash = {ed257ace626bf69f710c29a4e836ddbc},
journal = {arXiv [cs.AI]},
keywords = {Abstraction Description Logics Refinement},
primaryclass = {cs.AI},
publisher = {arXiv},
timestamp = {2025-01-07T14:22:29.000+0100},
title = {Description Logics with Abstraction and Refinement},
year = 2023
}