activity
20022020
most citedOptimizing the computation of overriding

6 citations · 13 across the 5 of their papers we have counts for

collaborators

6 papers

cs.AI2020

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…

cs.CY2020

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…

cs.AI20201 cited

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…

cs.AI20156 cited

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…

cs.AI20093 cited

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…

cs.AI20023 cited

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…