94 citations · 246 across the 28 of their papers we have counts for
28 papers
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…
Abductive forgetting
Paolo Liberatore
Abductive forgetting is removing variables from a logical formula while maintaining its abductive explanations. It is carried in two alternative ways depending on its intended appl…
Superredundancy: A tool for Boolean formula minimization complexity analysis
Paolo Liberatore
A superredundant clause is a clause that is redundant in the resolution closure of a formula. The converse concept of superirredundancy ensures membership of the clause in all mini…
Four algorithms for propositional forgetting
Paolo Liberatore
Four algorithms for propositional forgetting are compared. The first performs all possible resolutions and deletes the clauses containing a variable to forget. The second forgets a…
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…
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…