Abductive forgetting

09/26/2022
by   Paolo Liberatore, et al.
0

Abductive forgetting is removing variables from a logical formula while maintaining its abductive explanations. It is defined in either of two ways, depending on its intended application. Both differ from the usual forgetting, which maintains consequences rather than explanations. Differently from that, abductive forgetting from a propositional formula may not be expressed by any propositional formula. A necessary and sufficient condition tells when it is. Checking this condition is 3-complete, and is in 4 if minimality of explanations is required. A way to guarantee expressibility of abductive forgetting is to switch from propositional to default logic. Another is to introduce new variables.

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
02/10/2015

On Forgetting in Tractable Propositional Fragments

Distilling from a knowledge base only the part that is relevant to a sub...
research
04/13/2022

Four algorithms for propositional forgetting

Four algorithms for propositional forgetting are compared. The first per...
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
04/02/2018

A Note on Kaldi's PLDA Implementation

Some explanations to Kaldi's PLDA implementation to make formula derivat...

Please sign up or login with your details

Forgot password? Click here to reset