Guillermo De Ita Luna

José Alejandro Reyes-Ortíz

Proceedings of the Pattern Recognition and Artificial Intelligence, 2022

2021

Caracterización de complejidad semántica en pasajes tipo TOEFL.

[BibT_eX]

[DOI]

J. Leonardo González-Ruiz

Rev. Colomb. de Computación, 2021

Approximate the Clique-Width of a Graph Using Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the Advances in Soft Computing, 2021

Inferential Rules for Identifying Answers in TOEFL Texts.

[BibT_eX]

[DOI]

Proceedings of the Pattern Recognition - 13th Mexican Conference, 2021

Extremal Topologies for the Merrifield-Simmons Index on Dynamic Trees.

[BibT_eX]

[DOI]

Miguel Rodríguez

Proceedings of the Pattern Recognition - 13th Mexican Conference, 2021

2020

Algoritmo para el conteo de modelos en FNC.

[BibT_eX]

[DOI]

Pedro Bello López

Miguel Rodríguez Hernández

Res. Comput. Sci., 2020

Detección automática de zonas de alto riesgo de eventos delictivos a través de noticias periodísticas.

[BibT_eX]

[DOI]

Yadira Laureano de Jésus

Res. Comput. Sci., 2020

A bottom-up algorithm for solving ♯2SAT.

[BibT_eX]

[DOI]

Log. J. IGPL, 2020

Knowledge Representation in TOEFL Expository Texts.

[BibT_eX]

[DOI]

Computación y Sistemas, 2020

A Linear Time Algorithm for Counting #2SAT on Series-Parallel Formulas.

[BibT_eX]

[DOI]

Proceedings of the Advances in Soft Computing, 2020

Basic Pattern Graphs for the Efficient Computation of Its Number of Independent Sets.

[BibT_eX]

[DOI]

Proceedings of the Pattern Recognition - 12th Mexican Conference, 2020

2019

Recognizing 3-colorable Basic Patterns on Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Pattern Recognition - 11th Mexican Conference, 2019

Inference Algorithm with Falsifying Patterns for Belief Revision.

[BibT_eX]

[DOI]

Proceedings of the Pattern Recognition - 11th Mexican Conference, 2019

A Heuristic for the Coloring of Planar Graphs.

[BibT_eX]

[DOI]

Jorge Eduardo Gutiérrez-Gómez

Ana E. De Ita-Varela

Proceedings of the Selected Papers of the Eleventh and Twelfth Latin American Workshop on Logic/Languages, 2019

Building a Maximal Independent Set for the Vertex-coloring Problem on Planar Graphs.

[BibT_eX]

[DOI]

Jorge Eduardo Gutiérrez-Gómez

Proceedings of the Selected Papers of the Eleventh and Twelfth Latin American Workshop on Logic/Languages, 2019

Cognitive relations for argumentative texts.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Latin American Workshop on Logic/Languages, 2019

2018

Belief revision between conjunctive normal forms.

[BibT_eX]

[DOI]

J. Intell. Fuzzy Syst., 2018

A New Optimization Strategy for Solving the Fall-Off Boundary Value Problem in Pixel-Value Differencing Steganography.

[BibT_eX]

[DOI]

Ismael R. Grajeda-Marín

Vianney Muñoz-Jiménez

Int. J. Pattern Recognit. Artif. Intell., 2018

Modelling 3-Coloring of Outerplanar Graphs via Incremental Satisfiability.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2018

A Linear Time Algorithm for Computing #2SAT for Outerplanar 2-CNF Formulas.

[BibT_eX]

[DOI]

Proceedings of the Pattern Recognition - 10th Mexican Conference, 2018

Modelling 3-Coloring of Polygonal Trees via Incremental Satisfiability.

[BibT_eX]

[DOI]

Alfredo Neri

Proceedings of the Pattern Recognition - 10th Mexican Conference, 2018

Model counting for #2SAT problem in outerplanar graphs.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Latin American Workshop on Logic/Languages, 2018

A novel heuristic for the coloring of planar graphs.

[BibT_eX]

[DOI]

Adriana C. Luna

Proceedings of the Eleventh Latin American Workshop on Logic/Languages, 2018

The computation of #2SAT by a fixed-parameter tractable algorithm.

[BibT_eX]

[DOI]

Miguel Rodríguez

