3 papers
cs.SC2025
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.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…