A Mechanism for Ontology Confidentiality. - Piero A. Bonatti; Luigi Sauro; Iliana M. Petrova (CILC, 2014)

Optimized Construction of Secure Knowledge-Base Views. - Piero A. Bonatti; Iliana M. Petrova; Luigi Sauro (Description Logics, 2015)

Optimizing the Computation of Overriding. - Piero A. Bonatti; Iliana Mineva Petrova; Luigi Sauro (ISWC (1), 2015)

A new semantics for overriding in description logics. - Piero A. Bonatti; Marco Faella; Iliana M. Petrova; Luigi Sauro (Artif. Intell., 2015)

A New Semantics for Overriding in Description Logics (Extended Abstract). - Piero A. Bonatti; Marco Faella; Iliana M. Petrova; Luigi Sauro (IJCAI, 2017)

Optimization of Nonstandard Reasoning Services. - Iliana Mineva Petrova (2017)

A Richer Policy Language for GDPR Compliance. - Piero A. Bonatti; Iliana M. Petrova; Luigi Sauro (Description Logics, 2019)

Real-time reasoning in OWL2 for GDPR compliance. - Piero A. Bonatti; Luca Ioffredo; Iliana M. Petrova; Luigi Sauro; Ida Sri Rejeki Siahaan (Artif. Intell., 2020)

Fast Compliance Checking with General Vocabularies. - Piero A. Bonatti; Luca Ioffredo; Iliana M. Petrova; Luigi Sauro (CoRR, 2020)

Defeasible reasoning in Description Logics: an overview on DLN. - Piero A. Bonatti; Iliana M. Petrova; Luigi Sauro (CoRR, 2020)

Machine Understandable Policies and GDPR Compliance Checking. - Piero A. Bonatti; Sabrina Kirrane; Iliana M. Petrova; Luigi Sauro (Künstliche Intell., 2020)

Defeasible Reasoning in Description Logics: An Overview on DLN. - Piero Andrea Bonatti; Iliana Mineva Petrova; Luigi Sauro (Applications and Practices in Ontology Design, Extraction, and Reasoning, 2020)

Optimizing the computation of overriding in DLN. - Piero Andrea Bonatti; Iliana Mineva Petrova; Luigi Sauro (Artif. Intell., 2022)

Optimizing the Computation of Overriding in DLN (Extended Abstract). - Piero A. Bonatti; Iliana M. Petrova; Luigi Sauro (IJCAI, 2023)

Effective and fast module extraction for nonempty ABoxes. - Piero Andrea Bonatti; Francesco Magliocca; Iliana Mineva Petrova; Luigi Sauro (Artif. Intell., 2025)