Proceedings of the Eleventh Latin American Workshop on Logic/Languages, 2018

Knowledge representation of passages type TOEFL.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Latin American Workshop on Logic/Languages, 2018

2017

Low-exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs.

[BibT_eX]

[DOI]

Computación y Sistemas, 2017

Model-based Algorithm for Belief Revisions between Normal Conjunctive Forms.

[BibT_eX]

[DOI]

Alma Delia García

Computación y Sistemas, 2017

A Linear Time Algorithm for Solving #2SAT on Cactus Formulas.

[BibT_eX]

[DOI]

M. A. López

Roberto Alejo

CoRR, 2017

A Fast and Efficient Method for #2SAT via Graph Transformations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Soft Computing, 2017

Extending Extremal Polygonal Arrays for the Merrifield-Simmons Index.

[BibT_eX]

[DOI]

Marcelo Romero

Proceedings of the Pattern Recognition - 9th Mexican Conference, 2017

2016

Applying an Incremental Satisfiability Algorithm to Automatic Test Pattern Generation.

[BibT_eX]

[DOI]

Res. Comput. Sci., 2016

The Incremental Satisfiability Problem for a Two Conjunctive Normal Form.

[BibT_eX]

[DOI]

Proceedings of the Selected Papers of the Tenth Latin American Workshop on Logic/Languages, 2016

A Polynomial Time Algorithm for Counting the Number of Independent Sets of Cactus Graphs.

[BibT_eX]

[DOI]

J. Leonardo González-Ruiz

Proceedings of the Fifteenth Mexican International Conference on Artificial Intelligence, 2016

Computing the Clique-Width of Polygonal Tree Graphs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Soft Computing, 2016

Efficient Counting of the Number of Independent Sets on Polygonal Trees.

[BibT_eX]

[DOI]

Juan C. Catana-Salazar

Proceedings of the Pattern Recognition - 8th Mexican Conference, 2016

An Optimization Approach to the TWPVD Method for Digital Image Steganography.

[BibT_eX]

[DOI]

Ismael R. Grajeda-Marín

Proceedings of the Pattern Recognition - 8th Mexican Conference, 2016

Approximate the chromatic number of a graph using maximal independent sets.

[BibT_eX]

[DOI]

Angélica Guzmán Ponce

Proceedings of the 2016 International Conference on Electronics, 2016

2015

Un algoritmo para calcular #2SAT.

[BibT_eX]

[DOI]

Res. Comput. Sci., 2015

Finding Pure Nash Equilibrium for the Resource Constrained Project Scheduling Problem.

[BibT_eX]

[DOI]

Luis Carlos Altamirano Robles

Computación y Sistemas, 2015

A Parametric Polynomial Deterministic Algorithm for #2SAT.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence and Soft Computing, 2015

Smart Tourism in 1-Click.

[BibT_eX]

[DOI]

Rosalba Cuapa

Daniel Torres

Proceedings of the 10th International Conference on Future Networks and Communications (FNC 2015) / The 12th International Conference on Mobile Systems and Pervasive Computing (MobiSPC 2015) / Affiliated Workshops, 2015

An algorithm to approximate the chromatic number of graphs.

[BibT_eX]

[DOI]

Angélica Guzmán Ponce

Proceedings of the 25. International Conference on Electronics, 2015

2014

Predicting Preferences of Voters from Opinion Polls by Machine Learning and Game Theory.

[BibT_eX]

[DOI]

Josúe Pérez

Res. Comput. Sci., 2014

Using Binary Patterns for Counting Falsifying Assignments of Conjunctive Forms.

[BibT_eX]

[DOI]

Maria del Pilar Pozos Parra

Proceedings of the Selected Papers of the Ninth Latin American Workshop on Logic/Languages, 2014

An Approximate Algorithm for the Chromatic Number of Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2014

An Enumerative Algorithm for #2SAT.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2014

Counting Falsifying Assignments of Conjunctive Forms Using Binary Patterns.

[BibT_eX]

[DOI]

Pilar Pozos Parra

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

2013

Recognizing 3-colorings cycle-patterns on graphs.

[BibT_eX]

[DOI]

Javier A. Castillo

Pattern Recognit. Lett., 2013

Recognizing Structural Patterns on Graphs for the Efficient Computation of #2SAT.

[BibT_eX]

[DOI]

