@article{Soemer2019,
  author    = {Soemer, Alexander},
  title     = {Task-unrelated thoughts and forgetting in working memory},
  series = {Journal of memory and language},
  volume    = {106},
  journal   = {Journal of memory and language},
  publisher = {Elsevier},
  address   = {San Diego},
  issn      = {0749-596X},
  doi       = {10.1016/j.jml.2019.03.004},
  pages     = {118 -- 134},
  year      = {2019},
  abstract  = {The present article reports four experiments that investigated the effects of task-unrelated thoughts (TUTs) on forgetting in non-verbal working memory. Participants had to remember three non-verbal stimuli over unfilled retention intervals (RIs) and then judge whether or not a subsequently presented probe stimulus matched one of the to-be-remembered stimuli. Participants additionally responded to randomly appearing probes that measured different aspects of their TUT engagement during the RI of the preceding trial. Forgetting over unfilled RIs was observed in three of four experiments and reliably associated with the proportion of time spent on TUTs. In contrast, the visual and auditory nature of the TUTs and the number of different TUTs did not reliably predict forgetting. The results support the view that TUTs block attention-based processes that are needed for restoring decaying memory representations rather than an alternative account in terms of interference caused by the content of the TUTs.},
  language  = {en}
}
@article{AguadoCabalarFandinnoetal.2019,
  author    = {Aguado, Felicidad and Cabalar, Pedro and Fandinno, Jorge and Pearce, David and Perez, Gilberto and Vidal, Concepcion},
  title     = {Forgetting auxiliary atoms in forks},
  series = {Artificial intelligence},
  volume    = {275},
  journal   = {Artificial intelligence},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0004-3702},
  doi       = {10.1016/j.artint.2019.07.005},
  pages     = {575 -- 601},
  year      = {2019},
  abstract  = {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.},
  language  = {en}
}