• A general schema for generating argumentation semantics from logic programming semantics 

      Nieves Sánchez, Juan Carlos; Osorio Galindo, Mauricio (2008-11)
      Report de recerca
      Accés obert
      In this paper, by considering the idea that argumentation semantics can be viewed as a special form of logic programming semantics with negation as failure, we show that any logic programming semantics as the stable model ...
    • G’3-stable semantics and inconsistency 

      Osorio, Mauricio; Zepeda, Claudia; Nieves Sánchez, Juan Carlos; Carballido, José Luis (2009-09-01)
      Article
      Accés obert
      We present an overview on how to perform non-monotonic reasoning based on paraconsistent logics. In particular, we show that one can define a logic programming semantics based on the paraconsistent logic G’3 which is called ...
    • Inferring preferred extensions by Pstable semantics 

      Nieves Sánchez, Juan Carlos; Osorio Galindo, Mauricio (2007-07)
      Report de recerca
      Accés obert
      Given an argumentation framework AF, we present a normal program Psi_{AF}, such that the preferred extensions of AF correspond exactly with the pstable models of Psi_{AF}. Moreover, we motivate the notion of suitable ...
    • Logic programs with possibilistic ordered disjunction 

      Confalonieri, Roberto; Nieves, Juan Carlos; Vázquez Salceda, Javier (2009-05)
      Report de recerca
      Accés obert
      Logic programs with ordered disjunction have shown to be a flexible specification language able to model common user preferences in a natural way. However, in some realistic scenarios the preferences should be linked to ...
    • On the viability of an algebraic approach to non-monotonic reasoning 

      Termini, Settimo (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 1996)
      Article
      Accés obert
    • Weakening the stable semantics 

      Nieves, Juan Carlos; Osorio Galindo, Mauricio (2005-12)
      Report de recerca
      Accés obert
      We report our research on semantics for normal/disjunctive programs. One of the most well known semantics for logic programming is the stable semantics (STABLE). However, it is well known that very often STABLE has no ...