Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 22
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)

A logico-geometric comparison of coherence for non-additive uncertainty measures

  • Corsi, Esther Anna
  • Flaminio, Tommaso
  • Hosni, Hykel
Figures (3).- Tables (2), We investigate the notion of coherence for (non-)additive uncertainty measures from a logico-geometric point of view. Our main result is to the effect that distinct criteria for coherence are not always matched by axiomatically distinct measures of uncertainty. In addition we introduce a metalogic within which this kind of result can be captured formally., Corsi and Hosni acknowledge funding by the Department of Philosophy “Piero Martinetti” of the University of Milan under the Project “Departments of Excellence 2023-2027” awarded by the Italian Ministry of Education, University and Research (MIUR). Flaminio acknowledges partial support by the MOSAIC project (EU H2020- MSCA-RISE- 2020 Project 101007627) and also by the Spanish project PID2019-111544GB-C21 funded by MCIN/AEI/10.13039/501100011033. Hosni also acknowledges funding from the Deutsche Forschungsgemeinschaft (DFG, grant LA 4093/3-1)., Peer reviewed
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)

Encoding de Finetti's coherence within Łukasiewicz logic and MV-algebras

  • Flaminio, Tommaso
  • Ugolini, Sara
The present paper investigates proof-theoretical and algebraic properties for the probability logic FP(Ł,Ł), meant for reasoning on the uncertainty of Łukasiewicz events. Methodologically speaking, we will consider a translation function between formulas of FP(Ł,Ł) to the propositional language of Łukasiewicz logic that allows us to apply the latter and the well-developed theory of MV-algebras directly to probabilistic reasoning. More precisely, leveraging on such translation map, we will show proof-theoretical properties for FP(Ł,Ł) and introduce a class of algebras with respect to which FP(Ł,Ł) will be proved to be locally sound and complete. Finally, we will apply these previous results to investigate what we called “probabilistic unification problem”. In this respect, we will prove that Ghilardi’s algebraic view on unification can be extended to our case and, on par with the Łukasiewicz propositional case, we show that probabilistic unification is of nullary type., The authors acknowledge partial support by the MOSAIC project (H2020-MSCA-RISE-2020 Project 101007627). Ugolini acknowledges support from the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 890616 (H2020-MSCA-IF-2019) and the Ramón y Cajal programme RyC2021-032670-I., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Logics for the new AI spring

  • Flaminio, Tommaso
  • Hosni, Hykel
Call for papers, The School received generous funding from the MSCA project MOSAIC – Modalities for Substructural Logics: Theory, Methods and Applications (grant agreement number 101007627) the Fondazione Volta, the MUR (2020SSKZ7R) funded Project BRIO (sites.unimi.it/brio), the History and Philosophy of Computing Commission (HaPoC), and the Turing Center at ETH Zuerich., No
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 Artículo científico (JournalArticle)

Structural and universal completeness in algebra and logic

  • Aglianò, Paolo
  • Ugolini, Sara
In this work we study the notions of structural and universal completeness both from the algebraic and logical point of view. In particular, we provide new algebraic characterizations of quasivarieties that are actively and passively universally complete, and passively structurally complete. We apply these general results to varieties of bounded lattices and to quasivarieties related to substructural logics. In particular we show that a substructural logic satisfying weakening is passively structurally complete if and only if every classical contradiction is explosive in it. Moreover, we fully characterize the passively structurally complete varieties of -algebras, i.e., bounded commutative integral residuated lattices generated by chains., The authors acknowledge partial support by the MOSAIC project (H2020-MSCA-RISE-2020 Project 101007627). Ugolini acknowledges support from the Ramón y Cajal programme RyC2021-032670-I., 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)

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)

Free Constructions in Hoops via ℓ-Groups

  • Giustarini, Valeria
  • Manfucci, Francesco
  • Ugolini, Sara
