F
Franz Baader
Researcher at Dresden University of Technology
Publications - 348
Citations - 25077
Franz Baader is an academic researcher from Dresden University of Technology. The author has contributed to research in topics: Description logic & Decidability. The author has an hindex of 62, co-authored 334 publications receiving 24544 citations. Previous affiliations of Franz Baader include University of Erlangen-Nuremberg & Max Planck Society.
Papers
More filters
Journal Article
Combining decision procedures for positive theories sharing constructors
Franz Baader,Cesare Tinelli +1 more
TL;DR: This paper addresses the following combination problem: given two equational theories E1 and E2 whose positive theories are decidable, how can one obtain a decision procedure for the positive theory of E1 ?
Proceedings Article
SAT encoding of unification in EL
Franz Baader,Barbara Morawska +1 more
TL;DR: In this paper, a reduction to satisfiability in propositional logic (SAT) is proposed to solve EL unification problems, which is based on the reduction to SAT solvers.
Book ChapterDOI
Combining Equational Theories Sharing Non-Collapse-Free Constructors
Franz Baader,Cesare Tinelli +1 more
TL;DR: The applicability of the combination method for decision procedures for the word problem is extended to theories sharing non-collapse-free constructors, for example in the direction of equational theories axiomatizing the equivalence of modal formulae.
Proceedings Article
Ontology-based monitoring of dynamic systems
TL;DR: Some of the recent work that can be seen as instances of this general framework of ontology-based monitoring of dynamic systems are reviewed and possible extensions towards probabilistic reasoning and the integration of mathematical modeling of dynamical systems are mentioned.
Proceedings ArticleDOI
Query Rewriting for DL-Lite with n-ary Concrete Domains
TL;DR: This work introduces restrictions on these predicates and on the ontology language that allow us to reduce OBQA to query answering in databases using the so-called combined rewriting approach, and shows that the results strictly subsume some of the existing first-order rewritability results for unary predicates.