ListarInformation Retrieval Lab (IRlab) por tema "Strong equivalence"

Mostrando ítems 1-2 de 2

    • 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 ...

    • Syntactic ASP forgetting with forks 

      Aguado, Felicidad; Cabalar, Pedro; Fandiño, Jorge; Pearce, David; Pérez, Gilberto; Vidal, Concepción (Elsevier, 2024-01)
      [Abstract]: Answer Set Programming (ASP) constitutes nowadays one of the most successful paradigms for practical Knowledge Representation and declarative problem solving. The formal analysis of ASP programs is essential ...