Meliza Contreras González

Orcid: 0000-0003-3375-4493

According to our database1, Meliza Contreras González authored at least 25 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Extreme Topologies on Bipolygonal Graphs and Dinamic Trees.
Int. J. Comb. Optim. Probl. Informatics, 2023

2021
Caracterización de complejidad semántica en pasajes tipo TOEFL.
Rev. Colomb. de Computación, 2021

Inferential Rules for Identifying Answers in TOEFL Texts.
Proceedings of the Pattern Recognition - 13th Mexican Conference, 2021

2020
Algoritmo para el conteo de modelos en FNC.
Res. Comput. Sci., 2020

Approaches to EEG-based Brain-Computer Interfaces: A Survey.
Res. Comput. Sci., 2020

Knowledge Representation in TOEFL Expository Texts.
Computación y Sistemas, 2020

Basic Pattern Graphs for the Efficient Computation of Its Number of Independent Sets.
Proceedings of the Pattern Recognition - 12th Mexican Conference, 2020

2019
Algoritmo basado en reglas de asociación para la extracción de relaciones no taxonómicas en corpus de dominio.
Res. Comput. Sci., 2019

Cognitive relations for argumentative texts.
Proceedings of the Twelfth Latin American Workshop on Logic/Languages, 2019

2018
Belief revision between conjunctive normal forms.
J. Intell. Fuzzy Syst., 2018

Modelling 3-Coloring of Outerplanar Graphs via Incremental Satisfiability.
Electron. Notes Discret. Math., 2018

Validation of Semantic Relation of Synonymy in Domain Ontologies Using Lexico-Syntactic Patterns and Acronyms.
Proceedings of the Pattern Recognition - 10th Mexican Conference, 2018

Knowledge representation of passages type TOEFL.
Proceedings of the Eleventh Latin American Workshop on Logic/Languages, 2018

2016
Applying an Incremental Satisfiability Algorithm to Automatic Test Pattern Generation.
Res. Comput. Sci., 2016

Visualización de elementos de Cienciometría con grafos.
Res. Comput. Sci., 2016

Efficient Counting of the Number of Independent Sets on Polygonal Trees.
Proceedings of the Pattern Recognition - 8th Mexican Conference, 2016

2013
Recognizing Structural Patterns on Graphs for the Efficient Computation of #2SAT.
Proceedings of the Pattern Recognition - 5th Mexican Conference, 2013

2012
Detection of inconsistencies in knowledge bases for emission of foreign judgments.
Proceedings of the Eighth Latin American Workshop on Logic / Languages, 2012

Generation of instances for the revision of beliefs.
Proceedings of the Workshop Proceedings of the 8th International Conference on Intelligent Environments, 2012

2011
An Introduction to Belief Revision and Knowledge Representation with 2CNF.
Proceedings of the Seventh Latin American Workshop on Non-Monotonic Reasoning, 2011

A Multiagent System for Modeling Democratic Elections.
Proceedings of the Twenty-Fourth International Florida Artificial Intelligence Research Society Conference, 2011

2008
Agents's competition for selecting a representative.
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.
Eng. Lett., 2007

Efficient counting of models for boolean formulas represented by embedded cycles.
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

2006
A Polynomial Graphical Reduction to Speed Up the Counting of Models for Boolean Formulas.
Proceedings of the LoLaCOM06 Workshop, Instituto Tecnológico de Apizaco, Apizaco, Tlaxcala, Mexico, 13th, 2006


  Loading...