Showing cs.LOShow all
3 papers · 1 filter
cs.LO2025
Why not? Developing ABox Abduction beyond Repairs
Anselm Haak, Patrick Koopmann, Yasir Mahmood +1
Abduction is the task of computing a sufficient extension of a knowledge base (KB) that entails a conclusion not entailed by the original KB. It serves to compute explanations, or…
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 c…