| Publication | Date of Publication | Type |
|---|
| When is ontology-mediated querying efficient? | 2024-12-19 | Paper |
Answer Counting under Guarded TGDs
Logical Methods in Computer Science | 2023-10-23 | Paper |
On the non-efficient PAC learnability of conjunctive queries
Information Processing Letters | 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
Artificial Intelligence | 2022-11-08 | Paper |
A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\)
Artificial Intelligence | 2022-06-01 | Paper |
Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
ACM Transactions on Database Systems | 2021-11-25 | Paper |
Weighted model counting beyond two-variable logic
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Dichotomies in Ontology-Mediated Querying with the Guarded Fragment
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
| A tour of Franz Baader's contributions to knowledge representation and automated deduction | 2020-06-04 | Paper |
The data complexity of ontology-mediated queries with closed predicates
(available as arXiv preprint) | 2019-09-13 | Paper |
Query inseparability for \(\mathcal{ALC}\) ontologies
Artificial Intelligence | 2019-08-28 | Paper |
Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
(available as arXiv preprint) | 2019-05-24 | Paper |
| Exact learning of lightweight description logic ontologies | 2018-11-22 | Paper |
Exact learning of lightweight description logic ontologies
(available as arXiv preprint) | 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 |
The data complexity of description logic ontologies
(available as arXiv preprint) | 2017-12-11 | Paper |
NExpTime-complete description logics with concrete domains
ACM Transactions on Computational Logic | 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
Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering | 2017-03-30 | Paper |
Probabilistic description logics for subjective uncertainty
Journal of Artificial Intelligence Research | 2017-01-11 | Paper |
Query and predicate emptiness in ontology-based data access
The Journal of Artificial Intelligence Research (JAIR) | 2016-05-11 | Paper |
| Complexity of branching temporal description logics | 2015-12-11 | Paper |
The complexity of query containment in expressive fragments of XPath 2.0
Journal of the ACM | 2015-11-11 | Paper |
LTL over description logic axioms
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Model-theoretic inseparability and modularity of description logic ontologies
Artificial Intelligence | 2015-06-26 | Paper |
Decidability of circumscribed description logics revisited
Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation | 2015-02-04 | Paper |
Monodic fragments of probabilistic first-order logic
Automata, Languages, and Programming | 2014-07-01 | Paper |
Foundations of instance level updates in expressive description logics
Artificial Intelligence | 2012-05-23 | Paper |
| Enriching \(\mathcal {EL}\)-concepts with greatest fixpoints | 2011-05-11 | Paper |
The complexity of finite model reasoning in description logics.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
A tableau algorithm for reasoning about concepts and similarity
Lecture Notes in Computer Science | 2010-03-09 | Paper |
| scientific article; zbMATH DE number 5674817 (Why is no real title available?) | 2010-02-24 | Paper |
The complexity of circumscription in DLs
Journal of Artificial Intelligence Research | 2009-12-10 | Paper |
Deciding inseparability and conservative extensions in the description logic
Journal of Symbolic Computation | 2009-12-03 | Paper |
PDL with negation of atomic programs
Journal of Applied Non-Classical Logics | 2009-11-30 | Paper |
A Correspondence between Temporal Description Logics
Journal of Applied Non-Classical Logics | 2009-11-11 | Paper |
Query Answering in Description Logics: The Knots Approach
Logic, Language, Information and Computation | 2009-07-02 | Paper |
Mathematical Logic for Life Science Ontologies
Logic, Language, Information and Computation | 2009-07-02 | Paper |
Formal Properties of Modularisation
Lecture Notes in Computer Science | 2009-06-09 | Paper |
PDL with intersection and converse: satisfiability and infinite-state model checking
Journal of Symbolic Logic | 2009-03-25 | Paper |
Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$
Automated Deduction – CADE-21 | 2009-03-06 | Paper |
The Complexity of Conjunctive Query Answering in Expressive Description Logics
Automated Reasoning | 2008-11-27 | Paper |
The Complexity of Enriched Mu-Calculi
Logical Methods in Computer Science | 2008-11-13 | Paper |
Reasoning About Actions Using Description Logics with General TBoxes
Logics in Artificial Intelligence | 2008-10-30 | Paper |
| Conservative extensions in modal logic | 2008-07-01 | Paper |
Data Complexity in the $\mathcal{EL}$ Family of Description Logics
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
Modal Logics of Topological Relations
Logical Methods in Computer Science | 2007-10-11 | Paper |
Automated Reasoning
Lecture Notes in Computer Science | 2007-09-25 | Paper |
The Complexity of Enriched μ-Calculi
Automata, Languages and Programming | 2007-09-11 | Paper |
PDL with Intersection and Converse Is 2EXP-Complete
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
Propositional dynamic logic with recursive programs
The Journal of Logic and Algebraic Programming | 2007-08-23 | Paper |
A tableau algorithm for description logics with concrete domains and general TBoxes
Journal of Automated Reasoning | 2007-05-04 | Paper |
ATL Satisfiability is Indeed EXPTIME-complete
Journal Of Logic And Computation | 2007-04-13 | Paper |
Quantitative temporal logics over the reals: PSpace and below
Information and Computation | 2007-02-19 | Paper |
KI 2005: Advances in Artificial Intelligence
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2006-11-01 | Paper |
2-Exp Time lower bounds for propositional dynamic logics with intersection
Journal of Symbolic Logic | 2006-09-06 | Paper |
Automated Reasoning with Analytic Tableaux and Related Methods
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Combining interval-based temporal reasoning with general TBoxes
Artificial Intelligence | 2006-02-07 | Paper |
\({\mathcal E}\)-connections of abstract description systems
Artificial Intelligence | 2006-02-07 | Paper |
| scientific article; zbMATH DE number 2196595 (Why is no real title available?) | 2005-08-22 | Paper |
The complexity of finite model reasoning in description logics
Information and Computation | 2005-08-05 | Paper |
Temporalising tableaux
Studia Logica | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2063024 (Why is no real title available?) | 2004-03-29 | Paper |
| scientific article; zbMATH DE number 1989660 (Why is no real title available?) | 2003-10-09 | Paper |
PSpace Reasoning with the Description Logic ALCF(D)
Logic Journal of the IGPL | 2003-05-05 | Paper |
A tableau decision algorithm for modalized \(\mathcal A\mathcal L\mathcal C\) with constant domains
Studia Logica | 2003-03-12 | Paper |
| scientific article; zbMATH DE number 1841824 (Why is no real title available?) | 2002-12-04 | Paper |
| scientific article; zbMATH DE number 1765661 (Why is no real title available?) | 2002-07-10 | Paper |
| scientific article; zbMATH DE number 1765666 (Why is no real title available?) | 2002-07-10 | Paper |
| scientific article; zbMATH DE number 1753135 (Why is no real title available?) | 2002-06-10 | Paper |
A description logic with concrete domains and a role-forming predicate operator
Journal Of Logic And Computation | 2000-07-24 | Paper |
| scientific article; zbMATH DE number 1405451 (Why is no real title available?) | 2000-02-23 | Paper |
