| Publication | Date of Publication | Type |
|---|
| Answer Counting under Guarded TGDs | 2023-10-23 | Paper |
| On the non-efficient PAC learnability of conjunctive queries | 2023-10-12 | Paper |
| The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems | 2023-09-27 | Paper |
| Logical separability of labeled data examples under ontologies | 2022-11-08 | Paper |
| A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) | 2022-06-01 | Paper |
| Ontology-Based Data Access | 2021-11-25 | Paper |
| Weighted model counting beyond two-variable logic | 2021-01-20 | Paper |
| Dichotomies in Ontology-Mediated Querying with the Guarded Fragment | 2020-09-11 | Paper |
| A tour of Franz Baader's contributions to knowledge representation and automated deduction | 2020-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5232905 | 2019-09-13 | Paper |
| Query inseparability for \(\mathcal{ALC}\) ontologies | 2019-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5377468 | 2019-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4558528 | 2018-11-22 | Paper |
| Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk). | 2018-07-18 | Paper |
| Complexity and Expressive Power of Ontology-Mediated Queries (Invited Talk) | 2018-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4596784 | 2017-12-11 | Paper |
| NEXP TIME-complete description logics with concrete domains | 2017-07-12 | Paper |
| On the Relationship between Consistent Query Answering and Constraint Satisfaction Problems | 2017-06-13 | Paper |
| An Introduction to Description Logic | 2017-04-11 | Paper |
| Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey | 2017-03-30 | Paper |
| Probabilistic Description Logics for Subjective Uncertainty | 2017-01-11 | Paper |
| Query and Predicate Emptiness in Ontology-Based Data Access | 2016-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3457242 | 2015-12-11 | Paper |
| The complexity of query containment in expressive fragments of XPath 2.0 | 2015-11-11 | Paper |
| LTL over description logic axioms | 2015-09-17 | Paper |
| Model-theoretic inseparability and modularity of description logic ontologies | 2015-06-26 | Paper |
| Decidability of Circumscribed Description Logics Revisited | 2015-02-04 | Paper |
| Monodic Fragments of Probabilistic First-Order Logic | 2014-07-01 | Paper |
| Foundations of instance level updates in expressive description logics | 2012-05-23 | Paper |
| Enriching [Escr [Lscr ]-Concepts with Greatest Fixpoints] | 2011-05-11 | Paper |
| Automated Deduction – CADE-19 | 2010-04-20 | Paper |
| Automated Reasoning with Analytic Tableaux and Related Methods | 2010-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3408128 | 2010-02-24 | Paper |
| The Complexity of Circumscription in DLs | 2009-12-10 | Paper |
| Deciding inseparability and conservative extensions in the description logic | 2009-12-03 | Paper |
| PDL with negation of atomic programs | 2009-11-30 | Paper |
| A Correspondence between Temporal Description Logics | 2009-11-11 | Paper |
| Query Answering in Description Logics: The Knots Approach | 2009-07-02 | Paper |
| Mathematical Logic for Life Science Ontologies | 2009-07-02 | Paper |
| Formal Properties of Modularisation | 2009-06-09 | Paper |
| PDL with intersection and converse: satisfiability and infinite-state model checking | 2009-03-25 | Paper |
| Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$ | 2009-03-06 | Paper |
| The Complexity of Conjunctive Query Answering in Expressive Description Logics | 2008-11-27 | Paper |
| The Complexity of Enriched Mu-Calculi | 2008-11-13 | Paper |
| Reasoning About Actions Using Description Logics with General TBoxes | 2008-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3509053 | 2008-07-01 | Paper |
| Data Complexity in the $\mathcal{EL}$ Family of Description Logics | 2008-05-15 | Paper |
| Modal Logics of Topological Relations | 2007-10-11 | Paper |
| Automated Reasoning | 2007-09-25 | Paper |
| The Complexity of Enriched μ-Calculi | 2007-09-11 | Paper |
| PDL with Intersection and Converse Is 2EXP-Complete | 2007-09-07 | Paper |
| Propositional dynamic logic with recursive programs | 2007-08-23 | Paper |
| A tableau algorithm for description logics with concrete domains and general TBoxes | 2007-05-04 | Paper |
| ATL Satisfiability is Indeed EXPTIME-complete | 2007-04-13 | Paper |
| Quantitative temporal logics over the reals: PSpace and below | 2007-02-19 | Paper |
| KI 2005: Advances in Artificial Intelligence | 2006-11-13 | Paper |
| Computer Science Logic | 2006-11-01 | Paper |
| 2-Exp Time lower bounds for propositional dynamic logics with intersection | 2006-09-06 | Paper |
| Automated Reasoning with Analytic Tableaux and Related Methods | 2006-07-07 | Paper |
| Combining interval-based temporal reasoning with general TBoxes | 2006-02-07 | Paper |
| \({\mathcal E}\)-connections of abstract description systems | 2006-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465445 | 2005-08-22 | Paper |
| The complexity of finite model reasoning in description logics | 2005-08-05 | Paper |
| Temporalising tableaux | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460678 | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430407 | 2003-10-09 | Paper |
| PSpace Reasoning with the Description Logic ALCF(D) | 2003-05-05 | Paper |
| A tableau decision algorithm for modalized \(\mathcal A\mathcal L\mathcal C\) with constant domains | 2003-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783312 | 2002-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4539597 | 2002-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4539602 | 2002-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4533343 | 2002-06-10 | Paper |
| A description logic with concrete domains and a role-forming predicate operator | 2000-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938425 | 2000-02-23 | Paper |