Lattice-ordered abelian groups, or abelian -groups in what follows, are categorically equivalent to two classes of 0-bounded hoops that are relevant in the realm of the equivalent algebraic semantics of many-valued logics: liftings of cancellative hoops and perfect MV-algebras. The former generate the variety of product algebras, and the latter the subvariety of MV-algebras generated by perfect MV-algebras, that we shall call . In this work we focus on these two varieties and their relation to the structures obtained by forgetting the falsum constant 0, i.e., product hoops and DLW-hoops. As main results, we first show a characterization of the free algebras in these two varieties as particular weak Boolean products; then, we show a construction that freely generates a product algebra from a product hoop and a DLMV-algebra from a DLW-hoop. In other words, we exhibit the free functor from the two algebraic categories of hoops to the corresponding categories of 0-bounded algebras. Finally, we use the results obtained to study projective algebras and unification problems in the two varieties (and the corresponding logics); both varieties are shown to have (strong) unitary unification type, and as a consequence they are structurally and universally complete., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. Giustarini and Ugolini acknowledge partial support by the MOSAIC project (H2020-MSCA-RISE-2020 Project 101007627). Ugolini acknowledges support from the Ramón y Cajal programme RyC2021-032670-I., 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)

An art painting style explainable classifier grounded on logical and commonsense reasoning

  • Costa, Vicent
  • Alonso-Moral, José M.
  • Falomir, Zoe
  • Dellunde, Pilar
[Data Availability] The QArt-337 dataset, images, scripts needed for reproducibility of experiments as well as logs with reported results are available at https://gitlab.citius.usc.es/jose.alonso/xai4art/., This paper presents the art painting style explainable classifier named ANYXI. The classifier is based on art specialists’ knowledge of art styles and human-understandable color traits. ANYXI overcomes the principal flaws in the few art painting style classifiers in the literature. In this way, we first propose, using the art specialists’ studies, categorizations of the Baroque, Impressionism, and Post-Impressionism. Second, we carry out a human survey with the aim of validating the appropriateness of the color features used in the categorizations for human understanding. Then, we analyze and discuss the accuracy and interpretability of the ANYXI classifier. The study ends with an evaluation of the rationality of explanations automatically generated by ANYXI. We enrich the discussion and empirical validation of ANYXI by considering a quantitative and qualitative comparison versus other explainable classifiers. The reported results show how ANYXI is outstanding from the point of view of interpretability while keeping high accuracy (comparable to non-explainable classifiers). Moreover, automated generations are endowed with a good level of rationality., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work is supported by MCIN/AEI/10.13039/501100011033 under grants PID2021-123152OB-C21, PID2021-123152OB-C22, and RED2022-134315-T and the Galician Ministry of Culture, Education, Professional Training and University under grants ED431G2019/04 and ED431C2022/19. All grants were cofunded by the European Union and FEDER/ERDF (European Regional Development Funds). This work is also partially funded by the H2020-MSCARISE- 2020 project MOSAIC (Grant Agreement 101007627). Z. Falomir acknowledges funding by the Ramon-y-Cajal fellowship (RYC2019-027177-I / AEI / 10.13039/501100011033) awarded by the Spanish Ministry of Science, Innovation and Universities. V. Costa received funding from the Juan de la Cierva fellowship (FJC2021-047274-I) awarded by the Spanish Ministry of Science, Innovation and Universities, and the European Union (NextGenerationEU), and acknowledges the GEHUCT research group (2021 SGR 00517)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

An elementary belief function logic

  • Dubois, Didier
  • Godo, Lluis
  • Prade, Henri
Non-additive uncertainty theories, typically possibility theory, belief functions and imprecise probabilities share a common feature with modal logic: the duality properties between possibility and necessity measures, belief and plausibility functions as well as between upper and lower probabilities extend the duality between possibility and necessity modalities to the graded environment. It has been shown that the all-or-nothing version of possibility theory can be exactly captured by a minimal epistemic logic (MEL) that uses a very small fragment of the KD modal logic, without resorting to relational semantics. Independently, a belief function logic has been obtained by extending the modal logic S5 to probabilistic graded modalities using Łukasiewicz logic, albeit using relational semantics. This paper shows that a simpler belief function logic can be devised by adding Łukasiewicz logic on top of MEL. It allows for a more natural semantics in terms of Shafer basic probability assignments., Godo acknowledges partial support by Europea Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 101007627 and by the Agencia Estatal de Investigación AEI/10.13039/501100011033 under the grant PID2019-111544GB-C21., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Counterfactuals as modal conditionals, and their probability

  • Rosella, Giuliano
  • Flaminio, Tommaso
  • Bonzio, Stefano
