Mauricio Osorio

Affiliations:
  • Fundación Universidad de las Américas, Puebla, México


According to our database1, Mauricio Osorio authored at least 143 papers between 1993 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
An Alternative Definition of Stable Models Via Łukasiewicz Logic.
Computación y Sistemas (CyS), 2023

A 4-Valued Logic that Extends the Paraconsistent Logic G'3.
Computación y Sistemas (CyS), 2023

2021
A family of genuine and non-algebraisable C-systems.
J. Appl. Non Class. Logics, 2021

2020
An axiomatic approach to CG′3 logic.
Log. J. IGPL, 2020

Creative Composition Problem: A Knowledge Graph Logical-Based AI Construction and Optimization Solution - Applied in Cecilia: An Architecture of a Digital Companion Artificial Intelligence (AI) Agent System Composer of Dialogue Scripts for Well-Being and Mental Health.
Proceedings of the Graph Structures for Knowledge Representation and Reasoning, 2020

MyUBot: Towards an Artificial Intelligence Agent System Chat-bot for Well-being and Mental Health.
Proceedings of the First International AAI4H, 2020

2019
Béziau's SP3A Logic and Logic Programming.
Res. Comput. Sci., 2019

Towards an Answer Set Programming Methodology for Constructing Programs Following a Semi-Automatic Approach - Extended and Revised version.
Proceedings of the Selected Papers of the Eleventh and Twelfth Latin American Workshop on Logic/Languages, 2019

Towards an answer set programming methodology for constructing programs following a semi-automatic approach.
Proceedings of the Twelfth Latin American Workshop on Logic/Languages, 2019

Three New Genuine Five-valued Logics Intended to Model Non-trivial Concepts.
Proceedings of the Selected Papers of the Eleventh and Twelfth Latin American Workshop on Logic/Languages, 2019

Three new genuine five-valued logics.
Proceedings of the Twelfth Latin American Workshop on Logic/Languages, 2019

Methodology to represent functions in logic <i>BL</i><sub>⊃</sub>.
Proceedings of the Twelfth Latin American Workshop on Logic/Languages, 2019

An Extension of the Stable Semantics via Lukasiewicz Logic.
Proceedings of the Selected Papers of the Eleventh and Twelfth Latin American Workshop on Logic/Languages, 2019

2018
Extending Well-Founded Semantics with Clark's Completion for Disjunctive Logic Programs.
Sci. Program., 2018

Lukasiewicz' 3-valued logic can not be expressed in terms of SP3A logic.
Proceedings of the Eleventh Latin American Workshop on Logic/Languages, 2018

2017
Range-based argumentation semantics as two-valued models.
Theory Pract. Log. Program., 2017

The Pursuit of an Implication for the Logics L3A and L3B.
Logica Universalis, 2017

23rd Workshop on Logic, Language, Information and Computation (WoLLIC 2016).
Log. J. IGPL, 2017

Equivalence among RC-type paraconsistent logics.
Log. J. IGPL, 2017

Abducible Semantics and Argumentation.
Fundam. Informaticae, 2017

0-1 Integer Programming for Computing Semi-Stable Semantics of Argumentation Frameworks.
Computación y Sistemas, 2017

2016
Ideal extensions as logical programming models.
J. Log. Comput., 2016

Revisiting da Costa logic.
J. Appl. Log., 2016

Defining Stage Argumentation Semantics in Terms of an Abducible Semantics.
Proceedings of the Selected Papers of the Tenth Latin American Workshop on Logic/Languages, 2016

Range-based argumentation semantics as 2-valued models.
CoRR, 2016

Characterizing stage argumentation semantics based on stable abducible semantics.
Proceedings of the Tenth Latin American Workshop on Logic/Languages, 2016

2015
Weakening and Extending ℤ.
Logica Universalis, 2015

Computing stable semantics of AF by 0-1 integer programming.
Proceedings of the 25. International Conference on Electronics, 2015

2014
Revisiting ℤ.
Notre Dame J. Formal Log., 2014

On Paraconsistent Extensions of C<sub>1</sub>.
Proceedings of the Selected Papers of the Ninth Latin American Workshop on Logic/Languages, 2014

A Single Proof of Classical Behaviour in da Costa's C<sub>n</sub> Systems.
Proceedings of the Selected Papers of the Ninth Latin American Workshop on Logic/Languages, 2014

Preferences for Argumentation Semantics.
Proceedings of the Human-Inspired Computing and Its Applications, 2014

Computing Preferred Semantics: Comparing Two ASP Approaches vs an Approach Based on 0-1 Integer Programming.
Proceedings of the Human-Inspired Computing and Its Applications, 2014

