Abductive forgetting

2022/09/26 by Liberatore, Paolo
#Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.2209.12825

Abstract

Abductive forgetting is removing variables from a logical formula while maintaining its abductive explanations. It is carried in two alternative 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 it is Π^p₃-complete. A way to guarantee expressibility of abductive forgetting is to switch from propositional to default logic. Another is to introduce new variables.

Related

• The ghosts of forgotten things: A study on size after forgetting
• One head is better than two: a polynomial restriction for propositional definite Horn forgetting
• Four algorithms for propositional forgetting
• Common equivalence and size after forgetting
• Forgetting Formulas and Signature Elements in Epistemic States