• A Polynomial Reduction of Forks Into Logic Programs 

      Aguado, Felicidad; Cabalar, Pedro; Fandiño, Jorge; Pearce, David; Pérez, Gilberto; Vidal, Concepción (Elsevier, 2022)
      [Abstract] In this research note we present additional results for an earlier published paper [1]. There, we studied the problem of projective strong equivalence (PSE) of logic programs, that is, checking whether two logic ...
    • Revisiting Explicit Negation in Answer Set Programming 

      Aguado, Felicidad; Cabalar, Pedro; Fandiño, Jorge; Pearce, David; Pérez, Gilberto; Vidal, Concepción (Cambridge University Press, 2019-09)
      [Abstract] A common feature in Answer Set Programming is the use of a second negation, stronger than default negation and sometimes called explicit, strong or classical negation. This explicit negation is normally used in ...