Pasar al contenido principal

RAZONAMIENTO AUTOMATICO Y APRENDIZAJE CON INDUCCION DE CONOCIMIENTO

PID2020-116201GB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2020
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDADE DA CORUÑA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 19
Encontrada(s) 1 página(s)

RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Computational approaches to Explainable Artificial Intelligence: Advances in theory, applications and trends

  • Górriz, J.M.
  • Álvarez-Illán, I.
  • Álvarez-Marquina, A.
  • Arco, J.E.
  • Atzmueller, M.
  • Ballarini, F.
  • Barakova, E.
  • Bologna, G.
  • Bonomini, P.
  • Castellanos-Dominguez, G.
  • Castillo-Barnes, D.
  • Cho, S.B.
  • Contreras, R.
  • Cuadra, J.M.
  • Domínguez, E.
  • Domínguez-Mateos, F.
  • Duro, R.J.
  • Elizondo, D.
  • Fernández-Caballero, Antonio
  • Fernandez-Jover, E.
  • Formoso, M.A.
  • Gallego-Molina, N.J.
  • Gamazo, J.
  • García González, J.
  • Garcia-Rodriguez, Jose
  • Garre, C.
  • Garrigós, J.
  • Gómez-Rodellar, A.
  • Gómez-Vilda, P.
  • Graña, M.
  • Guerrero-Rodriguez, Byron
  • Hendrikse, S.C.F.
  • Jimenez-Mesa, C.
  • Jodra-Chuan, M.
  • Julián, Vicente
  • Kotz, G.
  • Kutt, K.
  • Leming, M.
  • Lope, J. de
  • Macas, B.
  • Marrero-Aguiar, V.
  • Martinez, J.J.
  • Martinez-Murcia, F.J.
  • Martínez-Tomás, R.
  • Mekyska, J.
  • Nalepa, Grzegorz J.
  • Novais, Paulo
  • Orellana, D.
  • Ortiz, A.
  • Palacios-Alonso, Daniel
  • Palma, J.
  • Pereira, A.
  • Pinacho-Davidson, P.
  • Pinninghoff, M.A.
  • Ponticorvo, M.
  • Psarrou, A.
  • Ramírez, J.
  • Rincón, M.
  • Rodellar-Biarge, V.
  • Rodríguez-Rodríguez, I.
  • Roelofsma, P.H.M.P.
  • Santos, J.
  • Salas-Gonzalez, D.
  • Salcedo-Lagos, P.
  • Segovia, F.
  • Shoeibi, A.
  • Silva, M.
  • Simic, D.
  • Suckling, J.
  • Treur, J.
  • Tsanas, A.
  • Varela, R.
  • Wang, S.H.
  • Wang, W.
  • Zhang, Y.D.
  • Zhu, H.
  • Zhu, Z.
  • Ferrández-Vicente, J.M.
  • Garcia-Rodriguez, Jose|||/items/d5bc18f8-44db-4723-b291-5849321e9e69
Deep Learning (DL), a groundbreaking branch of Machine Learning (ML), has emerged as a driving force in both theoretical and applied Artificial Intelligence (AI). DL algorithms, rooted in complex and non-linear artificial neural systems, excel at extracting high-level features from data. DL has demonstrated human-level performance in real-world tasks, including clinical diagnostics, and has unlocked solutions to previously intractable problems in virtual agent design, robotics, genomics, neuroimaging, computer vision, and industrial automation. In this paper, the most relevant advances from the last few years in Artificial Intelligence (AI) and several applications to neuroscience, neuroimaging, computer vision, and robotics are presented, reviewed and discussed. In this way, we summarize the state-of-the-art in AI methods, models and applications within a collection of works presented at the 9 International Conference on the Interplay between Natural and Artificial Computation (IWINAC). The works presented in this paper are excellent examples of new scientific discoveries made in laboratories that have successfully transitioned to real-life applications.
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Niching methods integrated with a differential evolution memetic algorithm for protein structure prediction

  • Varela, Daniel
  • Santos Reyes, José
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: A memetic version between an evolutionary algorithm (differential evolution) and the local search provided by protein fragment replacements was defined for protein structure prediction. In this problem, it is intended to find the global minimum in a high-dimensional energy landscape to discover the native structure of the protein. This problem presents a multimodal energy landscape which can additionally present deceptiveness when searching for the protein structure with minimum energy. One strategy is to try to obtain a diverse set of optimized and different protein conformations, which can be located in different local minima of the energy landscape. For this purpose, different niching methods (crowding, fitness sharing and speciation) were integrated into the memetic algorithm. The integration of niching makes it possible to obtain in a straightforward way a diverse set of optimized and structurally different protein conformations. Compared to previous studies, as well as to the widely used Rosetta protein structure prediction method, the potential solutions offered here present a diverse set of folds with different distances (RMSD) from the real native conformation, with wide RMSD distributions, and obtaining conformations closer to the native structure (in RMSD values) in some proteins., This study was funded by the Xunta de Galicia and the European Union (European Regional Development Fund - Galicia 2014–2020 Program), with grants CITIC (ED431G 2019/01), GPC ED431B 2019/03 and IN845D-02 (funded by the “Agencia Gallega de Innovación”, co-financed by Feder funds, supported by the “Consellería de Economía, Empleo e Industria” of Xunta de Galicia), and by the Spanish Ministry of Science and Innovation (project PID2020-116201GB-I00)., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; GPC ED431B 2019/03, Xunta de Galicia; IN845D-02
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Variable selection in the prediction of business failure using genetic programming

  • Beade, Angel
  • Rodríguez López, Manuel
  • Santos Reyes, José
This study was funded by the European Union (European Regional Development Fund - Galicia 2014-2020 Program) and Xunta de Galicia, with grants GPC ED431B 2022/33 and CITIC (ED431G 2019/01), and by the Spanish Ministry of Science and Innovation (project PID2020- 116201GB-I00)., Xunta de Galicia; ED431B 2022/33, Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Business failure prediction models with high and stable predictive power over time using genetic programming

  • Beade, Angel
  • Rodríguez López, Manuel
  • Santos Reyes, José
[Abstract]: This study focuses on the deterioration of the predictive power and the analysis of the predictive stability of business failure prediction models, an aspect not sufficiently analysed in previous research. Insolvency prediction is considered with three temporal horizons (1 year, 3 years and 5 years prior to failure). The Genetic Programming (GP) tool has been used to achieve prediction models with high performance and stability over time, considering a long post-learning period in the stability analysis. In addition, novel scenarios representative of actual model use are proposed and considered, as well as metrics to assess the deterioration of the models’ predictive power. The optimised GP prediction models (in the three temporal horizons) present a higher performance with respect to external references and, more importantly in relation to the objective of our study, the selected GP models substantially improve on the stability reported in previous studies, meeting the pursued requirements of degree of deterioration (less than 5%) and stability (Pearson’s coefficient of variation less than 5%). Thus, the predictions of the GP models after the learning are very stable (period 2008–2019), to a certain extent immune, with respect to their environment, responding adequately in both procyclical and countercyclical modes, all of which is particularly relevant as this period includes a strong recession and a strong recovery. This should help to increase the reliability of business failure prediction models. Moreover, the relevance of including variables other than the usual financial ratios as predictors of failure is confirmed., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This study was funded by the Xunta de Galicia and the European Union (European Regional Development Fund - Galicia 2014–2020 Program), with grants CITIC (ED431G 2023/01) and GPC ED431B 2022/33, and by the Spanish Ministry of Science and Innovation (projects PID2020-116201GB-I00 and PID2023-148531NB-I00). Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature., Xunta de Galicia; ED431G 2023/01, Xunta de Galicia; ED431B 2022/33
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Representing and solving spatial problems

  • Santos, Paulo E.
  • Cabalar, Pedro
  • Falomir, Zoe
  • Tenbrink, Thora
[Abstract]: Everyday life unfolds in both space and time, with our spatialexperiences playing a central role in our interactions with theworld. To grasp human cognition, it s essential to understandhow we perceive spatial relationships and tackle spatio-temporalchallenges. Over the past few decades, research in spatial cogni-tion has made significant strides, particularly in developing com-putational methods for knowledge representation and reasoning.This special issue explores various approaches to formalizing,implementing, and automating solutions for spatial problems. In this introduction, we provide a current literature review tocontextualize the three contributions featured in this issue., The work was supported by the Spanish Ministry of Science and Innovation, Spain, MCIN/AEI/10.13039/501100011033 (grant PID2020- 116201GB-I00), by Xunta de Galicia, Spain andthe European Union (grant GPC ED431B 2022/33) and by project LIANDA - BBVAFoundation Grants for Scientific Research Projects Wallenberg AI, Autonomous Systemsand Software Program (WASP) awarded by the Knut and Alice Wallenberg Foundation,Sweden. Zoe Falomir acknowledges funding by the Wallenberg AI, Autonomous Systemsand Software Program (WASP) awarded by the Knut and Alice Wallenberg Foundation,Sweden. Thora Tenbrink acknowledges funding by the SellSTEM MSCA ITN Project No.956124. Pedro Cabalar acknowledges funding by Spanish Ministry of Science and Innovation,Spain, MCIN/AEI/10.13039/501100011033 (grant PID2020-116201GB-I00), by Xunta deGalicia, Spain and the European Union (grant GPC ED431B 2022/33) and by projectLIANDA - BBVA Foundation Grants for Scientific Research Projects., Xunta de Galicia; ED431B 2022/33
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Protein structure prediction with energy minimization and deep learning approaches

  • Filgueiras Rilo, Juan Luis
  • Varela, Daniel
  • Santos Reyes, José
Financiado para publicación en acceso aberto: CRUE-CSIC/Springer Nature, [Abstract]: In this paper we discuss the advantages and problems of two alternatives for ab initio protein structure prediction. On one hand, recent approaches based on deep learning, which have significantly improved prediction results for a wide variety of proteins, are discussed. On the other hand, methods based on protein conformational energy minimization and with different search strategies are analyzed. In this latter case, our methods based on a memetic combination between differential evolution and the fragment replacement technique are included, incorporating also the possibility of niching in the evolutionary search. Different proteins have been used to analyze the pros and cons in both approaches, proposing possibilities of integration of both alternatives., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This study was funded by the Xunta de Galicia and the European Union (European Regional Development Fund - Galicia 2014-2020 Program), with grants CITIC (ED431G 2019/01), GPC ED431B 2022/33 and IN845D-02 (funded by the “Agencia Gallega de Innovación”, co-financed by Feder funds, supported by the “Consellería de Economía, Empleo e Industria” of Xunta de Galicia), and by the Spanish Ministry of Science and Innovation (project PID2020-116201GB-I00)., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431B 2022/33, Xunta de Galicia; IN845D-02
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Variable selection in the prediction of business failure using genetic programming

  • Beade, José
  • Rodríguez Seijo, José Manuel
  • Santos Reyes, José
This study focuses on dimensionality reduction by variable selection in business failure prediction models. A new method of dimensionality reduction by variable selection using Genetic Programming is proposed, which takes into account the relative frequency of occurrence of the explanatory variables in the evolved solutions, as well as the statistical relevance of that frequency. For a better evaluation of the proposed method and its comparison with other well-tested and widely used variable selection methods, the prediction of business failure in three temporal horizons (1, 5 and 9 years prior to failure) is considered. Additionally, a comparison of the sets of variables selected with different feature selection methods is performed, also considering different classifiers in the comparison, among which Genetic Programming is included as a classifier. The results indicate that the proposed method (using Genetic Programming as a variable selection method) is superior to the most tested and widely used methods analyzed, and this superiority increases if Genetic Programming is also used as a classification method., This study was funded by the European Union (European Regional Development Fund - Galicia 2014-2020 Program) and Xunta de Galicia, with grants GPC ED431B 2022/33 and CITIC (ED431G 2019/01), and by the Spanish Ministry of Science and Innovation (project PID2020-116201GB-I00)., Xunta de Galicia; ED431B 2022/33, Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Genetic programming for feature selection in business failure prediction. Comparison of the use of financial variables and economic environment variables

  • Beade, Angel
  • Rodríguez López, Manuel
  • Santos Reyes, José
[Abstract]: In this work we have experimented with the use of genetic programming as a feature selection method as well as a classifier to obtain business failure prediction models with different prediction temporal horizons. In the prediction models, a wide set of explanatory variables has been used, all of them based on the annual accounts of the company. In addition, an extended set of explanatory variables incorporating variables from the economic environment has been considered. Comparison of the prediction results between these alternatives shows a trend towards better results using the feature selection process, while there is no trend towards better results using economic environment variables., This study was funded by the Spanish Ministry of Science and Innovation (projects PID2020-116201GB-I00 and PID2023-148531NB-I00), the European Union (Galicia 2014-2020 Program - European Regional Development Fund) and Xunta de Galicia, grant GPC ED431B 2022/33. Moreover, CITIC, as a center accredited for excellence within the Galician University System and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of the Xunta de Galicia. Additionally, it is co-financed by the EU through the FEDER Galicia 2021-27 operational program (Ref. ED431G 2023/01), Xunta de Galicia; ED431B 2022/33, Xunta de Galicia; ED431G 2023/01
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Syntactic ASP forgetting with forks

  • Aguado, Felicidad
  • Cabalar, Pedro
  • Fandiño, Jorge
  • Pearce, David
  • Pérez, Gilberto
  • Vidal, Concepción
[Abstract]: Answer Set Programming (ASP) constitutes nowadays one of the most successful paradigms for practical Knowledge Representation and declarative problem solving. The formal analysis of ASP programs is essential for a rigorous treatment of specifications, the correct construction of solvers and the extension with other representational features. In this paper, we present a syntactic transformation, called the unfolding operator, that allows forgetting an atom in a logic program (under ASP semantics). The main advantage of unfolding is that, unlike other syntactic operators, it is always applicable and guarantees strong persistence, that is, the result preserves the same stable models with respect to any context where the forgotten atom does not occur. The price for its completeness is that the result is an expression that may contain the fork operator. Yet, we illustrate how, in some cases, the application of fork properties may allow us to reduce the fork to a logic program., We want to thank the anonymous reviewers for their suggestions that helped to improve this paper. Partially funded by Regional Government of Galicia and the European Union, grants CITIC (ED431G 2019/01), GPC ED431B 2022/33, by the Spanish Ministry of Science and Innovation, Spain, MCIN/AEI/10.13039/501100011033 (grant PID2020-116201GB-I00), by BBVA Foundation, Scientific Research Grants, (project LIANDA), and by the National Science Foundation (NSF 95-3101-0060-402)., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431B 2022/33, United States. National Science Foundation; 95-3101-0060-402
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Metric dynamic equilibrium logic

  • Becker, Arvid
  • Cabalar, Pedro
  • Diéguez Lodeiro, Martín
  • Farinas del Cerro, Luis
  • Schaub, Torsten
  • Schuhmann, Anna
[Abstract]: In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behaviour of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times associated with each state. In many applications, however, timing constraints are important like, for instance, when planning and scheduling go hand in hand. We address this by developing a metric extension of linear-time Dynamic Equilibrium Logic, in which dynamic operators are constrained by intervals over integers. The resulting Metric Dynamic Equilibrium Logic provides the foundation of an ASP-based approach for specifying qualitative and quantitative dynamic constraints. As such, it constitutes the most general among a whole spectrum of temporal extensions of Equilibrium Logic. In detail, we show that it encompasses Temporal, Dynamic, Metric and regular Equilibrium Logic, as well as its classic counterparts once the law of the excluded middle is added., This work was supported by MICINN, Spain, grant PID2020-116201GB-I00, Xunta de Galicia, Spain (GPC ED431B 2019/03), Fundación BBVA (LIANDA research project), Spain, Région Pays de la Loire, France (EL4HC and étoiles montantes CTASP), DFG grant SCHA 550/15, Germany and European Union COST action CA-17124.
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Compiling Metric Temporal Answer Set Programming

  • Becker, Arvid
  • Cabalar, Pedro
  • Diéguez Lodeiro, Martín
  • Romero Davila, Javier
  • Hahn, Susana
  • Schaub, Torsten
Presented in the following conference: LPNMR 2024: 17th International Conference on Logic Programming and Nonmonotonic Reasoning, Dallas, TX, USA, October 11–14, 2024, This version of the conference paper has been accepted for publication, after peer review; it is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/978-3-031-74209-5_2., [Abstract]: We develop a computational approach to Metric Answer Set Programming (ASP) to allow for expressing quantitative temporal constrains, like durations and deadlines. A central challenge is to maintain scalability when dealing with fine-grained timing constraints, which can significantly exacerbate ASP’s grounding bottleneck. To address this issue, we leverage extensions of ASP with difference constraints, a simplified form of linear constraints, to handle time-related aspects externally. Our approach effectively decouples metric ASP from the granularity of time, resulting in a solution that is unaffected by time precision., This work was partially funded by DFG grant SCHA 550/15, Etoiles Montantes CTASP at Region Pays de la Loire, Xunta de Galicia grant GPC ED431B 2022/33, and MCIN AEI/10.13039/501100011033 grant PID2020-116201GB-I00., Xunta de Galicia; ED431B 2022/33, Germany. Deutsche Forschungsgemeinschaft (DFG); SCHA 550/15
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Tackling Temporal Deontic Challenges with Equilibrium Logic

  • Soldà, Davide
  • Cabalar, Pedro
  • Ciabattoni, Agata
  • Neufeld, Emery
