Publications (13)

¹ Publicaciones consideradas como producción de la unidad.

View referenced research data.

in the year 2017 Remove filter
filter_list from 2017 to 2017 Computational Theory and Mathematics

2017

  1. A multi-objective optimization framework for multiple sequence alignment with metaheuristics

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. A program analysis framework for tccp based on abstract interpretation

    Formal Aspects of Computing, Vol. 29, Núm. 3, pp. 531-557

  3. A simulation tool for tccp programs

    Electronic Proceedings in Theoretical Computer Science, EPTCS

  4. An improved problem aware local search algorithm for the DNA fragment assembly problem

    Soft Computing, Vol. 21, Núm. 7, pp. 1709-1720

  5. Fast(er) reasoning in interval temporal logic

    Leibniz International Proceedings in Informatics, LIPIcs

  6. Formation of the D-basis from implicational systems using Simplification logic

    International Journal of General Systems, Vol. 46, Núm. 5, pp. 547-568

  7. GTS families for the flexible composition of graph transformation systems

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  8. Horn fragments of the Halpern-Shoham interval temporal logic

    ACM Transactions on Computational Logic, Vol. 18, Núm. 3

  9. On grid aware refinement of the unit hypercube and simplex: Focus on the complete tree size

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  10. On reductants in the framework of multi-adjoint logic programming

    Fuzzy Sets and Systems, Vol. 317, pp. 27-43

  11. On the properties of atom definability and well-supportedness in logic programming

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  12. The Problem Aware Local Search algorithm: an efficient technique for permutation-based problems

    Soft Computing, Vol. 21, Núm. 18, pp. 5193-5206

  13. Verifying timed BPMN processes using Maude

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)