Pasar al contenido principal

PROCESAMIENTO DE INCONSISTENCIAS BASADO EN LOGICA PARA SISTEMAS INTELIGENTES EXPLICABLES: FUNDAMENTOS

PID2022-139835NB-C21

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2022
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS (CSIC)

Resultados relacionados

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

Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A social approach to artificial intelligence systems for people with Down syndrome, a qualitative systematic review

  • Dellunde i Clavé, Pilar|||0000-0002-8198-5475
  • Moyà-Köhler, Joan|||0000-0002-5746-6958
Objectives: This review was conducted by an interdisciplinary team with the aim of producing insights that are relevant to researchers, practitioners, and organizations supporting individuals with Down Syndrome. Methods: A qualitative systematic review was conducted following PRISMA 2020 guidelines. 47 peer-reviewed studies (2014-2024) were selected from four major databases, focusing on implementations of Artificial Intelligence (AI) systems involving individuals with Down Syndrome. Results: Findings show that AI applications targeted mainly the areas of education, communication, emotional regulation, mobility, and employment. Most systems used deep learning or intelligent robots. However, participatory design approaches were not widely adopted, and real-world deployment remained limited. Conclusions: A shift toward more participatory, rights-based approaches is essential to ensure these technologies support autonomy and inclusion.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Belief Horn merging operators: characterization results and implementations

  • Dellunde, Pilar
  • Costa, Vicent
  • Rivas-Barragán, Daniel
The paper contributes to the study of belief merging in many-valued logics, taking both a theoretical and implementation approach motivated by applications in real-world scenarios. We focus, in particular, on the Horn fragment of signed logic. On the one hand, a characterization of the class of models of a signed regular Horn formula and a sufficient condition for a signed Horn merging operator to satisfy logical IC-postulates are provided. On the other hand, an implementation of the belief merging process in the signed regular Horn fragment is presented., This work is partially funded by the H2020-MSCA-RISE-2020 project MOSAIC (101007627), the project PID2022-141950OB-I00, the research groups 2021-SGR-00754 and 2021-SGR-00517, and the project PID2022-139835NB-C21 funded by MCIN/AEI/10.13039/501100011033/., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Injusticia epistémica para un análisis filosófico de las exposiciones digitales del arte visual, Epistemic injustice for a philosophical analysis of digital exhibitions of visual art

  • Costa, Vicent
  • Sans Pinillos, Alger
  • Martín Casacuberta, David A.
[EN]The digital transition, driven by advancements in artificial intelligence, presents complex challenges in emerging digital societies. Visual arts have been profoundly influenced by this digitalization, affecting both creative processes and the accessibility and exhibition of artworks. This paper presents a philosophical analysis centered on heritage, specifically focusing on the digital storage, representation, and exhibition of artworks. We employ Miranda Fricker’s theory of epistemic injustice to conduct an ethical and epistemological examination of the use of databases in designing virtual museums, highlighting their role in either perpetuating or alleviating injustices in this context. Finally, we propose abduction as a starting point for a broader future philosophical analysis of the digital museum, exploring the relationships between visitors and museums and their impact on the epistemic-moral landscape within these environments., [ES]La transición digital de nuestro tiempo, favorecida por los avances de la inteligencia artificial, evidencia retos complejos en las sociedades digitales emergentes. Las artes plásticas se han visto influenciadas por esta digitalización, tanto en lo relativo a los procesos creativos como en lo que concierne al acceso y la exposición de las obras artísticas. En este trabajo se presenta un análisis filosófico centrado en el patrimonio, a saber, su almacenamiento, representación y exposición digital de las obras artísticas. Concretamente, nos servimos de la teoría de injusticia epistémica deMirandaFricker para un estudio ético y epistemológico sobre el uso de las bases de datos en el diseño de los museos virtuales, insistiendo en el papel de estas para la perpetuación o mitigación de las injusticias que pueden darse en este contexto. Finalmente, sepropone la abducción como punto de partida para un análisis filosófico futuro más amplio sobre el museo digital, donde se consideren las relaciones entre visitantes y museos y su influencia en la distribución epistémico-moral en estos entornos., V. Costa ha recibido financiación del proyecto PID2022-139835NB-C21 (referencia: MCIN/AEI/10.13039/501100011033/) y del grupo de investigación 2021-SGR-00517. A. Sans Pinillos ha recibido financiación del proyecto PRIN 2017 Research (referencia: 20173YP4N3–MIUR), del Ministero dell'Istruzione, dell'Università e della Ricerca, Roma, Italia., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Moderated revision

  • Grimaldi, Daniel
  • Martínez, Vanina
  • Rodriguez, Ricardo O.
In this article, we provide a new kind of belief revision operator that we call Moderated Revision. At first glance, it is a non-prioritized operator that combines a basic classical AGM operator with a credibility-limited one. The underlying idea is this: when new observation μ is received, it is accepted but with doubts, i.e., uncertainty. We use a revision operator to model the accepted part and a credibility-limited one to represent uncertainty, whenever necessary. In the presence of uncertainty, a selection of the old knowledge balances the result of the revision through a disjunction, allowing the agent to accept part of the new observation and remain unsettled about the rest., Martinez was funded in part by Secretaría de Ciencia y Técnica de la Universidad de Buenos Aires (RESCS-2020-345-E-UBA-REC), CONICET under the PIP (grant 112-2020-0101408CO), Agencia Nacional de Promoción Científica y Tecnológica, Argentina under grants PICT-2018-0475 (PRH-2014-0007) and PICT-2020-SERIEA-01481. Rodriguez acknowledges partial support of Argentinean projects: PICT-2019-2019-00882, UBA-CyT-20020190100021BA and PIP 112-2015-0100412CO. Finally, the three authors want to thank the partial support of The EU-funded MOSAIC project (Grant agreement ID: 101007627). The authors also acknowledge support by the Spanish project PID2022-139835NB-C21 funded by MCIN MCIN/AEI/10.13039/501100011033 and by “European Union NextGenerationEU/PRTR”., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Algebras and relational frames for gödel modal logic and some of its extensions

  • Flaminio, Tommaso
  • Godo, Lluis
  • Menchón, Paula
  • Rodriguez, Ricardo O.
Gödel modal logics can be seen as extensions of intutionistic modal logics with the prelinearity axiom. In this paper we focus on the algebraic and relational semantics for Gödel modal logics that leverages on the duality between finite Gödel algebras and finite forests, i.e. finite posets whose principal downsets are totally ordered. We consider different subvarieties of the basic variety GAO of Gödel algebras with two modal operators (GAOs for short) and their corresponding classes of forest frames, either with one or two accessibility relations. These relational structures can be considered as prelinear versions of the usual relational semantics of intuitionistic modal logic. More precisely we consider two main extensions of finite Gödel algebras with operators: the one obtained by adding Dunn axioms, typically studied in the fragment of positive classical (and intuitionistic) logic, and the one determined by adding Fischer Servi axioms. We present Jónsson-Tarski like representation theorems for the different types of finite GAOs considered in the paper., Theauthors acknowledge partial support by the MOSAIC project (EU H2020-MSCA-RISE-2020 Project 101007627). Flaminio and Godo also acknowledge partial support by the Spanish project PID2019-111544GB-C21, Flaminio also acknowledges the Spanisn project PID2022- 141529NB-C22, and Godo the Spanish project PID2022-139835NB-C21, all of them funded by MCIN/AEI/10.13039/501100011033. Menchón acknowledges partial support by the Argentinean projects PIP 112-20200101301CO (CONICET) and PICT-2019-2019-00882 (ANPCyT). Finally, Rodriguez acknowledges partial support by the following Argentinean projects: PIP 112-20150100412CO (CONICET) and UBA-CyT-20020190100021BA., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Conditional Objects as Possibilistic Variables

  • Flaminio, Tommaso
  • Godo, Lluis
Symbolic and Quantitative Approaches to Reasoning with Uncertainty.- 17th European Conference, ECSQARU 2023, Arras, France, September 19–22, 2023, Proceedings.- Conference proceedings.- Published 19 November 2023, The interpretation of basic conditionals as three-valued objects initiated by de Finetti has been mainly developed and extended by Gilio and Sanfilippo and colleagues, who look at (compound) conditionals as probabilistic random quantities. Recently, it has been shown that this approach ends up providing a Boolean algebraic structure for the set of conditional objects. In this paper, we show how that this probabilistic-based approach can also be developed within the possibilistic framework, where conditionals are attached with possibilistic variables instead: variables attached with a (conditional) possibility distribution on its domain of plain events. The possibilistic expectation of these variables now provides a means of extending the original possibility distribution on events to (compound) conditional objects. Our main result shows that this possibilistic approach leads to exactly the same underlying Boolean algebraic structure for the set of conditionals., The authors also acknowledge support by the support by the MOSAIC project (EU H2020-MSCA-RISE-2020 Project 101007627) and by the Spanish projects PID2019-111544GB-C21 and PID2022-139835NB-C21 funded by MCIN/AEI/10.13039/501100011033., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

LENs for Analyzing the Quality of Life of People with Intellectual Disability

  • Fraile-Parra, Diego
  • Costa, Vicent
  • Dellunde, Pilar
This book constitutes the refereed proceedings of the 18th International Conference on Neural-Symbolic Learning and Reasoning, NeSy 2024, held in Barcelona, Spain during September 9-12th, 2024., The 30 full papers and 18 short papers were carefully reviewed and selected from 89 submissions, which presented the latest and ongoing research work on neurosymbolic AI. Neurosymbolic AI aims to build rich computational models and systems by combining neural and symbolic learning and reasoning paradigms. This combination hopes to form synergies among their strengths while overcoming their complementary weaknesses., This paper presents a reduced version of a currently in-use questionnaire, the GENCAT scale, to determine the level of quality of life of people with intellectual disability and uses a framework in the literature of neurosymbolic AI, specifically the family of interpretable DL named logic explained networks, to provide explanations for the predictions. By integrating explainability, our research enhances the richness of the predictions and qualitatively evaluates the reduced questionnaire’s effectiveness, also illustrating the importance of explainable AI in improving assessment tools for vulnerable populations such as people with disability. The work is understood as a step to initiate dialogue with experts and practitioners using the GENCAT scale, with the ultimate goal of refining the questionnaire by discussing the explanations generated., This work was funded by the projects PID2022-139835NB-C21, H2020-MSCA-RISE-910 2020 MOSAIC, and PID2022-141950OB-I00, the groups 2021-SGR-00754 and 2021-SGR-00517, and the introduction to research training programme JAE Intro ICU 2023 (AIHUB-22, JAEICU_23_00654)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Neurosymbolic AI for Studying the Quality of Life's Dimensions of People with Intellectual Disability

  • Costa, Vicent
  • Dellunde, Pilar
  • Fraile-Parra, Diego
This book presents the proceedings of CCIA2024, the 26th edition of the International Conference of the Catalan Association for Artificial Intelligence, held from 2 – 4 October 2024 in Barcelona, Spain. The CCIA conferences now serve as a forum to bring together participants working on AI research from around the world. A total of 68 papers was received for the conference, and this book contains 26 long papers, 19 short papers, and 4 long abstracts (49 papers) which were ultimately accepted following a thorough peer review process, resulting in an acceptance rate of 72%. These are divided into 5 sections: machine learning and deep learning applications; natural language processing (NLP); artificial intelligence ethics and decision support systems; robotics and autonomous systems; and specialized applications of AI, and cover a wide range of AI domains, such as machine learning, deep learning, natural language processing, computer vision, data science, and reinforcement learning. Critical AI applications across a number of fields are explored, including healthcare, smart services, environmental monitoring, and manufacturing, and topics such as the ethical considerations of AI, voice cloning, and decision-making support systems are also examined., The model of quality of life (QOL) used in Catalonia to assess the QOL level of people with intellectual disability considers eight dimensions defined operationally by core indicators. In this paper, to advance the knowledge about these dimensions regarding social service Catalonia users, we employ logic explained networks to generate global explanations of the correlations between these dimensions and present the results obtained., This research was funded by the projects PID2022-139835NB-C21 (MCIN/AEI/10.13039/501100011033/), the H2020-MSCARISE-910 2020 MOSAIC (101007627), the PID2022-141950OB-I00, and the research groups 2021-SGR-00754 and 2021-SGR-00517., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Integrating multi-armed bandit with local search for MaxSAT

  • Zheng, Jiongzhi
  • He, Kun
  • Zhou, Jianrong
  • Jin, Yan
  • Li, Chu Min
  • Manyà, Felip
Partial MaxSAT (PMS) and Weighted PMS (WPMS) are two practical generalizations of the MaxSAT problem. In this paper, we introduce a new local search algorithm for these problems, named BandHS. It applies two multi-armed bandit (MAB) models to guide the search directions when escaping local optima. One MAB model is combined with all the soft clauses to help the algorithm select to satisfy appropriate soft clauses, while the other MAB model is combined with all the literals in hard clauses to help the algorithm select suitable literals to satisfy the hard clauses. These two models enhance the algorithm's search ability in both feasible and infeasible solution spaces. BandHS also incorporates a novel initialization method that prioritizes both unit and binary clauses when generating the initial solutions. Moreover, we apply our MAB approach to the state-of-the-art local search algorithm NuWLS and to the local search component of the incomplete solver NuWLS-c-2023. The extensive experiments conducted demonstrate the excellent performance and generalization capability of the proposed method. Additionally, we provide analyses on the type of problems where our MAB method works well or not, aiming to offer insights and suggestions for its application. Encouragingly, our MAB method has been successfully applied in core local search components in the winner of the WPMS complete track of MaxSAT Evaluation 2023, as well as the runners-up of the incomplete track of MaxSAT Evaluations 2022 and 2023., This work is supported by National Natural Science Foundation of China (U22B2017), Microsoft Research Asia (100338928), and grants PID2019-111544GB-C21, PID2022-139835NB-C21 and TED2021-129319B-I00 funded by MCIN/AEI/10.13039/501100011033., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Complete tableau calculi for Regular MaxSAT and Regular MinSAT

  • Coll, Jordi
  • Li, Chu Min
  • Manyà, Felip
  • Yangin, Elifnaz
The use of constraint models in symbolic AI has significantly increased during the last decades for their capability of certifying the existence of solutions as well as their optimality. In the latter case, approaches based on the Maximum and Minimum Satisfiability problems, or MaxSAT and MinSAT, have shown to provide state-of-the-art performances in solving many computationally challenging problems of social interest, including scheduling, timetabling and resource allocation. Indeed, the research on new approaches to MaxSAT and MinSAT is a trend still providing cutting-edge advances. In this work, we push in this direction by contributing new tableaux-based calculi for solving the MaxSAT and MinSAT problems of regular propositional logic, referred to as Regular MaxSAT and Regular MinSAT problems, respectively. For these problems, we consider as well the two extensions of the highest practical interest, namely the inclusion of weights to clauses, and the distinction between hard (mandatory) and soft (desirable) constraints. Hence, our methods handle any subclass of the most general variants: Weighted Partial Regular MaxSAT and Weighted Partial Regular MinSAT. We provide a detailed description of the methods and prove that the proposed calculi are sound and complete., This work has been supported by the French Agence Nationale de la Recherche, reference ANR-19-CHIA-0013-01, grant PID2022-139835NB-C21 funded by MICIU/AEI/10.13039/501100011033, and grant PID2021-122274OB-I00 funded by MCIN/AEI/10.13039/501100011033 and by ERDF A way of making Europe. E. Yangin was supported by grant PTA2022-022408-I funded by MICIU/AEI/10.13039/501100011033 and FSE+ . F. Manyà was supported by mobility grant PRX23/00344 of the Ministerio de Ciencia, Innovación y Universidades ., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Defeasible Argumentation-based Epistemic Planning with Preferences

  • Teze, Juan Carlos L.
  • Godo, Lluis
  • Simari, Gerardo I.
Many real-world applications of intelligent systems involve solving planning problems of different nature, oftentimes in dynamic environments and having to deal with potentially contradictory information, leading to what is commonly known as epistemic planning. In this context, defeasible argumentation is a powerful tool that has been developed for over three decades as a practical mechanism that allows for flexible handling of preferences and explainable reasoning. In this article, we first motivate the need to develop argumentationbased epistemic planning frameworks that can be leveraged in real-world applications, describe the related literature, and then provide an overview of a recently-proposed approach to incorporate defeasible argumentation and preferences into automated planning processes. In particular, the framework incorporates conditional expressions to select and change priorities regarding information upon which plans are constructed. We describe its main properties, analyze its strengths and limitations using an illustrative use case, and discuss several future research directions that can be taken to further develop it., The authors are indebted to Guillermo R. Simari for inspiring discussions and to anonymous reviewers for their helpful comments. This work was funded in part by Universidad Nacional del Sur (UNS) under grants PGI 24/ZN057 and PGI 24/N055, Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET) under grant PIP 11220210100577CO, Agencia Nacional de Promoción Científica y Tecnológica, Argentina under grant PICT-2018-0475 (PRH-2014-0007), and Universidad Nacional de Entre Ríos (UNER) under grant PDTS-UNER 7066. Godo acknowledges partial support by the Spanish project LINEXSYS (PID2022-139835NB-C21) funded by MCIN/AEI/10.13039/501100011033., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Solving weighted Maximum Satisfiability with Branch and Bound and clause learning

  • Coll, Jordi
  • Li, Chu Min
  • Li, Shuolin
  • Habet, Djamal
  • Manyà, Felip
[Data availability] The provided link contains the software involved in this paper, including the software and the instructions and necessary data to reproduce the experiments. Source code and input parameters (Original data), MaxSAT is a widely studied NP-hard optimization problem due to its broad applicability in modeling and solving diverse real-world optimization problems. Branch-and-Bound (BnB) MaxSAT solvers have proven efficient for solving random and crafted instances but have traditionally struggled to compete with SAT-based MaxSAT solvers on industrial instances. However, this changed with the introduction of the MaxCDCL algorithm, which successfully integrates clause learning into BnB to solve unweighted MaxSAT. Despite this progress, solving Weighted MaxSAT instances remained an open challenge. In this paper, we present WMaxCDCL, the first branch-and-bound (BnB) Weighted Partial MaxSAT solver with clause learning. We describe its algorithm and implementation in detail, experimentally evaluating key aspects that are critical to achieving strong performance. Our results demonstrate that WMaxCDCL can compete with the best state-of-the-art MaxSAT solvers and, more importantly, that this new solving approach complements the existing SAT-based MaxSAT methods, which have dominated the field until now. Notably, the combination of WMaxCDCL with other techniques won the weighted track of the 2023 MaxSAT Evaluation, which is the leading annual competition for MaxSAT solvers, affiliated with the International Conference on Theory and Applications of Satisfiability Testing., This work has been supported by grants PID2022-139835NB-C21 and PID2021-122274OB-I00 funded by MCIN/AEI/10.13039/501100011033 and by ERDF, EU, and by grant ANR-19-CHIA-0013-01 co-funded by the French Agence Nationale de la Recherche and the French electricity distribution network manager Enedis. F. Manyà was supported by mobility grant PRX23/00344 of the Ministerio de Ciencia, Innovación y Universidades, Spain . We thank the Université de Picardie Jules Verne for providing the Matrics Platform., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

On Nilpotent Minimum logics defined by lattice filters and their paraconsistent non-falsity preserving companions

  • Gispert, Joan
  • Esteva, Francesc
  • Godo, Lluis
  • Coniglio, Marcelo E.
Nilpotent Minimum logic (NML) is a substructural algebraizable logic that is a distinguished member of the family of systems of Mathematical Fuzzy logic, and at the same time it is the axiomatic extension with the prelinearity axiom of Nelson and Markov’s Constructive logic with strong negation. In this paper our main aim is to characterize and axiomatize paraconsistent variants of NML and its extensions defined by (sets of) logical matrices over linearly ordered NM-algebra with lattice filters as designated values, with special emphasis on those that only exclude the falsum truth-value, called non-falsity preserving logics. We also consider turning these non-falsity preserving logics into Logics of Formal Inconsistency by expanding them with a consistency operator, and we axiomatize them as well. Finally, we provide a full description of the logics defined by finite products of matrices over finite NM-chains., The authors thank the anonymous reviewers for their helpful comments that have significantly helped to improve the layout of this paper. The authors acknowledge support by the MOSAIC project (EU H2020-MSCA-RISE Project 101007627). Gispert acknowledges partial support by the Spanish project SHORE (PID2022-141529NB-C21), while Esteva and Godo by the Spanish project LINEXSYS (PID2022-139835NB-C21), both funded by MCIU/AEI/10.13039/501100011033. Gispert also acknowledges the project 2021 SGR 00348 funded by AGAUR. Coniglio acknowledges support from the National Council for Scientific and Technological Development (CNPq, Brazil) through the individual research grant # 309830/2023-0, and from the São Paulo Research Foundation (FAPESP, Brazil) trough the Thematic Project Rationality, logic and probability—RatioLog, grant #2020/16353-3., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Beyond Data: The Digital Transformation of the Traditional Museum, Más allá de los datos: la transformación digital del museo tradicional

  • Sans Pinillos, Alger
  • Costa, Vicent
[EN] This work focuses on the virtual museum, understood as the digital transformation of the traditional museum. First, the main conceptualizations of the virtual museum in the specialized literature are reviewed, and based on them, we propose a basic definition. Furthermore, we argue in favor of the insufficiency of the dataist perspective in the study of epistemic injustice associ-ated with the virtual museum. Finally, the exclusion related to the participation and interaction between a museum’s visitors and the institution is analyzed., [ES] Este trabajo se centra en el museo virtual entendido como la transformación digital del museo tradicional. En primer lugar, se revisan las principales conceptualizaciones del museo virtual en la literatura especializada y, a partir de las mismas, se propone una definición básica. Asimismo, se presentan argumentos que muestran la insuficiencia de la perspectiva dataísta en el estudio de la injusticia epistémica relativa al museo virtual. Finalmente, se analiza la exclusión relativa a la participación y la interacción entre las visitantes de un museo (tanto virtual como físico) y la propia institución., Esta publicación es parte del proyecto PID2022-139835NB-C21, financiado por MCIN/AEI/10.13039/501100011033/., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Ethical prompting: toward strategies for rapid and inclusive assistance in dual-use AI systems

  • Farnós, Joan
  • Sans Pinillos, Alger
  • Costa, Vicent
Monitoring technologies initially developed for individuals with disabilities carry inherent dual-use risks, especially evident in conflict or emergency scenarios. This article examines the dual-use dilemma posed by technologies whose civilian design objectives can unintentionally facilitate harmful applications in defense contexts. Specifically, we analyze the ethical risks associated with using civilian-generated data and systems, originally intended to enhance care and assistance, for military purposes without adequate safeguards. We argue that effective and ethically sound technological infrastructures require optimized and ethically-informed prompting strategies. These strategies must clearly define how data and system prompts are structured, reducing deployment biases, particularly against vulnerable populations., The author(s) declare that financial support was received for the research and/or publication of this article. AS was supported by the “Generación D” initiative, Red.es, Ministerio para la Transformación Digital y de la Función Pública, for talent attraction (C005/24-ED CV1), funded by the European Union’s NextGenerationEU program through the PRTR. VC was funded by the project PID2022-139835NB-C21 and supported by the research group 2021-SGR-00517., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Integrating Digital Museums Within Traditional Ones to Address Epistemic Injustice in Cultural Heritage, La incorporación del museo digital en los museos tradicionales para abordar la injusticia epistémica en el patrimonio cultural

  • Sans Pinillos, Alger
  • Martín Casacuberta, David A.
  • Costa, Vicent
[EN] The objective of this paper is to examine the potential of digital museums to mitigate epistemic injustice in traditional cultural institutions, particularly regarding the exclusion of minority groups. Adopting a theoretical and speculative approach, it develops a conceptual framework that bridges debates on epistemic injustice with digital transformation in museums. We argue that traditional museums frequently perpetuate testimonial and hermeneutic injustices due to entrenched cultural biases, and that merely expanding digital catalogs may risk reproducing these exclusions. To address this, we introduce the notion of the deliberative museum: a participatory digital space integrated into traditional institutions, where marginalized voices are actively included and curatorial choices are subject to public negotiation. This model should be understood as a conceptual thought experiment, intended to reframe visibility and participation so that museums can evolve into more inclusive and reflexive spaces of epistemic justice. In this sense, the integration of virtual elements into traditional museums highlights the potential of digital affordances to expand representation and dialogue., [ES] El artículo examina el potencial de los museos digitales para mitigar la injusticia epistémica en las instituciones culturales tradicionales, en particular en lo que respecta a la exclusión de los grupos minoritarios. Adoptando un enfoque teórico y especulativo, desarrolla un marco conceptual basado en la bibliografía sobre la injusticia epistémica y los debates sobre la transformación digital en los museos. Sostenemos que, aunque los museos tradicionales a menudo perpetúan las injusticias testimoniales y hermenéuticas a través de prejuicios cultu-rales arraigados, la simple ampliación de los catálogos digitales corre el riesgo de reproducir la exclusión. Para abordar esta cuestión, introducimos la noción de museo deliberativo: un espacio digital participativo integrado en las instituciones tradicionales, en el que se incluyen activamente las voces marginadas y las decisiones curatoriales están sujetas a negociación pública. Este modelo debe entenderse como un experimento conceptual, destinado a replantear la visibilidad y la participación para que los museos puedan evolucionar hacia espacios más inclusivos y reflexivos de justicia epistémica. En ese sentido, la integración de elementos virtuales en los museos tradicionales pone de relieve el potencial de los recursos digitales para ampliar la representación y el diálogo., Alger Sans Pinillos was sup-ported by the “Generación D” initiati-ve (Red.es, Ministerio para la Transfor-mación Digital y de la Función Públi-ca) for talent attraction (C005/24-ED CV1), funded by the European Union’s NextGenerationEU program through the PRTR. David Casacuberta was supported by the project “Política y ética de la salud pública” (PID2023-148517NB-100). Vicent Costa was supported by the project PID2022-139835NB-C21, funded by MCIN/AEI/10.13039/501100011033/, and by the research group 2021-SGR-00517., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Explainable Artificial Intelligence for Categorizing Art Genres

  • Sánchez, Juan Manuel
  • Costa, Vicent
Proceedings of the 27th International Conference of the Catalan Association for Artificial Intelligence. The International Conference of the Catalan Association for Artificial Intelligence (CCIA) is a well-established annual event that brings together researchers in Artificial Intelligence from across the Catalan-speaking territories (southern France, Catalonia, Valencia, the Balearic Islands, and Alghero in Italy) as well as participants from around the world., While art styles have been extensively explored in artificial intelligence (AI), the study of art genres remains underdeveloped. In this paper, we propose a neurosymbolic AI model for genre classification that combines deep learning with symbolic reasoning. We also show the model’s implementation and evaluate its performance on a dataset. Finally, directions for future research are outlined. The approach outperforms existing methods in terms of classification accuracy., We thank the reviewers for their valuable comments. This work was supported by the JAE Intro ICU 2024 fellowship (JAEICU 24 01687), the research project PID2022- 139835NB-C21 and the research group 2021SGR00517., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Integrating a Disability Perspective into Lethal Autonomous Weapons Systems Analysis: First Steps

  • Costa, Vicent
