activity
20112026
most citedReasoning about Minimal Belief and Negation as Failure

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

collaborators
Showing cs.AIShow all

5 papers · 1 filter

cs.AI2026

Tractable Query Answering under Epistemic Confidentiality Policies in DL Ontologies (extended version)

Lorenzo Marconi, Daniela Rieti, Riccardo Rosati

We study Controlled Query Evaluation (CQE), a declarative approach to confidentiality-preserving data access, in the context of Description Logic (DL) ontologies, and for confident…

cs.AI2025

CQE under Epistemic Dependencies: Algorithms and Experiments (extended version)

Lorenzo Marconi, Flavia Ricci, Riccardo Rosati

We investigate Controlled Query Evaluation (CQE) over ontologies, where information disclosure is regulated by epistemic dependencies (EDs), a family of logical rules recently prop…

cs.AI2024

Controlled Query Evaluation through Epistemic Dependencies

Gianluca Cima, Domenico Lembo, Lorenzo Marconi +2

In this paper, we propose the use of epistemic dependencies to express data protection policies in Controlled Query Evaluation (CQE), which is a form of confidentiality-preserving…

cs.AI2024

Consistent Query Answering for Existential Rules with Closed Predicates

Lorenzo Marconi, Riccardo Rosati

Consistent Query Answering (CQA) is an inconsistency-tolerant approach to data access in knowledge bases and databases. The goal of CQA is to provide meaningful (consistent) answer…

cs.AI2011★ 15 cited

Reasoning about Minimal Belief and Negation as Failure

R. Rosati

We investigate the problem of reasoning in the propositional fragment of MBNF, the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered…