Listar por autor "Vidal, Concepción"

Mostrando ítems 1-5 de 5

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

    • Comparing the Reasoning Capabilities of Equilibrium Theories and Answer Set Programs 

      Fandiño, Jorge; Pearce, David; Vidal, Concepción; Woltran, Stefan (MDPI, 2022)
      [Abstract] Answer Set Programming (ASP) is a well established logical approach in artificial intelligence that is widely used for knowledge representation and problem solving. Equilibrium logic extends answer set semantics ...

    • Forgetting Auxiliary Atoms in Forks 

      Aguado, Felicidad; Cabalar, Pedro; Fandiño, Jorge; Pearce, David; Pérez, Gilberto; Vidal, Concepción (Elsevier Ltd, 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. ...

    • Linear-Time Temporal Answer Set Programming 

      Aguado, Felicidad; Cabalar, Pedro; Diéguez Lodeiro, Martín; Pérez, Gilberto; Schaub, Torsten; Schuhmann, Anna; Vidal, Concepción (Cambridge University Press, 2023)
      [Abstract]: In this survey, we present an overview on (Modal) Temporal Logic Programming in view of its application to Knowledge Representation and Declarative Problem Solving. The syntax of this extension of logic programs ...

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