This work argues that incorporating a disability perspective into the discourse on lethal autonomous weapon systems (LAWS) reframes fundamental debates regarding their conceptualization, training phase, design, and use, thereby opening the topic to a deeper and more comprehensive discussion. First, this perspective is applied to analyze the conceptual underpinnings of LAWS. A procedural approach is then employed to develop arguments advocating for new design requirements for LAWS, particularly in relation to targeting. Finally, some considerations for further research from a relational perspective, as well as challenges in integrating both approaches, are presented., This work was funded by the project PID2022-139835NB-C21 and supported by the research group 2021-SGR-00517., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Introduction: Rethinking Death in the Digital Age—Delving into a Cross-Disciplinary Inquiry

  • Sans Pinillos, Alger
  • Vallverdú, Jordi
  • Costa, Vicent
In the current digital age, the proliferation of connected technologies profoundly redefines our interactions, social structures, and perceptions of fundamental concepts such as death. Throughout history, awareness and reflection on mortality have profoundly shaped human social and cognitive development, extending beyond humans to observable behaviors in animals, bacteria, and even plants. In this way, death is both an intrinsic biological reality, tied to entropy and renewal, and a profound subject of inquiry into existence, consciousness, and identity. Thus, this volume approaches death not as a singular entity but as a multifaceted phenomenon, an enigma that evokes both horror and hope. Furthermore, recent advances in robotics and artificial intelligence introduce unprecedented dimensions to this discourse, with a special emphasis on the complex ethical and philosophical challenges emerging as these technologies take on traditionally human roles. With all this in mind, this volume explores questions about the ontological status of artificial entities, their potential self-awareness, and whether their termination constitutes an authentic form of death. The essays collected here represent a pioneering interdisciplinary exploration that brings together philosophical, cultural, ethical, and technological perspectives. As the first work of its kind, the book intends to enrich academic discourse and foster critical reflection on the evolving nature of death in a technology-mediated society., Alger Sans Pinillos was supported by the “Generación D” initiative, Red.es, Ministerio para la Transformación Digital y de la Función Pública, for talent attraction (C005/24-ED CV1), funded by the European Union’s NextGenerationEU program through the PRTR. Jordi Vallverdú was supported by the ICREA 2019 and PAL-GAIT (PID2023-148336NB-100) grants. Vicent Costa was supported by the project PID2022-139835NB-C21, and the research group 2021-SGR-00517. These funding sources supported the research and collaborative efforts that made the production of this book possible., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

On the Non-falsity and Threshold Preserving Variants of MTL Logics

  • Esteva, Francesc
  • Gispert, Joan
  • Godo, Lluis
14th Conference of the European Society for Fuzzy Logic and Technology, EUSFLAT 2025, Riga, Latvia, July 21–25, 2025, Proceedings, Part I. Conference paper., In this paper we study the definition and axiomatisation of non-falsity preserving and threshold preserving companions of several extensions of the Monoidal t-norm based fuzzy logic MTL. More in detail, we first extend some recent preliminary results on non-falsity preserving logics, and then we present a new study on threshold-preserving companions of the main three fuzzy logics, Łukasiewicz, Product and Gödel logics., The authors are indebted to the anonymous reviewers for their comments and suggestions. They also acknowledge support by the MOSAIC project (EU H2020-MSCA-RISE Project 101007627). Esteva and Godo acknowledge partial support by the Spanish project LINEXSYS (PID2022-139835NB-C21), and Gispert by the Spanish project SHORE (PID2022-141529NB-C21), both funded by MCIU/AEI/10.13039/501100011033. Gispert also acknowledges the project 2021 SGR 00348 funded by AGAUR., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Revisiting fuzzy multisets: clarifying ambiguities and the underlying algebraic structure

  • Couso, Inés
  • Godo, Lluis
We revisit the theory of fuzzy multisets to address formal inconsistencies in existing definitions. Building on Miyamoto’s intuitive membership sequences, we propose two revised frameworks on a common foundation. The first one (Option 1) retains explicit multiplicities even at null memberships, thereby distinguishing clearly between “no assignment” and “zero assignment”, while the second one (Option 2) restricts attention to the subfamily of fuzzy multisets that uniformly enforce zero multiplicity to null memberships. Under both frameworks, the new operations of union, intersection, and inclusion satisfy the usual algebraic laws, most notably the absorption law, which fails in the original treatment, and endow the family of fuzzy multisets with a lattice structure. Moreover, within Option 2 we define a complement operation by invoking a top multiset; this complement is order-reversing and involutive, thereby equipping bounded fuzzy multisets with a De Morgan algebra structure. Finally, we prove that n-dimensional fuzzy sets are isomorphic to n-bounded fuzzy multisets, and we study the formal connections between the lattices of general fuzzy multisets and multidimensional fuzzy sets., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature., The authors are thankful to the associate editor and the anonymous referees for their helpful comments. Inés Couso acknowledges partial support by the projects PID2023-146257OB-I00, SEK-25-GRU-GIC-24-055, and PCI2025-163245. Lluis Godo acknowledges support by the Spanish project LINEXSYS (PID2022-139835NB-C21) funded by MCIU/AEI/10.13039/501100011033., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

History of Artificial Intelligence in Europe: the Catalan Association for Artificial Intelligence (ACIA)

  • Agell, Núria
  • Vicente, S.
  • Falomir, Zoe
  • Gibert, Karina
  • Martínez López, Beatriz
  • Museros, Lledó
  • Plaza, Enric
  • Valls, Aida
