| A method for counting models on grid Boolean formulas | 0 | 0.34 | 2022 |
| Caracterización de complejidad semántica en pasajes tipo TOEFL. | 0 | 0.34 | 2021 |
| Knowledge Representation In Toefl Expository Texts | 0 | 0.34 | 2020 |
| Algoritmo para el conteo de modelos en FNC | 0 | 0.34 | 2020 |
| Detección automática de zonas de alto riesgo de eventos delictivos a través de noticias periodísticas. | 0 | 0.34 | 2020 |
| Basic Pattern Graphs for the Efficient Computation of Its Number of Independent Sets. | 0 | 0.34 | 2020 |
| Recognizing 3-Colorable Basic Patterns On Planar Graphs | 0 | 0.34 | 2019 |
| Cognitive relations for argumentative texts. | 0 | 0.34 | 2019 |
| A New Optimization Strategy For Solving The Fall-Off Boundary Value Problem In Pixel-Value Differencing Steganography | 2 | 0.36 | 2018 |
| Belief revision between conjunctive normal forms. | 0 | 0.34 | 2018 |
| A Linear Time Algorithm for Computing #2SAT for Outerplanar 2-CNF Formulas. | 0 | 0.34 | 2018 |
| Knowledge representation of passages type TOEFL. | 0 | 0.34 | 2018 |
| Modelling 3-Coloring of Outerplanar Graphs via Incremental Satisfiability. | 0 | 0.34 | 2018 |
| A Linear Time Algorithm for Solving #2SAT on Cactus Formulas. | 0 | 0.34 | 2017 |
| The incremental satisfiability problem for a two conjunctive normal form. | 0 | 0.34 | 2016 |
| Model-based Algorithm for Belief Revisions between Normal Conjunctive Forms. | 0 | 0.34 | 2016 |
| A Polynomial Time Algorithm for Counting the Number of Independent Sets of Cactus Graphs | 0 | 0.34 | 2016 |
| An algorithm to approximate the chromatic number of graphs | 0 | 0.34 | 2015 |
| Finding Pure Nash Equilibrium For The Resource-Constrained Project Scheduling Problem | 0 | 0.34 | 2015 |
| Using Binary Patterns for Counting Falsifying Assignments of Conjunctive Forms | 1 | 0.36 | 2015 |
| Un algoritmo para calcular #2SAT | 0 | 0.34 | 2015 |
| A Parametric Polynomial Deterministic Algorithm for #2SAT. | 0 | 0.34 | 2015 |
| An Enumerative Algorithm for #2SAT. | 0 | 0.34 | 2014 |
| An Approximate Algorithm for the Chromatic Number of Graphs. | 1 | 0.63 | 2014 |
| Low - exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs. | 0 | 0.34 | 2014 |
| Counting Falsifying Assignments of Conjunctive Forms Using Binary Patterns. | 0 | 0.34 | 2014 |
| Predicting Preferences of Voters from Opinion Polls by Machine Learning and Game Theory | 1 | 0.37 | 2014 |
| An Empirical Study of Oversampling and Undersampling Methods for LCMine an Emerging Pattern Based Classifier. | 8 | 0.43 | 2013 |
| Recognizing Structural Patterns on Graphs for the Efficient Computation of #2SAT. | 0 | 0.34 | 2013 |
| A Logical Database for Geriatric Purposes. | 0 | 0.34 | 2013 |
| Recognizing 3-colorings cycle-patterns on graphs | 1 | 0.87 | 2013 |
| Job Shop Scheduling via Disjunctive Boolean Formulas. | 0 | 0.34 | 2012 |
| Edge covering of acyclic graphs. | 0 | 0.34 | 2012 |
| An Approximate Algorithm for the Chromatic Number of a Graph. | 0 | 0.34 | 2012 |
| Computing #2SAT and #2UNSAT by binary patterns | 1 | 0.37 | 2012 |
| A Note for Parametric Complexity of #2SAT. | 0 | 0.34 | 2011 |
| A Multiagent System for Modeling Democratic Elections. | 0 | 0.34 | 2011 |
| Efficient Computation of the Degree of Belief for a Subclass of Two Conjuctive Forms. | 1 | 0.38 | 2010 |
| Efficient computation of the degree of belief in a propositional theory. | 0 | 0.34 | 2008 |
| Agents's competition for selecting a representative. | 0 | 0.34 | 2008 |
| New Polynomial Classes For #2sat Established Via Graph-Topological Structure | 4 | 0.53 | 2007 |
| Efficient counting of models for boolean formulas represented by embedded cycles | 0 | 0.34 | 2007 |
| Latin-American Workshop on Non-Monotonic Reasoning, Proceedings of the LA-NMR06 Workshop, Facultad de Ingeniería de la Universidad Auónoma de San Luis Potí, San Luis Potosí, México, September 18, 2006 | 6 | 0.63 | 2006 |
| Polynomial Classes of Boolean Formulas for Computing the Degree of Belief | 3 | 0.48 | 2004 |
