Improvement operators is a family of belief change operators that is a generalization of usual iterated belief revision operators. The idea is to relax the success property, so th...
We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resource-sensitive nature, linear l...
Ontologies can be used to provide an enriched vocabulary for the formulation of queries over instance data. We identify query emptiness and predicate emptiness as two central reas...
Franz Baader, Meghyn Bienvenu, Carsten Lutz, Frank...
If compliance with a norm does not achieve its purpose, then its applicability must dynamically be restricted or expanded. Legal interpretation is a mechanism from law allowing no...
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have be...
We present a decidable class of first-order formulas in the general theory of stable models that can be instantiated even in the presence of function constants. The notion of an ...
In this paper, I defend a multiplicative approach that distinguishes statues from amounts of matter, political entities from physical ones, qua entities (e.g. John qua Alitalia pa...