Trabajo presentado a: 24th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2025), Detroit, Michigan, USA, May 19 – 23, 2025., [Abstract]: Combining temporal reasoning with normative requirements presents significant challenges. In this paper, we tackle the most relevant challenges in the literature from a computational perspective, using Answer Set Programming (ASP). We integrate Temporal Equilibrium Logic, the foundation of Temporal ASP, with Deontic Equilibrium Logic with Explicit Negation, to reason about norms in a temporal context. Our approach is validated by: (i) addressing key benchmarks for temporal normative systems, providing (ii) a normal form reduction that enables the use of existing tools, and (iii) a polynomial LTL reduction for a relevant logic fragment., The project leading to this application has received funding from (i) the European Union’s Horizon 2020 research and innovation programme under grant agreement No 10.1034440, (ii) the Vienna Science and Technology funds (WWTF) projects 10.47379/ICT22- 023 and 10.47379/ICT23030, and (iii) the Spanish Ministry of Science, Innovation and Universities, grants PID2020-116201GB-I00 and PID2023-148531NB-I00., Austria. Vienna Science and Technology funds (WWTF); 10.47379/ICT22-023, Austria. Vienna Science and Technology funds (WWTF); 10.47379/ICT23030
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

A Fixpoint Characterisation of Temporal Equilibrium Logic

  • Cabalar, Pedro
  • Diéguez Lodeiro, Martín
  • Laferrière, François
  • Schaub, Torsten
  • Stéphan, Igor
Presented in the following conference: LPNMR 2024: 17th International Conference on Logic Programming and Nonmonotonic Reasoning, Dallas, TX, USA, October 11–14, 2024, This version of the conference paper has been accepted for publication, after peer review; it is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/978-3-031-74209-5_23., [Abstract]: Connections of intuitionistic and intermediate logics with logic programming have been extensively studied in the literature. Among the different results in the literature we find equilibrium logic (Pearce, 1996) and Safe beliefs (Osorio et al., 2005). Pearce’s approach admits a characterisation in terms of a fixpoint (consequence) operator on the here-and-there intermediate logic (Heyting, 1930), which is similar to the notion of theory completion in default and autoepistemic logics. Osorio’s safe beliefs are also given in terms of a fixpoint operator under intuitionistic logic semantics. In this latter case, intuitionistic logic can be replaced by any intermediate logic without altering the result. In this paper we consider temporal equilibrium logic, an combination of equilibrium logic and linear-time temporal logic. In this context we extend Pearce’s and Osorio’s approach to temporal case and we discuss the relation of intuitionistic temporal logic and temporal logic programming., This work was partially funded by DFG grant SCHA 550/15 (Germany), Etoiles Montantes CTASP at Region Pays de la Loire (France), Xunta de Galicia grant GPC ED431B 2022/33, and MCIN AEI/10.13039/501100011033 grant PID2020-116201GB-I00 (Spain)., Xunta de Galicia; ED431B 2022/33, Germany. Deutsche Forschungsgemeinschaft (DFG); SCHA 550/15
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Evolving Cellular Automata Schemes for Protein Folding Modeling Using the Rosetta Atomic Representation

  • Varela, Daniel
  • Santos Reyes, José
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG , [Abstract] Protein folding is the dynamic process by which a protein folds into its final native structure. This is different to the traditional problem of the prediction of the final protein structure, since it requires a modeling of how protein components interact over time to obtain the final folded structure. In this study we test whether a model of the folding process can be obtained exclusively through machine learning. To this end, protein folding is considered as an emergent process and the cellular automata tool is used to model the folding process. A neural cellular automaton is defined, using a connectionist model that acts as a cellular automaton through the protein chain to define the dynamic folding. Differential evolution is used to automatically obtain the optimized neural cellular automata that provide protein folding. We tested the methods with the Rosetta coarse-grained atomic model of protein representation, using different proteins to analyze the modeling of folding and the structure refinement that the modeling can provide, showing the potential advantages that such methods offer, but also difficulties that arise., This study was funded by the Xunta de Galicia and the European Union (European Regional Development Fund - Galicia 2014-2020 Program), with grants CITIC (ED431G 2019/01), GPC ED431B 2019/03 and IN845D-02 (funded by the “Agencia Gallega de Innovación”, co-financed by Feder funds), and by the Spanish Ministry of Science and Innovation (project PID2020-116201GB-I00). Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature, Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431B 2019/03, Xunta de Galicia; IN845D-02
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

