activity
20152025
most citedExtending Unification in to Disunification: The Case of Dismatching and Local Disunification

3 citations · 8 across the 16 of their papers we have counts for

collaborators

16 papers

cs.LO2025

The Shape of Proofs: A Tale of Three Calculi (Extended Version)

Christian Alrabbaa, Stefan Borgwardt, Philipp Herrmann +1

Consequence-based reasoning can be used to construct proofs that explain entailments of description logic (DL) ontologies. In the literature, one can find multiple consequence-base…

cs.LO2025

Concrete Domains Meet Expressive Cardinality Restrictions in Description Logics (Extended Version)

Franz Baader, Stefan Borgwardt, Filippo De Bortoli +1

Standard Description Logics (DLs) can encode quantitative aspects of an application domain through either number restrictions, which constrain the number of individuals that are in…

cs.LO2024

The Precise Complexity of Reasoning in with -Admissible Concrete Domains (Extended Version)

Stefan Borgwardt, Filippo De Bortoli, Patrick Koopmann

Concrete domains have been introduced in the context of Description Logics to allow references to qualitative and quantitative values. In particular, the class of -admissible co…

cs.SC2024

Solving unification in the description logic

Barbara Morawska, Dariusz Marzec

We present an algorithm for solving the unification problem in the description logic . This logic extends with the bottom constructor, and thus…

cs.AI2023

Why Not? Explaining Missing Entailments with Evee (Technical Report)

Christian Alrabbaa, Stefan Borgwardt, Tom Friese +2

Understanding logical entailments derived by a description logic reasoner is not always straight-forward for ontology users. For this reason, various methods for explaining entailm…

cs.LO2023★ 1 cited

Combining Proofs for Description Logic and Concrete Domain Reasoning (Technical Report)

Christian Alrabbaa, Franz Baader, Stefan Borgwardt +2

Logic-based approaches to AI have the advantage that their behavior can in principle be explained with the help of proofs of the computed consequences. For ontologies based on Desc…

cs.LO2022★ 1 cited

Explaining Ontology-Mediated Query Answers using Proofs over Universal Models (Technical Report)

Christian Alrabbaa, Stefan Borgwardt, Patrick Koopmann +1

In ontology-mediated query answering, access to incomplete data sources is mediated by a conceptual layer constituted by an ontology, which can be formulated in a description logic…

cs.LO2022

On the Eve of True Explainability for OWL Ontologies: Description Logic Proofs with Evee and Evonne (Extended Version)

Christian Alrabbaa, Stefan Borgwardt, Tom Friese +3

When working with description logic ontologies, understanding entailments derived by a description logic reasoner is not always straightforward. So far, the standard ontology edito…

cs.DB2022

Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies (Technical Report)

Christian Alrabbaa, Stefan Borgwardt, Patrick Koopmann +1

In ontology-mediated query answering, access to incomplete data sources is mediated by a conceptual layer constituted by an ontology. To correctly compute answers to queries, it is…

cs.LO2022★ 1 cited

Evonne: Interactive Proof Visualization for Description Logics (System Description) -- Extended Version

Christian Alrabbaa, Franz Baader, Stefan Borgwardt +3

Explanations for description logic (DL) entailments provide important support for the maintenance of large ontologies. The "justifications" usually employed for this purpose in ont…

cs.AI2022

Expressivity of Planning with Horn Description Logic Ontologies (Technical Report)

Stefan Borgwardt, Jörg Hoffmann, Alisa Kovtunova +3

State constraints in AI Planning globally restrict the legal environment states. Standard planning languages make closed-domain and closed-world assumptions. Here we address open-w…

cs.DB2021★ 1 cited

Temporal Minimal-World Semantics for Sparse ABoxes

Stefan Borgwardt, Walter Forkel, Alisa Kovtunova

Ontology-mediated query answering is a popular paradigm for enriching answers to user queries with background knowledge. For querying the absence of information, however, there exi…

cs.AI2021★ 1 cited

Finding Good Proofs for Description Logic Entailments Using Recursive Quality Measures (Extended Technical Report)

Christian Alrabbaa, Franz Baader, Stefan Borgwardt +2

Logic-based approaches to AI have the advantage that their behavior can in principle be explained to a user. If, for instance, a Description Logic reasoner derives a consequence th…

cs.LO2016★ 3 cited

Extending Unification in to Disunification: The Case of Dismatching and Local Disunification

Franz Baader, Stefan Borgwardt, Barbara Morawska

Unification in Description Logics has been introduced as a means to detect redundancies in ontologies. We try to extend the known decidability results for unification in the Descri…

cs.AI2015

Reasoning in Infinitely Valued G-IALCQ

Stefan Borgwardt, Rafael Peñaloza

Fuzzy Description Logics (FDLs) are logic-based formalisms used to represent and reason with vague or imprecise knowledge. It has been recently shown that reasoning in most FDLs us…

cs.LO2015

Answering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy Ontologies

Stefan Borgwardt, Theofilos Mailis, Rafael Peñaloza +1

Fuzzy Description Logics (DLs) provide a means for representing vague knowledge about an application domain. In this paper, we study fuzzy extensions of conjunctive queries (CQs) o…