The ghosts of forgotten things: A study on size after forgetting

05/08/2020
by   Paolo Liberatore, et al.
0

Forgetting is removing variables from a logical formula while preserving the constraints on the other variables. In spite of being a form of reduction, it does not always decrease the size of the formula and may sometimes increase it. This article discusses the implications of such an increase and analyzes the computational properties of the phenomenon. Given a propositional Horn formula, a set of variables and a maximum allowed size, deciding whether forgetting the variables from the formula can be expressed in that size is D^p-hard in Σ^p_2. The same problem for unrestricted propositional formulae is D^p_2-hard in Σ^p_3. The hardness results employ superredundancy: a superirredundant clause is in all formulae of minimal size equivalent to a given one. This concept may be useful outside forgetting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/19/2020

Common equivalence and size after forgetting

Forgetting variables from a propositional formula may increase its size....
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
10/08/2021

Random Formula Generators

In this article, we provide three generators of propositional formulae f...
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
04/13/2022

Four algorithms for propositional forgetting

Four algorithms for propositional forgetting are compared. The first per...

Please sign up or login with your details

Forgot password? Click here to reset