Benemerita University Atonoma Of Puebla

Puebla de Zaragoza, Mexico

Benemerita University Atonoma Of Puebla

Puebla de Zaragoza, Mexico

Time filter

Source Type

Nieves J.C.,Polytechnic University of Catalonia | Osorio M.,Universidad de Las Americas Puebla | Zepeda C.,Benemerita University Atonoma Of Puebla
Fundamenta Informaticae | Year: 2011

In the literature, there are several approaches which try to perform common sense reasoning. Among them, the approaches which have probably received the most attention the last two decades are the approaches based on logic programming semantics with negation as failure and argumentation theory. Even though both approaches have their own features, it seems that they share some common behaviours which can be studied by considering the close relationship between logic programming semantics and extension-based argumentation semantics. In this paper, we will present a general recursive schema for defining new logic programming semantics. This schema takes as input any basic logic programming semantics, such as the stable model semantics, and gives as output a new logic programming semantics which satisfies some desired properties such as relevance and the existence of the intended models for every normal program. We will see that these new logic programming semantics can define candidate extension-based argumentation semantics. These new argumentation semantics will overcome some of the weakness of the extension-based argumentation semantics based on admissible sets. In fact, we will see that some of these new argumentation semantics have similar behaviour to the extension-based argumentation semantics built in terms of strongly connected components.


Osorio M.,University of the Americas in Mexico | Nieves J.C.,Polytechnic University of Catalonia | Luis Carballido J.,Benemerita University Atonoma Of Puebla
CEUR Workshop Proceedings | Year: 2011

We look at a general way of inducing semantics in argumentation theory by means of a mapping defined on the family of 2-valued models of a normal program, which is constructed in terms of the argumentation framework. In this way we define a new argumentation semantics called stable abducible which lies in between the stable and the preferred semantics. The relevance of this new semantics is that it is nonempty for any argumentation framework, and coincides with the stable argumentation semantics whenever this is non-empty. We study some of the properties of this semantics.


Osorio M.,Universidad de Las Americas Puebla | Carballido J.L.,Benemerita University Atonoma Of Puebla | Zepeda C.,Universidad de Las Americas Puebla | Cruz Z.,Benemerita University Atonoma Of Puebla
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2011

Argumentation theory studies the fundamental mechanism humans use in argumentation and explores ways to implement this mechanism on computers. Dung's approach, presented in [9], is a unifying framework which has played an influential role on argumentation research. In this paper, we show that, a logic programming semantics, called MMr , can be used to characterize the preferred argumentation semantics defined by Dung in [9]. The MMr [12] is based on the the minimal model semantics. The characterization of this argumentation semantics by the MMr semantics suggests a new perception of this argumentation semantics in terms of logic foundations. © 2011 Springer-Verlag.


Osorio M.,Universidad de Las Americas Puebla | Carballido J.L.,Benemerita University Atonoma Of Puebla | Zepeda C.,Benemerita University Atonoma Of Puebla
CEUR Workshop Proceedings | Year: 2016

We define a new logic programming semantics in terms of abducible atoms. We use it to characterize the stage extensions of an argumentation framework AF by means of an associated normal program PAF. We also define the stage semantics for a special type of normal programs and present a similar characterization. © 2016, CEUR-WS. All rights reserved.


Osorio M.,Universidad de Las Americas Puebla | Zepeda C.,Benemerita University Atonoma Of Puebla | Carballido J.L.,Benemerita University Atonoma Of Puebla
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2014

We propose an engineering approach for assembling argumentation theory with a preference approach, which allows us to give as input an argumentation problem with preferences and return the stable argumentation extensions that fulfill the preferences. © Springer International Publishing Switzerland 2014.


Gonzalez-Diaz V.R.,Benemerita University Atonoma Of Puebla | Pena-Perez A.,Stanford University | Maloberti F.,University of Pavia
Electronics Letters | Year: 2014

A new method that compensates for the low DC gain of nanometre operational amplifiers (opamps) used for high-speed continuous-time (CT) ∑Δ modulators is described. The proposed solution compensates for the integrator's phase error which is a main limitation produced by the low opamp's gain. The method uses a simple auxiliary gain stage and a resistor. Simulations of a second-order CT ∑Δ modulator utilising fast single-stage opamps with gain as low as 25 dB verify the effectiveness of the method. © 2014 The Institution of Engineering and Technology.


Osorio M.,Universidad de Las Americas Puebla | Carballido J.L.,Benemerita University Atonoma Of Puebla | Zepeda C.,Benemerita University Atonoma Of Puebla
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2011

We show how to use the Answer Set Programming (ASP) tool called clasp to prove that there exists a unique three-valued paraconsistent logic that satisfies the substitution property and is sound with respect to da Costa C ω logic. © 2011 Springer-Verlag Berlin Heidelberg.


Osorio M.,Universidad de Las Americas Puebla | Carballido J.L.,Benemerita University Atonoma Of Puebla | Zepeda C.,Benemerita University Atonoma Of Puebla
CEUR Workshop Proceedings | Year: 2014

We show that logic C1 cannot be extended to a paraconsistent logic in which the substitution theorem is valid. We show with the help of an answer set programming (ASP) tool called clasp, that C1 is robust with respect to certain three valued paraconsistent logics with some desirable properties. In particular C1 is robust with respect to three-valued logic P2, a logic for which some of the De Morgan laws are valid.

Loading Benemerita University Atonoma Of Puebla collaborators
Loading Benemerita University Atonoma Of Puebla collaborators