Work

Description Logics with Abstraction and Refinement: From ALC to EL

Year: 2024

Type: conference-paper

Abstract: We study extensions of description logics from the widely used EL family with operators that make it possible to speak about different levels of abstraction. We analyze the computational complexity of reasoning and show that often, this complexity is significantly lower than in the corresponding extension of the more expressive description logic ALC. By slightly varying the semantics, we also obtain a case that admits reasoning in polynomial time.

DOI: 10.24963/kr.2024/51

Authors: Carsten Lutz, Lukas Schulze

Institutions: Leipzig University, Center for Scalable Data Analytics and Artificial Intelligence

Language: English

Topic: Logic, Reasoning, and Knowledge

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Funders: Deutscher Akademischer Austauschdienst, Deutsche Forschungsgemeinschaft, Bundesministerium für Bildung und Forschung, Universität Bremen

Awards: G4712284355, G6098565189, SFB 1320: Wissenschaft der Alltagsaktivitäten – Analytische und generative Modellierung

OpenAlex ID: W4403792848