The ghosts of forgotten things: A study on size after forgetting
Not on the map. Why?
Abstract (arXiv)
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 Dp-hard in Sigmap2. The same problem for unrestricted propositional formulae is Dp2-hard in Sigmap3.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 May 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2.
2 papers.
- 2022Superredundancy: A tool for Boolean formula minimization complexity analysiscited by 0
- 2022Abductive forgettingcited by 0
- 2022Abductive forgetting26 Sep 2022
- 2022Superredundancy: A tool for Boolean formula minimization complexity analysis2 May 2022