Angel Cuenca-Ortega

Dr. Angel Cuenca-Ortega


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 May 2019
Verified
Book Chapter
Closed access
PDF file
MAMaría Alpuente
María Alpuente
DBDemis Ballis
Demis Ballis
ACAngel Cuenca-Ortega
Angel Cuenca-Ortega
SESantiago Escobar
Santiago Escobar
JMJosé Meseguer
José Meseguer

24 August 2017 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
MAM. Alpuente
M. Alpuente
SESantiago Escobar
Santiago Escobar
JSJ. Sapiña
J. Sapiña
ACAngel Cuenca-Ortega
Angel Cuenca-Ortega
This paper introducesGLINTS, a graphical tool for exploring variant narrowing computations in Maude. The most recent version of Maude, version 2.7.1, provides quite sophisticated unification features, including order-sorted equational unification for convergent theories modulo axioms such as associativity, commutativity, and identity. This novel equational unification relies on built-in generation of the set ofvariantsof a termt, i.e., the canonical form oftσ for a computed substitution σ. Variant generation relies on a novel narrowing strategy calledfolding variant narrowingthat opens up new applications in formal reasoning, theorem proving, testing, protocol analysis, and model checking, especially when the theory satisfies thefinite variant property, i.e., there is a finite number of most general variants for every term in the theory. However, variant narrowing computations can be extremely involved and are simply presented in text format by Maude, often being too heavy to be debugged or even understood. TheGLINTSsystem provides support for (i) determining whether a given theory satisfies the finite variant property, (ii) thoroughly exploring variant narrowing computations, (iii) automatic checking of nodeembeddingandclosednessmodulo axioms, and (iv) querying and inspecting selected parts of the variant trees.

25 July 2017 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
MAMaría Alpuente
María Alpuente
ACAngel Cuenca-Ortega
Angel Cuenca-Ortega
SESantiago Escobar
Santiago Escobar
JMJosé Meseguer
José Meseguer

28 November 2018 in arXiv
Verified
Preprint
Open access
PDF file
MAMaría Alpuente
María Alpuente
ACAngel Cuenca-Ortega
Angel Cuenca-Ortega
SESantiago Escobar
Santiago Escobar
JMJosé Meseguer
José Meseguer
The Homeomorphic Embedding relation has been amply used for defining termination criteria of symbolic methods for program analysis, transformation, and verification. However, homeomorphic embedding has never been investigated in the context of order-sorted rewrite theories that support symbolic execution methods modulo equational axioms. This paper generalizes the symbolic homeomorphic embedding relation to order-sorted rewrite theories that may contain various combinations of associativity and/or commutativity axioms for different binary operators. We systematically measure the performance of increasingly efficient formulations of the homeomorphic embedding relation modulo associativity and commutativity axioms. From our experimental results, we conclude that our most efficient version indeed pays off in practice.

18 July 2017 in arXiv
Verified
Preprint
Open access
PDF file
MAMaría Alpuente
María Alpuente
ACAngel Cuenca-Ortega
Angel Cuenca-Ortega
SESantiago Escobar
Santiago Escobar
JSJulia Sapiña
Julia Sapiña
This paper introduces GLINTS, a graphical tool for exploring variant narrowing computations in Maude. The most recent version of Maude, version 2.7.1, provides quite sophisticated unification features, including order-sorted equational unification for convergent theories modulo axioms such as associativity, commutativity, and identity (ACU). This novel equational unification relies on built-in generation of the set of 'variants' of a term $t$, i.e., the canonical form of $t \sigma$ for a computed substitution $\sigma$. Variant generation relies on a novel narrowing strategy called 'folding variant narrowing' that opens up new applications in formal reasoning, theorem proving, testing, protocol analysis, and model checking, especially when the theory satisfies the 'finite variant property', i.e., there is a finite number of most general variants for every term in the theory. However, variant narrowing computations can be extremely involved and are simply presented in text format by Maude, often being too heavy to be debugged or even understood. The GLINTS system provides support for (i) determining whether a given theory satisfies the finite variant property, (ii) thoroughly exploring variant narrowing computations, (iii) automatic checking of node 'embedding' and 'closedness' modulo axioms, and (iv) querying and inspecting selected parts of the variant trees. This paper is under consideration for acceptance in TPLP.

10 February 2025 in REVISTA ODIGOS
Verified
Journal Article
Open access
PDF file
MMMaría Fernanda Molina-Miranda
María Fernanda Molina-Miranda
ACAngel Cuenca-Ortega
Angel Cuenca-Ortega
LPLuis Espín Pazmiño
Luis Espín Pazmiño
MVMiguel Molina Villacís
Miguel Molina Villacís
Las licitaciones públicas permiten a las instituciones contratar bienes, obras y servicios esenciales para el crecimiento del país. Este trabajo consistió en analizar los procesos de licitaciones públicas en Ecuador mediante la aplicación de técnicas de aprendizaje automático y explicabilidad de modelos, con el fin de mejorar la toma de decisiones. Se recopiló y procesó un conjunto de datos abiertos extraídos de la base de datos del SERCOP para identificar patrones y variables clave que influyeron en el éxito de las licitaciones. Utilizando modelos de clasificación como Random Forest, AdaBoost y CatBoost, y técnicas de explicabilidad como SHAP y Feature Importance, se desarrollaron modelos predictivos que permiten comprender de manera transparente las decisiones generadas por los algoritmos. Los resultados mostraron que CatBoost fue el modelo con mayor precisión predictiva y Feature Importance resultó ser la técnica más efectiva para explicar las predicciones. Además, se procedió a crear una interfaz web que permitió ingresar los datos de entrada y determinar si es recomendable que una empresa participe en una licitación. La inteligencia artificial explicable no solo mejora la precisión, sino que también proporciona información valiosa para que las empresas optimicen su participación en estos procesos.