On the semantics of hybrid ASP systems based on Clingo

  • Cabalar, Pedro
  • Fandinno, Jorge
  • Schaub, Torsten
  • Wanko, Philipp
[Abstract]: Over the last decades, the development of Answer Set Programming (ASP) has brought about an expressive modeling language powered by highly performant systems. At the same time, it gets more and more difficult to provide semantic underpinnings capturing the resulting constructs and inferences. This is even more severe when it comes to hybrid ASP languages and systems that are often needed to handle real-world applications. We address this challenge and introduce the concept of abstract and structured theories that allow us to formally elaborate upon their integration with ASP. We then use this concept to make the semantic characterization of clingo’s theory-reasoning framework precise. This provides us with a formal framework in which we can elaborate upon the formal properties of existing hybridizations of clingo, such as clingcon, clingo[dl], and clingo[lp]., This work was supported by DFG grant SCHA 550/11, Germany, by grant PID2020-116201GB-I00 funded by MCIN/AEI/ 10.13039/501100011033, Spain, by Xunta de Galicia and the European Union, GPC ED431B 2022/33, by European COST action CA17124 DigForASP, EU, and by the National Science Foundation (NSF 95-3101-0060-402), USA., Xunta de Galicia; ED431B 2022/33, Deutsche Forschungsgemeinschaft; SCHA 550/11, United States. National Science Foundation; NSF 95-3101-0060-402
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

A Polynomial Reduction of Forks Into Logic Programs

  • Aguado, Felicidad
  • Cabalar, Pedro
  • Fandiño, Jorge
  • Pearce, David
  • Pérez, Gilberto
  • Vidal, Concepción
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract] In this research note we present additional results for an earlier published paper [1]. There, we studied the problem of projective strong equivalence (PSE) of logic programs, that is, checking whether two logic programs (or propositional formulas) have the same behaviour (under the stable model semantics) regardless of a common context and ignoring the effect of local auxiliary atoms. PSE is related to another problem called strongly persistent forgetting that consists in keeping a program’s behaviour after removing its auxiliary atoms, something that is known to be not always possible in Answer Set Programming. In [1], we introduced a new connective ‘|’ called fork and proved that, in this extended language, it is always possible to forget auxiliary atoms, but at the price of obtaining a result containing forks. We also proved that forks can be translated back to logic programs introducing new hidden auxiliary atoms, but this translation was exponential in the worst case. In this note we provide a new polynomial translation of arbitrary forks into regular programs that allows us to prove that brave and cautious reasoning with forks has the same complexity as that of ordinary (disjunctive) logic programs and paves the way for an efficient implementation of forks. To this aim, we rely on a pair of new PSE invariance properties., We wish to thank the anonymous reviewers for their useful suggestions that have helped to improve the paper. This work was partially supported by MICINN, Spain, grant PID2020-116201GB-I00, Xunta de Galicia, Spain, grant GPC ED431B 2019/03, Universidade da Coruña/CISUG, Spain, (funding for open access charge) and National Science Foundation, USA, grant NSF Nebraska EPSCoR 95-3101-0060-402, Xunta de Galicia; ED431B 2019/03, USA. National Science Foundation; EPSCoR 95-3101-0060-402
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Linear-Time Temporal Answer Set Programming

  • Aguado, Felicidad
  • Cabalar, Pedro
  • Diéguez Lodeiro, Martín
  • Pérez, Gilberto
  • Schaub, Torsten
  • Schuhmann, Anna
  • Vidal, Concepción
