Meliza Contreras

Validation of Semantic Relation of Synonymy in Domain Ontologies Using Lexico-Syntactic Patterns and Acronyms.

Synonymy is a relation of equivalence between the meanings of one or more words which allows the use of any word in an equivalent way depending on the context. Given the difficulty of defining the concordance between the meanings, the Natural Language Processing has focused on researching computational techniques that allow defining pairs of synonyms automatically. In this paper, a method based on lexico-syntactic patterns is proposed for the validation of semantic relations of synonymy between ontological concepts. An acronym will be considered a type of synonym within our paper. The results obtained by our proposed method were compared with the criterion of three experts, resulting above 80% of accuracy in the concordances of opinion between what is marked by the experts and the results of our proposed method.

Modelling 3-Coloring of Outerplanar Graphs via Incremental Satisfiability

Abstract A novel method to model the problem of 3-coloring on outerplanar graphs is presented. The proposal is based on the specification of the logical constraints for the 3-coloring of an outerplanar graph in a dinaymic way, resulting in a polynomial-time instance of the incremental satisfiability problem. This proposal can be extended to consider other polynomial-time instances of the 3-coloring problem.

Efficient Counting of the Number of Independent Sets on Polygonal Trees

We present a method to compute the number of independent sets for two basic graph patterns: simple cycles and trees. We show how to extend this initial method for processing efficiently more complex graph topologies.

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

To count models for two conjunctive forms (#2SAT problem) is a classic #P problem. We determine different structural patterns on the underlying graph of a 2-CF F allowing the efficient computation of #2SAT(F ). We show that if the constrained graph of a formula is acyclic or the cycles on the graph can be arranged as independent and embedded cycles, then the number of models of F can be counted efficiently.To count models for two conjunctive forms (#2SAT problem) is a classic #P problem. We determine different structural patterns on the underlying graph of a 2-CF F allowing the efficient computation of #2SAT(F).