research
∙
05/16/2023
Can we forget how we learned? Representing states in iterated belief revision
The three most common representations of states in iterated belief revis...
share
research
∙
09/26/2022
Abductive forgetting
Abductive forgetting is removing variables from a logical formula while ...
research
∙
05/02/2022
Superredundancy: A tool for Boolean formula minimization complexity analysis
A superredundant clause is a clause that is redundant in the resolution ...
research
∙
04/13/2022
Four algorithms for propositional forgetting
Four algorithms for propositional forgetting are compared. The first per...
research
∙
04/08/2021
On Mixed Iterated Revisions
Several forms of iterable belief change exist, differing in the kind of ...
research
∙
01/07/2021
Merging with unknown reliability
Merging beliefs depends on the relative reliability of their sources. Wh...
research
∙
12/18/2020
Reconstructing a single-head formula to facilitate logical forgetting
Logical forgetting may take exponential time in general, but it does not...
research
∙
09/16/2020
One head is better than two: a polynomial restriction for propositional definite Horn forgetting
Logical forgetting is NP-complete even in the simple case of proposition...
research
∙
06/19/2020
Common equivalence and size after forgetting
Forgetting variables from a propositional formula may increase its size....
research
∙
05/08/2020
The ghosts of forgotten things: A study on size after forgetting
Forgetting is removing variables from a logical formula while preserving...
research
∙
09/18/2014
Belief revision by examples
A common assumption in belief revision is that the reliability of the in...
research
∙
04/26/2012
On the Complexity of Finding Second-Best Abductive Explanations
While looking for abductive explanations of a given set of manifestation...
research
∙
12/14/2010
On the size of data structures used in symbolic model checking
Temporal Logic Model Checking is a verification method in which we descr...
research
∙
11/22/2002
Redundancy in Logic I: CNF Propositional Formulae
A knowledge base is redundant if it contains parts that can be inferred ...
research
∙
10/09/2002