Miguel Angel Medina-Pérez

Proceedings of the Pattern Recognition - 5th Mexican Conference, 2013

An Empirical Study of Oversampling and Undersampling Methods for LCMine an Emerging Pattern Based Classifier.

[BibT_eX]

[DOI]

Octavio Loyola-González

Milton García-Borroto

José Francisco Martínez Trinidad

Jesús Ariel Carrasco-Ochoa

Proceedings of the Pattern Recognition - 5th Mexican Conference, 2013

A Logical Database for Geriatric Purposes.

[BibT_eX]

[DOI]

Josúe Pérez

Juan Carlos Pérez

Proceedings of the 7th Alberto Mendelzon International Workshop on Foundations of Data Management, 2013

2012

A Method Based on Congestion Game Theory for Determining Electoral Tendencies.

[BibT_eX]

[DOI]

Luis Carlos Altamirano

Proceedings of the Social Informatics, 2012

Computing #2SAT and #2UNSAT by Binary Patterns.

[BibT_eX]

[DOI]

Proceedings of the Pattern Recognition - 4th Mexican Conference, 2012

Job Shop Scheduling via Disjunctive Boolean Formulas.

[BibT_eX]

[DOI]

Juan Carlos Pérez

Josúe Pérez

Proceedings of the Eighth Latin American Workshop on Logic / Languages, 2012

Edge covering of acyclic graphs.

[BibT_eX]

[DOI]

Proceedings of the Eighth Latin American Workshop on Logic / Languages, 2012

An Approximate Algorithm for the Chromatic Number of a Graph.

[BibT_eX]

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

A Threshold for a Polynomial Solution of #2SAT.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Solving 3-Colouring via 2SAT.

[BibT_eX]

[DOI]

César Bautista

Luis Carlos Altamirano

Proceedings of the Pattern Recognition - Third Mexican Conference, 2011

A Note for Parametric Complexity of #2SAT.

[BibT_eX]

[DOI]

Alejandro Rangel-Huerta

Proceedings of the Seventh Latin American Workshop on Non-Monotonic Reasoning, 2011

A Multiagent System for Modeling Democratic Elections.

[BibT_eX]

[DOI]

Isaac Chantes Quechol

Proceedings of the Twenty-Fourth International Florida Artificial Intelligence Research Society Conference, 2011

2010

Estimating the relevance on Communication Lines Based on the Number of Edge Covers.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

Efficient Computation of the Degree of Belief for a Subclass of Two Conjunctive Forms.

[BibT_eX]

[DOI]

Inteligencia Artif., 2010

A Novel Method for Counting Models on Grid Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the Advances in Pattern Recognition, 2010

2009

Efficient Computation of the Degree of Belief for a Subclass of Two Conjuctive Forms.

[BibT_eX]

[DOI]

Ali Khanafer

Proceedings of the Fifth Latin American Workshop on Non-Monotonic Reasoning 2009 (LANMR'09) , 2009

2008

Computing #2-SAT of Grids, Grid-Cylinders and Grid-Tori Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the 15th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2008

Agents's competition for selecting a representative.

[BibT_eX]

[DOI]

Mireya Tovar

Proceedings of the fourth Latin American Workshop on Non-Monotonic Reasoning 2008 (LANMR'08) Facultad de Ciencias de la Computación de la Benemérita Universidad Autónoma de Puebla, 2008

Efficient computation of the degree of belief in a propositional theory.

[BibT_eX]

[DOI]

Proceedings of the fourth Latin American Workshop on Non-Monotonic Reasoning 2008 (LANMR'08) Facultad de Ciencias de la Computación de la Benemérita Universidad Autónoma de Puebla, 2008

2007

New Polynomial Classes for #2SAT Established Via Graph-Topological Structure.

[BibT_eX]

[DOI]

Pedro Bello López

Eng. Lett., 2007

Model Counting for 2SAT Based on Graphs by Matrix Operators.

[BibT_eX]

[DOI]

Eng. Lett., 2007

Efficient counting of models for boolean formulas represented by embedded cycles.

[BibT_eX]

[DOI]

Pedro Bello López

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 Worst-Case Time Upper Bound for Counting the Number of Independent Sets.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006

A Polynomial Graphical Reduction to Speed Up the Counting of Models for Boolean Formulas.

[BibT_eX]

[DOI]