Forgetting Auxiliary Atoms in Forks (Extended Abstract)
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence
Journal track. Pages 5005-5009. https://doi.org/10.24963/ijcai.2020/696
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 introduce a conservative extension of Equilibrium Logic and its monotonic basis, the logic of Here-and-There, in which we deal with a new connective we call fork. We provide a semantic characterisation of PSE for forks and use it to show that, in this extension, it is always possible to forget auxiliary atoms under strong persistence. We further define when the obtained fork is representable as a regular formula.
Knowledge Representation and Reasoning: Logics for Knowledge Representation
Knowledge Representation and Reasoning: Non-monotonic Reasoning, Common-Sense Reasoning
Knowledge Representation and Reasoning: Knowledge Representation Languages