[Abstract]: In this survey, we present an overview on (Modal) Temporal Logic Programming in view of its application to Knowledge Representation and Declarative Problem Solving. The syntax of this extension of logic programs is the result of combining usual rules with temporal modal operators, as in Linear-time Temporal Logic (LTL). In the paper, we focus on the main recent results of the non-monotonic formalism called Temporal Equilibrium Logic (TEL) that is defined for the full syntax of LTL but involves a model selection criterion based on Equilibrium Logic, a well known logical characterization of Answer Set Programming (ASP). As a result, we obtain a proper extension of the stable models semantics for the general case of temporal formulas in the syntax of LTL. We recall the basic definitions for TEL and its monotonic basis, the temporal logic of Here-and-There (THT), and study the differences between finite and infinite trace length. We also provide further useful results, such as the translation into other formalisms like Quantified Equilibrium Logic and Second-order LTL, and some techniques for computing temporal stable models based on automata constructions. In the remainder of the paper, we focus on practical aspects, defining a syntactic fragment called (modal) temporal logic programs closer to ASP, and explaining how this has been exploited in the construction of the solver telingo, a temporal extension of the well-known ASP solver clingo that uses its incremental solving capabilities., Xunta de Galicia; ED431B 2019/03, We are thankful to the anonymous reviewers for their thorough work and their useful suggestions that have helped to improve the paper. A special thanks goes to Mirosaw Truszczy´nski for his support in improving the quality of our paper. We are especially grateful to David Pearce, whose help and collaboration on Equilibrium Logic was the seed for a great part of the current paper. This work was partially supported by MICINN, Spain, grant PID2020-116201GB-I00, Xunta de Galicia, Spain (GPC ED431B 2019/03), R´egion Pays de la Loire, France, (projects EL4HC and etoiles montantes CTASP), European Union COST action CA-17124, and DFG grants SCHA 550/11 and 15, Germany.
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Automatic Selection of Financial Ratios by Means of Differential Evolution and for Predicting Business Insolvency

  • Santos Reyes, José
  • Sestayo Yermo, Óscar
  • Beade, Angel
  • Rodríguez López, Manuel
[Abstract]: Differential evolution was used for the automatic selection of financial ratios for the prediction of business insolvency. A sample of companies from the Galician economy is used to predict the insolvency of a company a year in advance. The genetic population encodes possible sets or combinations of financial ratios, and the quality of each encoded solution is determined by the classification accuracy provided by a KNN classifier that uses the selected encoded ratios. Finally, the selected and relevant ratios are used with a more robust classifier, a classical multilayer perceptron, which provides greater sensitivity in the prediction results., This study was funded by the Xunta de Galicia and the European Union, with grants CITIC (ED431G 2019/01), GPC ED431B 2019/03, and by the Spanish Ministry of Science and Innovation (project PID2020-116201GB-I00)., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431B 2019/03
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Computational approaches to Explainable Artificial Intelligence: Advances in theory, applications and trends

  • Górriz, Juan M.
  • Álvarez-Illán, I.
  • Álvarez-Marquina, Agustín
  • Arco, Juan Eloy
  • Atzmueller, Martin
  • Ballarini, F.
  • Barakova, Emilia
  • Bologna, Guido
  • Duro, Richard J.
  • Santos Reyes, José
