56 citations · 99 across the 11 of their papers we have counts for
3 papers · 1 filter
Defeasible Inclusions in Low-Complexity DLs
Piero A. Bonatti, Marco Faella, Luigi Sauro
Some of the applications of OWL and RDF (e.g. biomedical knowledge representation and semantic policy formulation) call for extensions of these languages with nonmonotonic construc…
The Complexity of Circumscription in DLs
Piero A. Bonatti, Carsten Lutz, Frank Wolter
As fragments of first-order logic, Description logics (DLs) do not provide nonmonotonic features such as defeasible inheritance and default rules. Since many applications would ben…
The Complexity of Enriched Mu-Calculi
Piero A. Bonatti, Carsten Lutz, Aniello Murano +1
The fully enriched μ-calculus is the extension of the propositional μ-calculus with inverse programs, graded modalities, and nominals. While satisfiability in several express…