A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Forgetting Auxiliary Atoms in Forks (Extended Abstract)
2020
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence
This work tackles the problem of checking strong equivalence of logic programs that may contain local auxiliary atoms, to be removed from their stable models and to be forbidden in any external context. We call this property projective strong equivalence (PSE). It has been recently proved that not any logic program containing auxiliary atoms can be reformulated, under PSE, as another logic program or formula without them -- this is known as strongly persistent forgetting. In this paper, we
doi:10.24963/ijcai.2020/685
dblp:conf/ijcai/Miettinen020
fatcat:ksb2lejf35ggtk3otqjn7xivke