Financiado para publicación en acceso aberto: Universidad de Granada / CBUA., [Abstract]: Deep Learning (DL), a groundbreaking branch of Machine Learning (ML), has emerged as a driving force in both theoretical and applied Artificial Intelligence (AI). DL algorithms, rooted in complex and non-linear artificial neural systems, excel at extracting high-level features from data. DL has demonstrated human-level performance in real-world tasks, including clinical diagnostics, and has unlocked solutions to previously intractable problems in virtual agent design, robotics, genomics, neuroimaging, computer vision, and industrial automation. In this paper, the most relevant advances from the last few years in Artificial Intelligence (AI) and several applications to neuroscience, neuroimaging, computer vision, and robotics are presented, reviewed and discussed. In this way, we summarize the state-of-the-art in AI methods, models and applications within a collection of works presented at the 9th International Conference on the Interplay between Natural and Artificial Computation (IWINAC). The works presented in this paper are excellent examples of new scientific discoveries made in laboratories that have successfully transitioned to real-life applications., Funding for open access charge: Universidad de Granada / CBUA. The work reported here has been partially funded by many public and private bodies: by the MCIN/AEI/10.13039/501100011033/ and FEDER “Una manera de hacer Europa” under the RTI2018-098913-B100 project, by the Consejeria de Economia, Innovacion, Ciencia y Empleo (Junta de Andalucia) and FEDER under CV20-45250, A-TIC-080-UGR18, B-TIC-586-UGR20 and P20-00525 projects, and by the Ministerio de Universidades under the FPU18/04902 grant given to C. Jimenez-Mesa, the Margarita-Salas grant to J.E. Arco, and the Juan de la Cierva grant to D. Castillo-Barnes. This work was supported by projects PGC2018-098813-B-C32 & RTI2018-098913-B100 (Spanish “Ministerio de Ciencia, Innovacón y Universidades”), P18-RT-1624, UMA20-FEDERJA-086, CV20-45250, A-TIC-080-UGR18 and P20 00525 (Consejería de econnomía y conocimiento, Junta de Andalucía) and by European Regional Development Funds (ERDF). M.A. Formoso work was supported by Grant PRE2019-087350 funded by MCIN/AEI/10.13039/501100011033 by “ESF Investing in your future”. Work of J.E. Arco was supported by Ministerio de Universidades, Gobierno de España through grant “Margarita Salas”. The work reported here has been partially funded by Grant PID2020-115220RB-C22 funded by MCIN/AEI/10.13039/501100011033 and, as appropriate, by “ERDF A way of making Europe”, by the “European Union” or by the “European Union NextGenerationEU/PRTR”. The work of Paulo Novais is financed by National Funds through the Portuguese funding agency, FCT - Fundaça̋o para a Ciência e a Tecnologia within project DSAIPA/AI/0099/2019. Ramiro Varela was supported by the Spanish State Agency for Research (AEI) grant PID2019-106263RB-I00. José Santos was supported by the Xunta de Galicia and the European Union (European Regional Development Fund - Galicia 2014–2020 Program), with grants CITIC (ED431G 2019/01), GPC ED431B 2022/33, and by the Spanish Ministry of Science and Innovation (project PID2020-116201GB-I00). The work reported here has been partially funded by Project Fondecyt 1201572 (ANID). The work reported here has been partially funded by Project Fondecyt 1201572 (ANID). In [247], the project has received funding by grant RTI2018-098969-B-100 from the Spanish Ministerio de Ciencia Innovación y Universidades and by grant PROMETEO/2019/119 from the Generalitat Valenciana (Spain). In [248], the research work has been partially supported by the National Science Fund of Bulgaria (scientific project “Digital Accessibility for People with Special Needs: Methodology, Conceptual Models and Innovative Ecosystems”), Grant Number KP-06-N42/4, 08.12.2020; EC for project CybSPEED, 777720, H2020-MSCA-RISE-2017 and OP Science and Education for Smart Growth (2014–2020) for project Competence Center “Intelligent mechatronic, eco- and energy saving sytems and technologies”BG05M2OP001-1.002-0023. The work reported here has been partially funded by the support of MICIN project PID2020-116346GB-I00. The work reported here has been partially funded by many public and private bodies: by MCIN/AEI/10.13039/501100011033 and “ERDF A way to make Europe” under the PID2020-115220RB-C21 and EQC2019-006063-P projects; by MCIN/AEI/10.13039/501100011033 and “ESF Investing in your future” under FPU16/03740 grant; by the CIBERSAM of the Instituto de Salud Carlos III; by MinCiencias project 1222-852-69927, contract 495-2020. The work is partially supported by the Autonomous Government of Andalusia (Spain) under project UMA18-FEDERJA-084, project name Detection of anomalous behavior agents by DL in low-cost video surveillance intelligent systems. Authors gratefully acknowledge the support of NVIDIA Corporation with the donation of a RTX A6000 48 Gb. This work was conducted in the context of the Horizon Europe project PRE-ACT, and it has received funding through the European Commission Horizon Europe Program (Grant Agreement number: 101057746). In addition, this work was supported by the Swiss State Secretariat for Education, Research and Innovation (SERI) under contract nummber 22 00058. S.B Cho was supported by Institute of Information & Communications Technology Planning & Evaluation (IITP) grant funded by the Korean government (MSIT) (No. 2020-0-01361, Artificial Intelligence Graduate School Program (Yonsei University))., Junta de Andalucía; CV20-45250, Junta de Andalucía; A-TIC-080-UGR18, Junta de Andalucía; B-TIC-586-UGR20, Junta de Andalucía; P20-00525, Junta de Andalucía; P18-RT-1624, Junta de Andalucía; UMA20-FEDERJA-086, Portugal. Fundação para a Ciência e a Tecnologia; DSAIPA/AI/0099/2019, Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; GPC ED431B 2022/33, Chile. Agencia Nacional de Investigación y Desarrollo; 1201572, Generalitat Valenciana; PROMETEO/2019/119, Bulgarian National Science Fund; KP-06-N42/4, Bulgaria. Operational Programme Science and Education for Smart Growth; BG05M2OP001-1.002-0023, Colombia. Ministerio de Ciencia, Tecnología e Innovación; 1222-852-69927, Junta de Andalucía; UMA18-FEDERJA-084, Suíza. State Secretariat for Education, Research and Innovation; 22 00058, Institute of Information & Communications Technology Planning & Evaluation (Corea del Sur); 2020-0-01361