In this paper we propose a semantic analysis of Lewis' counterfactuals. By exploiting the structural properties of the recently introduced boolean algebras of conditionals, we show that counterfactuals can be expressed as formal combinations of a conditional object and a normal necessity modal operator. Specifically, we introduce a class of algebras that serve as modal expansions of boolean algebras of conditionals, together with their dual relational structures. Moreover, we show that Lewis' semantics based on sphere models can be reconstructed in this framework. As a consequence, we establish the soundness and completeness of a slightly stronger variant of Lewis' logic for counterfactuals with respect to our algebraic models. In the second part of the paper, we present a novel approach to the probability of counterfactuals showing that it aligns with the uncertainty degree assigned by a belief function, as per Dempster-Shafer theory, to its associated conditional formula. Furthermore, we characterize the probability of a counterfactual in terms of Gärdenfors' imaging rule for the probabilistic update., The authors thank the anonymous referees and journal editors for their comments, suggestions, and constructive criticism. The authors are also indebted to Lluis Godo and Jan Sprenger for their help. Flaminio acknowledges partial support by the Spanish project PID2019-111544GB-C21 funded by MCIN/AEI/10.13039/501100011033 and Bonzio by the INdAM, GNSAGA - Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni. Flaminio and Bonzio acknowledge partial support by the MOSAIC project EU H2020-MSCA-RISE-2020 Project 101007627., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

On conditional probabilities and their canonical extensions to Boolean algebras of compound conditionals

  • Flaminio, Tommaso
  • Gilio, Angelo
  • Godo, Lluis
  • Sanfilippo, Giuseppe
[Data availability] No data was used for the research described in the article., In this paper we investigate canonical extensions of conditional probabilities to Boolean algebras of conditionals. Before entering into the probabilistic setting, we first prove that the lattice order relation of every Boolean algebra of conditionals can be characterized in terms of the well-known order relation given by Goodman and Nguyen. Then, as an interesting methodological tool, we show that canonical extensions behave well with respect to conditional subalgebras. As a consequence, we prove that a canonical extension and its original conditional probability agree on basic conditionals. Moreover, we verify that the probability of conjunctions and disjunctions of conditionals in a recently introduced framework of Boolean algebras of conditionals are in full agreement with the corresponding operations of conditionals as defined in the approach developed by two of the authors to conditionals as three-valued objects, with betting-based semantics, and specified as suitable random quantities. Finally we discuss relations of our approach with nonmonotonic reasoning based on an entailment relation among conditionals., The authors are grateful to the anonymous reviewers for their helpful comments and suggestions. Flaminio and Godo acknowledge partial support by the MOSAIC project (EU H2020-MSCA-RISE-2020 Project 101007627) and also by the Spanish project PID2019-111544GB-C21/AEI/10.13039/501100011033. Sanfilippo acknowledges support by the FFR 2023 project of University of Palermo, Italy., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Unimodular triangulations in Łukasiewicz logic: Complexity bounds of probabilistic coherence

  • Flaminio, Tommaso
  • Lapenta, Serafina
  • Napolitano, Sebastiano