The creation of the Catalan Association for Artificial Intelligence (ACIA) was driven not only by practical and scientific objectives, but also by a powerful symbolic vision. It showcases the potential of Catalan society to produce innovative ideas and add value on a global scale. This paper illustrates the pivotal role of the ACIA in the development and consolidation of artificial intelligence (AI) research in Catalonia and across Europe. Founded in 1994, ACIA emerged from the need to create a cohesive AI research community in Catalan-speaking territories and to promote AI literacy. Over the past three decades, ACIA has made significant contributions to AI research through initiatives detailed in this paper, such as the International Conference on AI (CCIA), the magazine NODES, the Marc Esteva Vivanco Award for the Best PhD thesis in AI, and the donesIAcat working group. By presenting these initiatives, analyzing the evolution of AI research topics in Catalonia, and detailing ACIA’s involvement in Europe—including its role within EurAI and its industrial and international impact—, this article highlights how local AI societies contribute to the advancement of AI in Europe while preserving their unique cultural and academic identities. Finally, the future evolution of AI in Europe is discussed., Núria Agell acknowledges funding by grant PID2020-114247GB-I00 funded by MICIN and the support of the AGAUR research group 2021 SGR 01340. Vicent Costa acknowledges the support of research group 2021SGR00517 and funding from the project LINEXSYS: Logic-based Methods for Inconsistency Management in Explainable Intelligent Systems (PID2022-139835NB-C21). Zoe Falomir acknowledges funding by the Knut and Alice Wallenberg foundation and the Wallenberg AI, Autonomous Systems and Software Program (WASP). Karina Gibert acknowledges AGAUR 2021 SGR 01532. Beatriz López acknowledges funding by Generalitat de Catalunya 2021 SGR 01125. Lledó Museros acknowledges funding by grant PID2021-123152OB-C22 funded by MICIU/AEI/10.13039/501100011033. Aida Valls acknowledges funding by the Departament de Recerca i Universitats de la Generalitat de Catalunya (Consolidated research group 2021-SGR-00114) and URV (2023PFR-URV-00114), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Recovery operators in quasi-Nelson logic: the prelinear case

  • Flaminio, Tommaso
  • Godo, Lluis
  • Rivieccio, Umberto
This paper investigates recovery operators in quasi-Nelson logic, the algebraizable logical counterpart of quasi-Nelson algebras. These form a variety of three-potent, distributive, but not necessarily involutive residuated lattices that may be regarded as a common generalization of Nelson and Heyting algebras. We consider both consistency and determinedness operators, with a particular focus on logics and algebras that satisfy the prelinearity condition, which is well-known in the area of mathematical fuzzy logics. We show that, essentially, all algebraic and logical results already proved for (prelinear, distributive) involutive residuated lattice-based LFIs/LFUs can be recovered in the quasi-Nelson setting, where one dispenses with the involutivity assumption. In this setting, consistency and undeterminedness operators are no longer duals of one another, and hence call for a more fine-grained algebraic and logical formalization., Tommaso Flaminio acknowledges partial support from the 2023-PUNED-0052 grant ‘Investigadores tempranos UNED-SANTANDER’, the Spanish project SHORE (PID2022-141529NB-C22) funded by MCIN/AEI/10.13039/501100011033, and the H2020-MSCA-RISE-2020 project MOSAIC (Grant Agreement number 101007627). Lluis Godo acknowledges support from the Spanish project LINEXSYS (PID2022-139835NB-C21) funded by MCIN/AEI/10.13039/501100011033. Umberto Rivieccio acknowledges support from the 2023-PUNED-0052 grant ‘Investigadores tempranos UNED-SANTANDER’ and from the I+D+i research project PID2022-142378NB-I00 ‘PHIDELO’, funded by the Ministry of Science and Innovation of Spain., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Non-falsity and general threshold-preserving companions of MTL logics

  • Gispert, Joan
  • Godo, Lluis
  • Esteva, Francesc
[Data Statement] No data was used for the research described in the article., In this paper we study the definition and axiomatisation of different (finitary) threshold preserving companions of several extensions of the Monoidal t-norm based fuzzy logic MTL. More in detail, we first focus on the non-falsity preserving logics, where a conclusion follows from a set of premises if, whenever the premises are non-false (i.e., have a truth degree greater than 0), the conclusion is also non-false. We then introduce a new type of companions, namely logics that preserve the notion of acceptability , where a formula is called acceptable whenever it is deemed to be more true than false, or in other words it is more true than its negation. Finally, we also consider a more general stance and consider logics that preserve some intermediate truth-value 0 < a < 1, so that a can be understood as a (strict or non-strict) threshold above which a formula is considered as valid. All these types of threshold-preserving companions of a given MTL logic can be seen as particular cases of matrix logics defined by lattice filters., The authors are thankful to the anonymous reviewers for their helpful comments. The authors acknowledge support by the MOSAIC project (EU H2020-MSCA-RISE Project 101007627). Esteva and Godo acknowledge partial support by the Spanish project LINEXSYS (PID2022-139835NB-C21), and Gispert by the Spanish project SHORE (PID2022-141529NB-C21), both funded by MCIU/AEI/10.13039/501100011033. Gispert also acknowledges the project 2021 SGR 00348 funded by AGAUR., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Bounded and multi-adjoint lattice algebraizable logics

  • Cornejo, M. Eugenia
  • Esteva, Francesc
  • Fariñas del Cerro, Luis
  • Godo, Lluis
  • Medina, Jesús
