Forgetting Auxiliary Atoms in Forks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Forgetting Auxiliary Atoms in Forks

Résumé

In this work we tackle 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.
Fichier principal
Vignette du fichier
Forgetting Auxiliary Atoms in Forks.pdf (173.03 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03131894 , version 1 (08-02-2021)

Identifiants

  • HAL Id : hal-03131894 , version 1

Citer

Felicidad Aguado, Pedro Calabar, Jorge Fandinno, David Pearce, Gilberto Perez, et al.. Forgetting Auxiliary Atoms in Forks. Tenth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2017 @ 14th LPNMR), Bart Bogaerts; Amelia Harrison, Jul 2017, Espoo, Finland. ⟨hal-03131894⟩
46 Consultations
87 Téléchargements

Partager

Gmail Facebook X LinkedIn More