Jose Divasón

Neurocomputing, December, 2023

Artificial Intelligence Models for Assessing the Evaluation Process of Complex Student Projects.

[BibT_eX]

[DOI]

Miguel Ángel Marco Buzunáriz

Eduardo Sáenz-de-Cabezón

IEEE Trans. Learn. Technol., October, 2023

Effective Homology of Universal Covers.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, June, 2023

PSO-PARSIMONY: A method for finding parsimonious and accurate machine learning models with particle swarm optimization. Application for predicting force-displacement curves in T-stub steel connections.

[BibT_eX]

[DOI]

Julio Fernández-Ceniceros

Andrés Sanz-García

Francisco Javier Martínez de Pisón

Neurocomputing, 2023

Sensitivity analysis of discrete preference functions using Koszul simplicial complexes.

[BibT_eX]

[DOI]

Fatemeh Mohammadi

Eduardo Sáenz-de-Cabezón

Henry P. Wynn

Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Varroa Mite Detection Using Deep Learning Techniques.

[BibT_eX]

[DOI]

Francisco Javier Martínez de Pisón

Pilar Santolaria

Jesús Yániz

Proceedings of the Hybrid Artificial Intelligent Systems - 18th International Conference, 2023

Hybrid Intelligent Parsimony Search in Small High-Dimensional Datasets.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Artificial Intelligent Systems - 18th International Conference, 2023

Robustness Analysis of a Methodology to Detect Biases, Inconsistencies and Discrepancies in the Evaluation Process.

[BibT_eX]

[DOI]

Francisco Javier Martínez de Pisón

Eduardo Sáenz-de-Cabezón

Proceedings of the International Joint Conference 16th International Conference on Computational Intelligence in Security for Information Systems (CISIS 2023) 14th International Conference on EUropean Transnational Education (ICEUTE 2023), 2023

2022

Correction to: A Formalization of the Smith Normal Form in Higher-Order Logic.

[BibT_eX]

[DOI]

J. Autom. Reason., 2022

A Formalization of the Smith Normal Form in Higher-Order Logic.

[BibT_eX]

[DOI]

J. Autom. Reason., 2022

New Hybrid Methodology Based on Particle Swarm Optimization with Genetic Algorithms to Improve the Search of Parsimonious Models in High-Dimensional Databases.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Artificial Intelligent Systems - 17th International Conference, 2022

2021

Computing invariants for multipersistence via spectral systems and effective homology.

[BibT_eX]

[DOI]

J. Symb. Comput., 2021

Two algorithms based on modular arithmetic: lattice basis reduction and Hermite normal form computation.

[BibT_eX]

[DOI]

Ralph Bottesch

Arch. Formal Proofs, 2021

2020

Formalizing the LLL Basis Reduction Algorithm and the LLL Factorization Algorithm in Isabelle/HOL.

[BibT_eX]

[DOI]

J. Autom. Reason., 2020

A Verified Implementation of the Berlekamp-Zassenhaus Factorization Algorithm.

[BibT_eX]

[DOI]

J. Autom. Reason., 2020

A verified algorithm for computing the Smith normal form of a matrix.

[BibT_eX]

[DOI]

Arch. Formal Proofs, 2020

2019

A Kenzo interface for algebraic topology computations in SageMath.

[BibT_eX]

[DOI]

Julián Cuevas-Rozo

Miguel Ángel Marco Buzunáriz

ACM Commun. Comput. Algebra, 2019

Using Krakatoa for Teaching Formal Verification of Java Programs.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods Teaching - Third International Workshop and Tutorial, 2019

Computing Multipersistence by Means of Spectral Systems.

[BibT_eX]

[DOI]

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018

A verified factorization algorithm for integer polynomials with polynomial complexity.

[BibT_eX]

[DOI]

Arch. Formal Proofs, 2018

A verified LLL algorithm.

[BibT_eX]

[DOI]

Arch. Formal Proofs, 2018

A Formalization of the LLL Basis Reduction Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

Experiences and new alternatives for teaching formal verification of Java programs.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, 2018

Efficient certification of complexity proofs: formalizing the Perron-Frobenius theorem (invited talk paper).

[BibT_eX]

[DOI]

Ondrej Kuncar

Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018

A Formal Proof of the Computation of Hermite Normal Form in a General Setting.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Symbolic Computation, 2018

2017

A Formalisation in HOL of the Fundamental Theorem of Linear Algebra and Its Application to the Solution of the Least Squares Problem.

[BibT_eX]

[DOI]

J. Autom. Reason., 2017

A formalization of the Berlekamp-Zassenhaus factorization algorithm.

[BibT_eX]

[DOI]

Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2016

Formalisation of the computation of the echelon form of a matrix in Isabelle/HOL.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2016

Perron-Frobenius Theorem for Spectral Radius Analysis.

[BibT_eX]

[DOI]

Arch. Formal Proofs, 2016

The Factorization Algorithm of Berlekamp and Zassenhaus.

[BibT_eX]

[DOI]

Arch. Formal Proofs, 2016

2015

Formalisation in higher-order logic and code generation to functional languages of the Gauss-Jordan algorithm.

[BibT_eX]

[DOI]

J. Funct. Program., 2015

Hermite Normal Form.

[BibT_eX]

[DOI]

Arch. Formal Proofs, 2015

Echelon Form.

[BibT_eX]

[DOI]

Arch. Formal Proofs, 2015

QR Decomposition.

[BibT_eX]

[DOI]

Arch. Formal Proofs, 2015

Generalizing a Mathematical Analysis Library in Isabelle/HOL.

[BibT_eX]

[DOI]

Proceedings of the NASA Formal Methods - 7th International Symposium, 2015

2014

Applications of the Gauss-Jordan algorithm, done right.

[BibT_eX]

[DOI]

CoRR, 2014

Gauss-Jordan Algorithm and Its Applications.

[BibT_eX]

[DOI]

Arch. Formal Proofs, 2014

Obtaining an ACL2 Specification from an Isabelle/HOL Theory.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Symbolic Computation, 2014

2013

Rank-Nullity Theorem in Linear Algebra.

[BibT_eX]

[DOI]

Arch. Formal Proofs, 2013

Formalization and Execution of Linear Algebra: From Theorems to Algorithms.

[BibT_eX]

[DOI]