[Data Statement] No data was used for the research described in the article., Nowadays is critical to complement Artificial Intelligence (AI) systems, such as those based on Deep Learning and Generative AI, by robust and trustworthy methodologies like different useful mathematical tools, such as (fuzzy) logic, formal concept analysis, rough set theory, etc. Multi-adjoint algebras are flexible structures considered in many of these mathematical tools, which are fundamental for obtaining traceable and reliable information from data sets. Along this line, this paper aims at introducing an algebraizable logic having the quasi-variety of these algebras as its associated equivalent algebraic semantics. To do so, we first introduce a logic associated with bounded lattices with an implication and show it is algebraizable in the sense of Blok-Pigozzi. We then expand this base logic to another algebraizable logic able to properly capture the multi-adjoint framework. Furthermore, we also consider different extensions of the logics and their properties analysed., The authors are indebted to the anonymous reviewers and Marcelo E. Coniglio for their helpful comments and suggestions. This research has been partially supported by the projects PID2022-139835NB-C21, PID2022-137620NB-I00, funded by MICIU/AEI/10.13039/501100011033 and FEDER, UE, by the grant TED2021-129748B-I00 funded by MCIN/AEI/10.13039/501100011033 and European Union NextGenerationEU/PRTR, and by the project FEDER-UCA-2024-A2-04 funded by Programa Operativo FEDER Andalucía 2021–2027 and by Consejería de Universidad, Investigación e Innovación, Junta de Andalucía., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

DeepTrust: Multi-Step Classification through Dissimilar Adversarial Representations for Robust Android Malware Detection

  • Pulido-Cortázar, Daniel
  • Gibert, Daniel
  • Manyà, Felip
[Data Statement] The dataset used is provided by the ELSA Robust Android Malware Detection Competition, which is publicly available. The code will be released upon acceptance of the paper to ensure reproducibility., Over the last decade, machine learning has been extensively applied to identify malicious Android applications. However, such approaches remain vulnerable against adversarial examples, i.e., examples that are subtly manipulated to fool a machine learning model into making incorrect predictions. This research presents DeepTrust, a novel metaheuristic that arranges flexible classifiers, like deep neural networks, into an ordered sequence where the final decision is made by a single internal model based on conditions activated in cascade. In the Robust Android Malware Detection competition at the 2025 IEEE Conference SaTML, DeepTrust secured the first place and achieved state-of-the-art results, outperforming the next-best competitor by up to 266% under feature-space evasion attacks. This is accomplished while maintaining the highest detection rate on non-adversarial malware and a false positive rate below 1%. The method's efficacy stems from maximizing the divergence of the learned representations among the internal models. By using classifiers inducing fundamentally dissimilar embeddings of the data, the decision space becomes unpredictable for an attacker. This frustrates the iterative perturbation process inherent to evasion attacks, enhancing system robustness without compromising accuracy on clean examples., D. Pulido-Cortázar was supported by a grant JAE-ICU 2024 funded by IIIA-CSIC (reference 04264). D. Gibert was supported by grant RYC2023-043607-I funded by MICIU/AEI/10.13039/501100011033 and FSE+. F. Manyà was supported by grant PID2022-139835NB-C21 funded by MCIN/AEI/10.13039/501100011033 and by ERDF, EU. The computational resources used in this work were provided by the Drago high-performance computing cluster, operated by the Scientific Computing Area of SGAI-CSIC. This research project was made possible through the access granted by the Galician Supercomputing Center (CESGA) to its supercomputing infrastructure. The supercomputer FinisTerrae III and its permanent data storage system have been funded by the NextGeneration EU 2021 Recovery, Transformation and Resilience Plan, ICT2021-006904, and also from the Pluriregional Operational Programme of Spain 2014–2020 of the European Regional Development Fund (ERDF), ICTS-2019-02-CESGA-3, and from the State Programme for the Promotion of Scientific and Technical Research of Excellence of the State Plan for Scientific and Technical Research and Innovation 2013–2016 State subprogramme for scientific and technical infrastructures and equipment of ERDF, CESG15-DE-3114., Peer reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Ethical prompting: toward strategies for rapid and inclusive assistance in dual-use AI systems

  • Farnós, Joan
  • Sans Pinillos, Alger
  • Costa, Vicent
Monitoring technologies initially developed for individuals with disabilities carry inherent dual-use risks, especially evident in conflict or emergency scenarios. This article examines the dual-use dilemma posed by technologies whose civilian design objectives can unintentionally facilitate harmful applications in defense contexts. Specifically, we analyze the ethical risks associated with using civilian-generated data and systems, originally intended to enhance care and assistance, for military purposes without adequate safeguards. We argue that effective and ethically sound technological infrastructures require optimized and ethically-informed prompting strategies. These strategies must clearly define how data and system prompts are structured, reducing deployment biases, particularly against vulnerable populations., The author(s) declare that financial support was received for the research and/or publication of this article. AS was supported by the “Generación D” initiative, Red.es, Ministerio para la Transformación Digital y de la Función Pública, for talent attraction (C005/24-ED CV1), funded by the European Union’s Next Generation EU program through the PRTR. VC was funded by the project PID2022-139835NB-C21 and supported by the research group 2021-SGR-00517., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Ethical prompting: toward strategies for rapid and inclusive assistance in dual-use AI systems

  • Farnós, Joan
  • Sans Pinillos, Alger
  • Costa, Vicent
Monitoring technologies initially developed for individuals with disabilities carry inherent dual-use risks, especially evident in conflict or emergency scenarios. This article examines the dual-use dilemma posed by technologies whose civilian design objectives can unintentionally facilitate harmful applications in defense contexts. Specifically, we analyze the ethical risks associated with using civilian-generated data and systems, originally intended to enhance care and assistance, for military purposes without adequate safeguards. We argue that effective and ethically sound technological infrastructures require optimized and ethically-informed prompting strategies. These strategies must clearly define how data and system prompts are structured, reducing deployment biases, particularly against vulnerable populations., The author(s) declare that financial support was received for the research and/or publication of this article. AS was supported by the “Generación D” initiative, Red.es, Ministerio para la Transformación Digital y de la Función Pública, for talent attraction (C005/24-ED CV1), funded by the European Union’s Next Generation EU program through the PRTR. VC was funded by the project PID2022-139835NB-C21 and supported by the research group 2021-SGR-00517., Peer Reviewed