Modeling Natural Language Metaphors with an Answer Set Programming Framework.
Proceedings of the Human-Inspired Computing and Its Applications, 2014

A Single Proof of Classical Behaviour in Da Costa's Cn Systems.
Proceedings of the Ninth Latin American Workshop on Logic/Languages, 2014

Computing Semi-Stable Semantics of AF by 0-1 Integer Programming.
Proceedings of the Ninth Latin American Workshop on Logic/Languages, 2014

Revisiting C1.
Proceedings of the Ninth Latin American Workshop on Logic/Languages, 2014

2013
Semantics for Possibilistic Disjunctive Programs.
Theory Pract. Log. Program., 2013

Preferred Extensions as Minimal Models of Clark's Completion Semantics.
Res. Comput. Sci., 2013

Some Properties of Logic N-GLukG.
Proceedings of the Advances in Artificial Intelligence and Its Applications, 2013

Complete Extensions as Clark's Completion Semantics.
Proceedings of the Mexican International Conference on Computer Science, 2013

N'<sub>5</sub> as an Extension of G'<sub>3</sub>.
Proceedings of the 7th Alberto Mendelzon International Workshop on Foundations of Data Management, 2013

2012
Possibilistic intermediate logic.
Int. J. Adv. Intell. Paradigms, 2012

Dealing with explicit preferences and uncertainty in answer set programming.
Ann. Math. Artif. Intell., 2012

Managing Inconsistent Possibilistic Knowledge Bases by An Argumentation Approach.
Proceedings of the 27th Annual Workshop of the Swedish Artificial Intelligence Society, 2012

Decision Analysis with Logic and Mathematical Programming.
Proceedings of the Eighth Latin American Workshop on Logic / Languages, 2012

Foreword.
Proceedings of the 22nd International Conference on Electrical Communications and Computers, 2012

2011
Preface.
Fundam. Informaticae, 2011

A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory.
Fundam. Informaticae, 2011

Characterization of Argumentation Semantics in Terms of the MM r Semantics.
Proceedings of the Advances in Artificial Intelligence, 2011

An Application of Clasp in the Study of Logics.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2011

The Stable Abducible Argumentation Semantics.
Proceedings of the Seventh Latin American Workshop on Non-Monotonic Reasoning, 2011

Modeling production of resources using Answer Set Planning.
Proceedings of the CONIELECOMP 2011, 21st International Conference on Electrical, Communications, and Computers, 28 February, 2011

Extending the Grounded Semantics by Logic Programming Semantics.
Proceedings of the Artificial Intelligence Research and Development, 2011

2010
Equivalence for the G'<sub>3</sub>-stable models semantics.
J. Appl. Log., 2010

