3 citations · 8 across the 16 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
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…