| Publication | Date of Publication | Type |
|---|
| Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\) | 2022-10-04 | Paper |
| Merging heterogeneous security orderings | 2022-08-16 | Paper |
| A false sense of security | 2022-08-11 | Paper |
| Confidentiality Policies and Their Enforcement for Controlled Query Evaluation | 2022-02-16 | Paper |
| Query answering in circumscribed OWL2 profiles | 2021-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994897 | 2021-06-22 | Paper |
| Rational closure for all description logics | 2019-08-28 | Paper |
| A sequent calculus for skeptical Default Logic | 2019-01-15 | Paper |
| Sequent calculi for default and autoepistemic logics | 2019-01-10 | Paper |
| On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\) | 2017-09-29 | Paper |
| Sequent calculi for propositional nonmonotonic logics | 2017-06-13 | Paper |
| Decidability of Circumscribed Description Logics Revisited | 2015-02-04 | Paper |
| Auctions for Partial Heterogeneous Preferences | 2013-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3112648 | 2012-01-12 | Paper |
| Towards a Mechanism for Incentivating Privacy | 2011-11-22 | Paper |
| A decidable subclass of finitary programs | 2010-08-19 | Paper |
| Answer Set Programming | 2010-07-20 | Paper |
| The Complexity of Circumscription in DLs | 2009-12-10 | Paper |
| Erratum to: ``Reasoning with infinite stable models | 2009-07-17 | Paper |
| On finitely recursive programs | 2009-04-15 | Paper |
| On Finitely Recursive Programs | 2009-03-05 | Paper |
| Composing Normal Programs with Function Symbols | 2009-01-22 | Paper |
| The Complexity of Enriched Mu-Calculi | 2008-11-13 | Paper |
| Nonmonotonic Description Logics – Requirements, Theory, and Implementations | 2008-01-04 | Paper |
| Controlled query evaluation with open queries for a decidable relational submodel | 2007-10-12 | Paper |
| Some Complexity Results on Fuzzy Description Logics | 2007-09-24 | Paper |
| The Complexity of Enriched μ-Calculi | 2007-09-11 | Paper |
| Foundations of Information and Knowledge Systems | 2007-02-12 | Paper |
| Logic Programming | 2006-06-27 | Paper |
| Reasoning with infinite stable models | 2006-02-07 | Paper |
| On the undecidability of logics with converse, nominals, recursion and counting | 2006-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4812969 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472209 | 2004-08-04 | Paper |
| Controlled query evaluation for known policies by combining lying and refusal | 2004-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708908 | 2003-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4800167 | 2003-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4800161 | 2003-04-02 | Paper |
| Secure agents | 2003-03-10 | Paper |
| Resolution for skeptical stable model semantics | 2002-04-11 | Paper |
| Lying versus refusal for known potential secrets | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218925 | 1999-04-08 | Paper |
| Querying disjunctive databases through nonmonotonic logics | 1997-02-27 | Paper |
| A Three-valued Formalization of Provability | 1995-09-11 | Paper |
| Autoepistemic logics as a unifying framework for the semantics of logic programs | 1995-07-19 | Paper |
| Autoepistemic logic programming | 1995-02-22 | Paper |
