| Three new genuine five-valued logics. | 0 | 0.34 | 2019 |
| An Extension Of The Stable Semantics Via Lukasiewicz Logic | 0 | 0.34 | 2019 |
| Lukasiewicz' 3-valued logic can not be expressed in terms of SP3A logic. | 0 | 0.34 | 2018 |
| Extending Well-Founded Semantics with Clark's Completion for Disjunctive Logic Programs. | 0 | 0.34 | 2018 |
| Range-based argumentation semantics as two-valued models. | 0 | 0.34 | 2017 |
| Abducible Semantics and Argumentation. | 0 | 0.34 | 2017 |
| 0-1 Integer Programming For Computing Semi-Stable Semantics Of Argumentation Frameworks | 0 | 0.34 | 2017 |
| Equivalence among RC-type paraconsistent logics. | 0 | 0.34 | 2017 |
| The Pursuit of an Implication for the Logics L3A and L3B. | 2 | 0.40 | 2017 |
| Range-based argumentation semantics as 2-valued models. | 1 | 0.35 | 2016 |
| Ideal Extensions as Logical Programming Models | 0 | 0.34 | 2016 |
| Characterizing stage argumentation semantics based on stable abducible semantics. | 0 | 0.34 | 2016 |
| Defining Stage Argumentation Semantics in Terms of an Abducible Semantics. | 0 | 0.34 | 2016 |
| Revisiting da Costa logic. | 2 | 0.65 | 2016 |
| Weakening and Extending ℤ. | 0 | 0.34 | 2015 |
| On Paraconsistent Extensions of C1 | 0 | 0.34 | 2015 |
| A Single Proof of Classical Behaviour in Da Costa's Cn Systems. | 0 | 0.34 | 2014 |
| Revisiting C1. | 0 | 0.34 | 2014 |
| Revisiting ℤ. | 0 | 0.34 | 2014 |
| Preferred Extensions as Minimal Models of Clark's Completion Semantics | 1 | 0.37 | 2013 |
| Complete Extensions as Clark's Completion Semantics | 4 | 0.42 | 2013 |
| Semantics for Possibilistic Disjunctive Programs. | 1 | 0.35 | 2013 |
| N'5 as an Extension of G'3. | 0 | 0.34 | 2013 |
| Some Properties of Logic N-GLukG. | 0 | 0.34 | 2013 |
| Possibilistic intermediate logic | 2 | 0.49 | 2012 |
| Dealing with explicit preferences and uncertainty in answer set programming | 3 | 0.38 | 2012 |
| Modeling production of resources using Answer Set Planning | 0 | 0.34 | 2011 |
| Extending the Grounded Semantics by Logic Programming Semantics. | 0 | 0.34 | 2011 |
| An application of clasp in the study of logics | 1 | 0.39 | 2011 |
| The Stable Abducible Argumentation Semantics. | 0 | 0.34 | 2011 |
| A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory | 7 | 0.50 | 2011 |
| Characterization of argumentation semantics in terms of the MMr semantics | 0 | 0.34 | 2011 |
| Updates Based on ASP | 0 | 0.34 | 2010 |
| Guest Editorial: Fifth Latin American Workshop on Non-Monotonic Reasoning 2009, (LANMR'09) | 0 | 0.34 | 2010 |
| CF2-extensions as Answer-set Models | 3 | 0.40 | 2010 |
| Expressing Extension-Based Semantics Based on Stratified Minimal Models | 9 | 0.58 | 2009 |
| Computing the Stratified Minimal Models Semantic. | 1 | 0.36 | 2009 |
| A Formal Design Model for Mechatronic Systems | 1 | 0.39 | 2009 |
| Inferring Preferred Extensions by Pstable Semantics | 17 | 0.83 | 2009 |
| Possibilistic Well-Founded Semantics | 2 | 0.36 | 2009 |
| The Logical Consequence Role in LPNMR: A Parameterized Computation Approach | 0 | 0.34 | 2009 |
| G'3-Stable Semantics and Inconsistency. | 0 | 0.34 | 2009 |
| Guest Editorial: Workshops by the Logic and Computation Mexican Group | 0 | 0.34 | 2009 |
| Possibilistic Stratified Minimal Model Semantics | 0 | 0.34 | 2009 |
| Pstable Theories and Preferences. | 4 | 0.44 | 2008 |
| Possibilistic-Based Argumentation: An Answer Set Programming Approach | 7 | 0.49 | 2008 |
| An Overview Of Argumentation Semantics | 1 | 0.35 | 2008 |
| Logical Weak Completions of Paraconsistent Logics | 24 | 1.33 | 2008 |
| Preferred extensions as stable models* | 23 | 0.94 | 2008 |
| GLukG logic and its application for non-monotonic reasoning. | 2 | 0.46 | 2007 |
