activity
20042024
most citedFusions of Description Logics and Abstract Description Systems

24 citations · 50 across the 7 of their papers we have counts for

collaborators
Showing cs.LOShow all

6 papers · 1 filter

cs.LO20231 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.LO20221 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.LO202011 cited

Finding Small Proofs for Description Logic Entailments: Theory and Practice (Extended Technical Report)

Christian Alrabbaa, Franz Baader, Stefan Borgwardt +2

Logic-based approaches to AI have the advantage that their behaviour can in principle be explained by providing their users with proofs for the derived consequences. However, if su…

cs.LO202013 cited

Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints

Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph

We introduce and investigate the expressive description logic (DL) ALCSCC++, in which the global and local cardinality constraints introduced in previous papers can be mixed. On th…

cs.LO2018

Repairing Description Logic Ontologies by Weakening Axioms

Franz Baader, Francesco Kriegel, Adrian Nuradiansyah +1

The classical approach for repairing a Description Logic ontology O in the sense of removing an unwanted consequence is to delete a minimal number of axioms from O such that th…

cs.LO2004

The Inverse Method Implements the Automata Approach for Modal Satisfiability

Franz Baader, Stephan Tobies

Tableaux-based decision procedures for satisfiability of modal and description logics behave quite well in practice, but it is sometimes hard to obtain exact worst-case complexity…