DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication
Artículo científico (JournalArticle)
Unimodular triangulations in Łukasiewicz logic: Complexity bounds of probabilistic coherence
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
Project:
AEI / Plan Estatal de Investigación Científica y Técnica y de Innovación 2021-2023 PID2022-141529NB-C22
,
EC / H2020 101007627
DOI: http://hdl.handle.net/10261/406360, https://api.elsevier.com/content/abstract/scopus_id/105015397826
HANDLE: http://hdl.handle.net/10261/406360, https://api.elsevier.com/content/abstract/scopus_id/105015397826