Guest Editorial: Fifth Latin American Workshop on Non-Monotonic Reasoning 2009, (LANMR'09).
Inteligencia Artif., 2010

Updates Based on ASP.
Proceedings of the 9th Mexican International Conference on Artificial Intelligence, 2010

A Possibilistic Intuitionistic Logic.
Proceedings of the Advances in Artificial Intelligence, 2010

Possibilistic Semantics for Logic Programs with Ordered Disjunction.
Proceedings of the Foundations of Information and Knowledge Systems, 2010

Digital design vercation based on P-stable semantics.
Proceedings of the 20th International Conference on Electronics, 2010

Motifs recognition in DNA sequences comparing the motif finding automaton algorithm against a traditional approach.
Proceedings of the 20th International Conference on Electronics, 2010

Yet another application of fuzzy logic.
Proceedings of the 20th International Conference on Electronics, 2010

Expressing p-stable semantics based on stable semantics.
Proceedings of the 20th International Conference on Electronics, 2010

CF2-extensions as Answer-set Models.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2010, 2010

2009
Preface.
J. Algorithms, 2009

G'3-Stable Semantics and Inconsistency.
Computación y Sistemas, 2009

Guest Editorial: Workshops by the Logic and Computation Mexican Group.
Inteligencia Artif., 2009

Inferring Preferred Extensions by Pstable Semantics.
Inteligencia Artif., 2009

Expressing Extension-Based Semantics Based on Stratified Minimal Models.
Proceedings of the Logic, 2009

Possibilistic Well-Founded Semantics.
Proceedings of the MICAI 2009: Advances in Artificial Intelligence, 2009

The Logical Consequence Role in LPNMR: A Parameterized Computation Approach.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

Computing the Stratified Minimal Models Semantic.
Proceedings of the Fifth Latin American Workshop on Non-Monotonic Reasoning 2009 (LANMR'09) , 2009

Possibilistic Stratified Minimal Model Semantics.
Proceedings of the 2009 Mexican International Conference on Computer Science, 2009

A Formal Design Model for Mechatronic Systems.
Proceedings of the CONIELECOMP 2009, 2009

2008
Preferred extensions as stable models.
Theory Pract. Log. Program., 2008

Logical Weak Completions of Paraconsistent Logics.
J. Log. Comput., 2008

An Overview of Argumentation Semantics.
Computación y Sistemas, 2008

Possibilistic-Based Argumentation: An Answer Set Programming Approach.
Proceedings of the Ninth Mexican International Conference on Computer Science, 2008

Pstable Theories and Preferences.
Proceedings of the 18th International Conference on Electronics, 2008

2007
Updates in answer set programming: An approach based on basic structural properties.
Theory Pract. Log. Program., 2007

Strong Negation and Equivalence in the Safe Belief Semantics.
J. Log. Comput., 2007

Updates Under Pstable.
Eng. Lett., 2007

Update Sequences Based on Minimal Generalized Pstable Models.
Proceedings of the MICAI 2007: Advances in Artificial Intelligence, 2007

PStable Semantics for Possibilistic Logic Programs.
Proceedings of the MICAI 2007: Advances in Artificial Intelligence, 2007

GLukG logic and its application for non-monotonic reasoning.
Proceedings of the Latin-American Workshop on Non-Monotonic Reasoning, Proceedings of the LA-NMR07 Workshop, Benemérita Universidad Autónoma de Puebla, Puebla, Pue., México, 17th, 2007

Inferring preferred extensions by Pstable semantics.
Proceedings of the Latin-American Workshop on Non-Monotonic Reasoning, Proceedings of the LA-NMR07 Workshop, Benemérita Universidad Autónoma de Puebla, Puebla, Pue., México, 17th, 2007

Generating maximal models using the stable model semantics.
Proceedings of the Latin-American Workshop on Non-Monotonic Reasoning, Proceedings of the LA-NMR07 Workshop, Benemérita Universidad Autónoma de Puebla, Puebla, Pue., México, 17th, 2007

Equivalence for the G3'-stable models semantics.
Proceedings of the Latin-American Workshop on Non-Monotonic Reasoning, Proceedings of the LA-NMR07 Workshop, Benemérita Universidad Autónoma de Puebla, Puebla, Pue., México, 17th, 2007

A semantics for updates consisting of a sequence of programs.
Proceedings of the 17th International Conference on Electronics, 2007

Reductions between the Subgraph Isomorphism Problem and Hamiltonian and SAT Problems.
Proceedings of the 17th International Conference on Electronics, 2007

Reasoning about actions under uncertainty: A possibilistic approach.
Proceedings of the Artificial Intelligence Research and Development, 2007

2006
Logics with Common Weak Completions.
J. Log. Comput., 2006

Minimal Generalized Answer-Sets and their Applications.
Proceedings of the LoLaCOM06 Workshop, Instituto Tecnológico de Apizaco, Apizaco, Tlaxcala, Mexico, 13th, 2006

Answer Set General Theories and Preferences.
Proceedings of the MICAI 2006: Advances in Artificial Intelligence, 2006

An Axiomatization of G'3.
Proceedings of the LoLaCOM06 Workshop, Instituto Tecnológico de Apizaco, Apizaco, Tlaxcala, Mexico, 13th, 2006

Programas Lógicos Disjunctivos y la Demostrabilidad de Atomos en Cw.
Proceedings of the LoLaCOM06 Workshop, Instituto Tecnológico de Apizaco, Apizaco, Tlaxcala, Mexico, 13th, 2006

Expressing the Stable Semantics in Terms of the Pstable Semantics.
Proceedings of the LoLaCOM06 Workshop, Instituto Tecnológico de Apizaco, Apizaco, Tlaxcala, Mexico, 13th, 2006

Preferences using Answer Sets.
Proceedings of the Latin-American Workshop on Non-Monotonic Reasoning, 2006

Supporting decision making in organ transplanting using argumentation theory.
Proceedings of the Latin-American Workshop on Non-Monotonic Reasoning, 2006

Inexact Graph Matching: A Case of Study.
Proceedings of the Nineteenth International Florida Artificial Intelligence Research Society Conference, 2006

Defining new argumentation-based semantics by minimal models.
Proceedings of the Seventh Mexican International Conference on Computer Science, 2006

2005
Ground Nonmonotonic Modal Logic S5: New Results.
J. Log. Comput., 2005

Safe beliefs for propositional theories.
Ann. Pure Appl. Log., 2005

Application of ASP for Agent Modelling in CSCL Environments.
Proceedings of the MICAI 2005: Advances in Artificial Intelligence, 2005

Subgraph Isomorphism Detection Using a Code Based Representation.
Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, 2005

Inferring acceptable arguments with Answer Set Programming.
Proceedings of the Sixth Mexican International Conference on Computer Science (ENC 2005), 2005

Agent Modelling for CSCL Environments using Answer Sets Programming.
Proceedings of the Sixth Mexican International Conference on Computer Science (ENC 2005), 2005

Modeling Evacuation Planning Using A-Prolog.
Proceedings of the 15th International Conference on Electronics, Communications, and Computers (CONIELECOMP 2005), 28 February 2005, 2005

Algorithms for the Typing of Related DNA Sequences.
Proceedings of the 15th International Conference on Electronics, Communications, and Computers (CONIELECOMP 2005), 28 February 2005, 2005

Mining Common Patterns on Graphs.
Proceedings of the Computational Intelligence and Security, International Conference, 2005

Applications of Preferences using Answer Set Programming.
Proceedings of the Answer Set Programming, 2005

Nelson's Strong Negation, Safe Beliefs and the Answer Set Semantics.
Proceedings of the Answer Set Programming, 2005

2004
Applications of Intuitionistic Logic in Answer Set Programming.
Theory Pract. Log. Program., 2004

Aggregation in Functional Query Languages.
J. Funct. Log. Program., 2004

Closing the Gap between the Stable Semantics and Extensions of WFS.
Proceedings of the MICAI 2004: Advances in Artificial Intelligence, 2004

Answer Set Programming and S4.
Proceedings of the Advances in Artificial Intelligence, 2004

Three Valued Logic of Lukasiewicz for Modeling Semantics of Logic Programs.
Proceedings of the Advances in Artificial Intelligence, 2004

On Updates of Logic Programs: A Properties-Based Approach.
Proceedings of the Foundations of Information and Knowledge Systems, 2004

Usefulness of Solution Algorithms of the Traveling Salesman Problem in the Typing of Biological Sequences in a Clinical Laboratory Setting.
Proceedings of the 14th International Conference on Electronics, 2004

2003
Formalizing the Learner Model for CSCL Environments.
Proceedings of the 4th Mexican International Conference on Computer Science (ENC 2003), 2003

Towards the use of Semantics Contents in ASP for planning and diagnistic in GIS.
Proceedings of the Answer Set Programming, 2003

New properties on the update operator\oplus.
Proceedings of the Answer Set Programming, 2003

The A-Pol System.
Proceedings of the Answer Set Programming, 2003

Towards Modelling an Intelligent Calendar Agent with LUPS.
Proceedings of the 21st IASTED International Multi-Conference on Applied Informatics (AI 2003), 2003

2002
A logical approach to A-Prolog.
Proceedings of the 9th Workhop on Logic, Language, Information and Computation, 2002

Debugging in A-Prolog: A Logical Approach.
Proceedings of the Logic Programming, 18th International Conference, 2002

2001
A general theory of confluent rewriting systems for logic programming and its applications.
Ann. Pure Appl. Log., 2001

Equivalence in Answer Set Programming.
Proceedings of the Logic Based Program Synthesis and Transformation, 2001

Useful Transformations in Answer set programming.
Proceedings of the Answer Set Programming, 2001

Stratified Partial-Order Logic Programming.
Proceedings of the Advances in Artificial Intelligence, 2001

2000
Knowledge Representation Using High-Level Non-monotonic Reasoning.
Proceedings of the MICAI 2000: Advances in Artificial Intelligence, 2000

High-Level Logic Programming.
Proceedings of the Foundations of Information and Knowledge Systems, 2000

Application of Simplification Theories.
Proceedings of the Seventh Workshop on Automated Reasoning, 2000

1999
Theory of Partial-Order Programming.
Sci. Comput. Program., 1999

Aggregation and Negation-As-Failure.
New Gener. Comput., 1999

Confluent Rewriting systems in Non-Monotonic Reasoning.
Computación y Sistemas, 1999

Declarative Pruning in a Functional Query Language.
Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

1998
Semantics of Partial-Order Programs.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 1998

Integrating the Completion and the Well Founded Semantics.
Proceedings of the Progress in Artificial Intelligence, 1998

1997
On Well-Behaved Semantics Suitable for Aggregation.
Proceedings of the Logic Programming, 1997

1996
Aggregation and Well-Founded Semantics.
Proceedings of the Non-Monotonic Extensions of Logic Programming, 1996

1995
Partial Order Programming <i>(Revisited)</i>.
Proceedings of the Algebraic Methodology and Software Technology, 1995

1993
Subset Assertions and Negation As Failure.
Proceedings of the Logic Programming, 1993


  Loading...