Common equivalence and size after forgetting

06/19/2020
by   Paolo Liberatore, et al.
0

Forgetting variables from a propositional formula may increase its size. Introducing new variables is a way to shorten it. Both operations can be expressed in terms of common equivalence, a weakened version of equivalence. In turn, common equivalence can be expressed in terms of forgetting. An algorithm for forgetting and checking common equivalence in polynomial space is given for the Horn case; it is polynomial-time for the subclass of single-head formulae. Minimizing after forgetting is polynomial-time if the formula is also acyclic and variables cannot be introduced, NP-hard when they can.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
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...
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
09/26/2022

Abductive forgetting

Abductive forgetting is removing variables from a logical formula while ...
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
02/10/2015

On Forgetting in Tractable Propositional Fragments

Distilling from a knowledge base only the part that is relevant to a sub...
research
06/06/2015

Selective Greedy Equivalence Search: Finding Optimal Bayesian Networks Using a Polynomial Number of Score Evaluations

We introduce Selective Greedy Equivalence Search (SGES), a restricted ve...

Please sign up or login with your details

Forgot password? Click here to reset