Search Results for author:
Found 15 papers, 4 papers with code
Can we forget how we learned? Doxastic redundancy in iterated belief revision
In terms of iterated belief revision, a specific revision may become irrelevant in presence of others.
Natural revision is contingently-conditionalized revision
Natural revision seems so natural: it changes beliefs as little as possible to incorporate new information.
Representing states in iterated belief revision
In particular, the explicit representation (an enumeration of the current beliefs) is the more wasteful on space.
Abductive forgetting
Differently from that, abductive forgetting from a propositional formula may not be expressed by any propositional formula.
Superredundancy: A tool for Boolean formula minimization complexity analysis
The converse concept of superirredundancy ensures membership of the clause in all minimal CNF formulae that are equivalent to the given one.
Four algorithms for propositional forgetting
The first performs all possible resolutions and deletes the clauses containing a variable to forget.
On Mixed Iterated Revisions
The ten operators considered in this article are shown to be all reducible to three: lexicographic revision, refinement and severe withdrawal.
Merging with unknown reliability
Merging beliefs depends on the relative reliability of their sources.
Reconstructing a single-head formula to facilitate logical forgetting
Logical forgetting may take exponential time in general, but it does not when its input is a single-head propositional definite Horn formula.
One head is better than two: a polynomial restriction for propositional definite Horn forgetting
They are sufficient when the formula is inequivalent: it makes two sets of variables equivalent only if they are also equivalent to their intersection.
Common equivalence and size after forgetting
Forgetting variables from a propositional formula may increase its size.
The ghosts of forgotten things: A study on size after forgetting
Forgetting is removing variables from a logical formula while preserving the constraints on the other variables.
Belief Merging by Source Reliability Assessment
In such cases, the reliability ordering assumed in the first place can be excluded from consideration.
Belief revision by examples
A common assumption in belief revision is that the reliability of the information sources is either given, derived from temporal information, or the same for all.
On the Complexity of Finding Second-Best Abductive Explanations
While looking for abductive explanations of a given set of manifestations, an ordering between possible solutions is often assumed.
