activity
20022023
most citedRedundancy in Logic I: CNF Propositional Formulae

94 citations · 246 across the 28 of their papers we have counts for

collaborators
Showing cs.AIShow all

19 papers · 1 filter

cs.AI2023

Representing states in iterated belief revision

Paolo Liberatore

Iterated belief revision requires information about the current beliefs. This information is represented by mathematical structures called doxastic states. Most literature concentr…

cs.AI2021

On Mixed Iterated Revisions

Paolo Liberatore

Several forms of iterable belief change exist, differing in the kind of change and its strength: some operators introduce formulae, others remove them; some add formulae unconditio…

cs.AI2021

Merging with unknown reliability

Paolo Liberatore

Merging beliefs depends on the relative reliability of their sources. When unknown, assuming equal reliability is unwarranted. The solution proposed in this article is that every r…

cs.AI2020

Reconstructing a single-head formula to facilitate logical forgetting

Paolo Liberatore

Logical forgetting may take exponential time in general, but it does not when its input is a single-head propositional definite Horn formula. Single-head means that no variable is…

cs.AI2020★ 3 cited

One head is better than two: a polynomial restriction for propositional definite Horn forgetting

Paolo Liberatore

Logical forgetting is \np-complete even in the simple case of propositional Horn formulae, and may exponentially increase their size. A way to forget is to replace each variable to…

cs.AI2016★ 2 cited

Belief Merging by Source Reliability Assessment

Paolo Liberatore

Merging beliefs requires the plausibility of the sources of the information to be merged. They are typically assumed equally reliable in lack of hints indicating otherwise; yet, a…