56 citations · 99 across the 11 of their papers we have counts for
13 papers
Towards Computer-Using Personal Agents
Piero A. Bonatti, John Domingue, Anna Lisa Gentile +9
Computer-Using Agents (CUA) enable users to automate increasingly-complex tasks using graphical interfaces such as browsers. As many potential tasks require personal data, we propo…
Defeasible reasoning in Description Logics: an overview on DL^N
Piero A. Bonatti, Iliana M. Petrova, Luigi Sauro
DL^N is a recent approach that extends description logics with defeasible reasoning capabilities. In this paper we provide an overview on DL^N, illustrating the underlying knowledg…
Machine Understandable Policies and GDPR Compliance Checking
Piero A. Bonatti, Sabrina Kirrane, Iliana M. Petrova +1
The European General Data Protection Regulation (GDPR) calls for technical and organizational measures to support its implementation. Towards this end, the SPECIAL H2020 project ai…
Real Time Reasoning in OWL2 for GDPR Compliance
P. A. Bonatti, L. Ioffredo, I. Petrova +2
This paper shows how knowledge representation and reasoning techniques can be used to support organizations in complying with the GDPR, that is, the new European data protection re…
The SPECIAL-K Personal Data Processing Transparency and Compliance Platform
Sabrina Kirrane, Javier D. Fernández, Piero Bonatti +3
The European General Data Protection Regulation (GDPR) brings new challenges for companies who must ensure they have an appropriate legal basis for processing personal data and mus…
Optimizing the computation of overriding
Piero Andrea Bonatti, Iliana Mineva Petrova, Luigi Sauro
We introduce optimization techniques for reasoning in DLN---a recently introduced family of nonmonotonic description logics whose characterizing features appear well-suited to mode…
Partial Preferences for Mediated Bargaining
Piero A. Bonatti, Marco Faella, Luigi Sauro
In this work we generalize standard Decision Theory by assuming that two outcomes can also be incomparable. Two motivating scenarios show how incomparability may be helpful to repr…
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…
A decidable subclass of finitary programs
Sabrina Baselice, Piero A. Bonatti
Answer set programming - the most popular problem solving paradigm based on logic programs - has been recently extended to support uninterpreted function symbols. All of these appr…
On finitely recursive programs
Sabrina Baselice, Piero A. Bonatti, Giovanni Criscuolo
Disjunctive finitary programs are a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties, for example ground…
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…
Abduction, ASP and Open Logic Programs
Piero A. Bonatti
Open logic programs and open entailment have been recently proposed as an abstract framework for the verification of incomplete specifications based upon normal logic programs and…