| Publication | Date of Publication | Type |
|---|
Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\)
Artificial Intelligence | 2022-10-04 | Paper |
Merging heterogeneous security orderings
Computer Security — ESORICS 96 | 2022-08-16 | Paper |
A false sense of security
Artificial Intelligence | 2022-08-11 | Paper |
Confidentiality policies and their enforcement for controlled query evaluation
Computer Security — ESORICS 2002 | 2022-02-16 | Paper |
Query answering in circumscribed OWL2 profiles
Annals of Mathematics and Artificial Intelligence | 2021-12-17 | Paper |
Partial preferences for mediated bargaining
| 2021-06-22 | Paper |
Rational closure for all description logics
Artificial Intelligence | 2019-08-28 | Paper |
A sequent calculus for skeptical Default Logic
Lecture Notes in Computer Science | 2019-01-15 | Paper |
Sequent calculi for default and autoepistemic logics
Theorem Proving with Analytic Tableaux and Related Methods | 2019-01-10 | Paper |
On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\)
Artificial Intelligence | 2017-09-29 | Paper |
Sequent calculi for propositional nonmonotonic logics
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
Decidability of circumscribed description logics revisited
Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation | 2015-02-04 | Paper |
Auctions for partial heterogeneous preferences
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Defeasible inclusions in low-complexity DLs
| 2012-01-12 | Paper |
Towards a mechanism for incentivating privacy
Computer Security – ESORICS 2011 | 2011-11-22 | Paper |
A decidable subclass of finitary programs
Theory and Practice of Logic Programming | 2010-08-19 | Paper |
Answer set programming
Lecture Notes in Computer Science | 2010-07-20 | Paper |
The complexity of circumscription in DLs
Journal of Artificial Intelligence Research | 2009-12-10 | Paper |
Erratum to: ``Reasoning with infinite stable models
Artificial Intelligence | 2009-07-17 | Paper |
On finitely recursive programs
Theory and Practice of Logic Programming | 2009-04-15 | Paper |
On Finitely Recursive Programs
Logic Programming | 2009-03-05 | Paper |
Composing Normal Programs with Function Symbols
Logic Programming | 2009-01-22 | Paper |
The Complexity of Enriched Mu-Calculi
Logical Methods in Computer Science | 2008-11-13 | Paper |
Nonmonotonic Description Logics – Requirements, Theory, and Implementations
Lecture Notes in Computer Science | 2008-01-04 | Paper |
Controlled query evaluation with open queries for a decidable relational submodel
Annals of Mathematics and Artificial Intelligence | 2007-10-12 | Paper |
Some Complexity Results on Fuzzy Description Logics
Fuzzy Logic and Applications | 2007-09-24 | Paper |
The Complexity of Enriched μ-Calculi
Automata, Languages and Programming | 2007-09-11 | Paper |
Foundations of Information and Knowledge Systems
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Logic Programming
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Reasoning with infinite stable models
Artificial Intelligence | 2006-02-07 | Paper |
On the undecidability of logics with converse, nominals, recursion and counting
Artificial Intelligence | 2006-02-07 | Paper |
scientific article; zbMATH DE number 2090537 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2080022 (Why is no real title available?)
| 2004-08-04 | Paper |
Controlled query evaluation for known policies by combining lying and refusal
Annals of Mathematics and Artificial Intelligence | 2004-03-15 | Paper |
scientific article; zbMATH DE number 1931650 (Why is no real title available?)
| 2003-06-20 | Paper |
scientific article; zbMATH DE number 1890624 (Why is no real title available?)
| 2003-05-21 | Paper |
scientific article; zbMATH DE number 1890618 (Why is no real title available?)
| 2003-04-02 | Paper |
Secure agents
Annals of Mathematics and Artificial Intelligence | 2003-03-10 | Paper |
Resolution for skeptical stable model semantics
Journal of Automated Reasoning | 2002-04-11 | Paper |
Lying versus refusal for known potential secrets
Data & Knowledge Engineering | 2001-08-20 | Paper |
scientific article; zbMATH DE number 1223614 (Why is no real title available?)
| 1999-04-08 | Paper |
Querying disjunctive databases through nonmonotonic logics
Theoretical Computer Science | 1997-02-27 | Paper |
A Three-valued Formalization of Provability
Journal Of Logic And Computation | 1995-09-11 | Paper |
Autoepistemic logics as a unifying framework for the semantics of logic programs
The Journal of Logic Programming | 1995-07-19 | Paper |
Autoepistemic logic programming
Journal of Automated Reasoning | 1995-02-22 | Paper |