A proof for the NP-containment for the probabilistic coherence problem over events represented by formulas of the infinite-valued Łukasiewicz logic was proposed in [1]. The geometric and combinatorial argument to prove that complexity bound contains a mistake that is fixed in the present paper. Actually we present two ways to restore that imprecise claim and, by doing so, we show that the main result of that paper is indeed valid., The authors are grateful to the referees and their valuable comments that sensibly improved the presentation of the present paper. Flaminio acknowledges partial support from the Spanish project SHORE (PID2022-141529NB-C22) funded by the MCIN/AEI/10.13039/501100011033, and the H2020-MSCA-RISE-2020 project MOSAIC (Grant Agreement number 101007627). Lapenta and Napolitano acknowledge financial support under the National Recovery and Resilience Plan (NRRP), Mission 4, Component 2, Investment 1.1, Call for tender No. 1409 published on 14.9.2022 by the Italian Ministry of University and Research (MUR), funded by the European Union – NextGenerationEU – Project Title Quantum Models for Logic, Computation and Natural Processes (Qm4Np) – CUP F53D23011170001 —Grant Assignment Decree No. 1016 adopted on 07/07/2023 by the Italian Ministry of Ministry of University and Research (MUR). The research was partially supported by GNSAGA–INdAM., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

The Algebras of Lewis’s Counterfactuals: axiomatizations and algebraizability

  • Rosella, Giuliano
  • Ugolini, Sara
The logico-algebraic study of Lewis’s hierarchy of variably strict conditional logics has been essentially unexplored, hindering our understanding of their mathematical foundations, and the connections with other logical systems. This work starts filling this gap by providing a logico-algebraic analysis of Lewis’s logics. We begin by introducing novel finite axiomatizations for Lewis’s logics on the syntactic side, distinguishing between global and local consequence relations on Lewisian sphere models on the semantical side, in parallel to the case of modal logic. As first main results, we prove the strong completeness of the calculi with respect to the corresponding semantical consequence on spheres, and a deduction theorem. We then demonstrate that the global calculi are strongly algebraizable in terms of a variety of Boolean algebras with a binary operator representing the counterfactual implication; in contrast, we show that the local ones are generally not algebraizable, although they can be characterized as the degree-preserving logic over the same algebraic models. This yields the strong completeness of all the logics with respect to the algebraic models., Giuliano Rosella acknowledges financial support from the Italian Ministry of University and Research (MUR) through the PRIN 2022 grant n. 2022ARRY9N (Reasoning with hypotheses: Integrating logical, probabilistic, and experimental perspectives), funded by the European Union (Next Generation EU). Sara Ugolini acknowledges support from the Ramón y Cajal programme (RyC2021-032670-I), the Spanish project SHORE (PID2022-141529NB-C22), and the MOSAIC project (H2020-MSCA-RISE-2020 Project 101007627)., 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)

The algebras of Lewis's Counterfactuals: duality theory

  • Rosella, Giuliano
  • Ugolini, Sara
This paper explores the mathematical connections between the algebraic and relational semantics of Lewis’s logics for counterfactual conditionals. Specifically, we introduce topological variants of Lewis’s well-known possible-worlds semantics—based on spheres, selection functions, and orders—and establish duality results with respect to varieties of Boolean algebras equipped with a counterfactual operator, which serve as the equivalent algebraic semantics of Lewis’s main systems. These results aim to provide a solid mathematical foundation for the study of Lewis’s logics, and offer a new perspective on the most well-known possible worlds-based models. In particular, we write explicit proofs for several results that are often assumed without proof in the literature. Leveraging these duality results, we also derive alternative proofs of strong completeness for Lewis’s variably strict conditional logics with respect to their intended models, and clarify the role of the limit assumption in sphere semantics., G.R. acknowledges financial support from the Italian Ministry of University and Research (MUR) through the PRIN 2022 grant no. 2022ARRY9N (Reasoning with hypotheses: Integrating logical, probabilistic, and experimental perspectives), funded by the European Union (Next Generation EU), and from PLEXUS (Grant Agreement no. 101086295), a Marie Sklodowska-Curie action funded by the EU under the Horizon Europe Research and Innovation Programme. G.R. also acknowledges partial funding support from the OP JAK project “Knowledge in the Age of Distrust (TRUST)” (No. CZ.02.01.01/00/23_025/0008711). S.U. acknowledges support from the Ramón y Cajal programme (RyC2021-032670-I), the Spanish project SHORE (PID2022-141529NB-C22), the MOSAIC project (H2020-MSCA-RISE-2020 Project 101007627), and the project PIE CSIC 20235AT019., 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