Logic & Reasoning

The activity of this group is centered around the logical and mathematical modelling of reasoning, with special attention to mathematical fuzzy logic, uncertainty models, logics for incomplete information and computational argumentation, and the design of efficient algorithms for solving satisfaction and optimization problems by methods based on SAT, constraints and metaheuristics.

Head of the Group:  Pedro Meseguer
Mehmet Anil Akbay
PhD Student

Christian Blum
Scientific Researcher
Phone Ext. 214

Stefano Bonzio
Contract Researcher
Phone Ext. 225

Vicent Costa
PhD Student
Phone Ext. 303

Pilar Dellunde
Adjunct Scientist
Phone Ext. 239

Gonzalo Escalada-Imaz
Tenured Scientist
Phone Ext. 212

Francesc Esteva
Adjunct Professor Ad Honorem
Phone Ext. 219

Daniel Fernandez Martinez
Masters Student
Phone Ext. 272

Tommaso Flaminio
Tenured Scientist
Phone Ext. 233

Lluís Godo
Research Professor
Phone Ext. 217

Jordi Levy
Tenured Scientist
Phone Ext. 240

Albert López I Serrano
Masters Student
Phone Ext. 205

Felip Manyà
Tenured Scientist
Phone Ext. 248

Maria Paula Menchon
Visiting Scientist
Phone Ext. 225

Pedro Meseguer
Scientific Researcher
Phone Ext. 237

Teddy Nurcahyadi
PhD Student
Phone Ext. 234

Joan Ramon Soler
PhD Student
Phone Ext. 204

Guillem Rodriguez Corominas
Contract Engineer
Phone Ext. 204

Sara Ugolini
Contract Researcher
Phone Ext. 213

Amanda Vidal
Contract Researcher
Phone Ext. 252

In Press
Tommaso Flaminio,  & Lluís Godo (In Press). A fuzzy probability logic for compound conditionals. XX Spanish Congress on Fuzzy Logic and Technologies (ESTYLF 20/21) . [BibTeX]  [PDF]
Tommaso Flaminio,  Lluís Godo,  & Sara Ugolini (In Press). Canonical Extension of Possibility Measures to Boolean Algebras of Conditionals. Proc. ECSQARU 2021 . [BibTeX]
Pilar Dellunde,  Lluís Godo,  & Amanda Vidal (In Press). On probabilistic logical argumentation based on conditional probability. Proc. CCIA 2021 . [BibTeX]
Marcelo Coniglio,  Francesc Esteva,  Tommaso Flaminio,  & Lluís Godo (In Press). On the expressive power of Lukasiewicz’s square operator. Journal of Logic and Computation. [BibTeX]
Christian Blum,  & Gabriela Ochoa (2021). A comparative analysis of two matheuristics by means of merged local optima networks. European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2020.08.008. [BibTeX]
Filippo Bistaffa,  Christian Blum,  Jesús Cerquides,  Alessandro Farinelli,  & Juan A. Rodríguez-Aguilar (2021). A Computational Approach to Quantify the Benefits of Ridesharing for Policy Makers and Travellers. IEEE Transactions on Intelligent Transportation Systems, 22, 119-130. https://doi.org/10.1109/TITS.2019.2954982. [BibTeX]  [PDF]
Teddy Nurcahyadi,  & Christian Blum (2021). Adding Negative Learning to Ant Colony Optimization:A Comprehensive Study. Mathematics, 9. https://doi.org/10.3390/math9040361. [BibTeX]  [PDF]
Juan Carlos Teze,  & Lluís Godo (2021). An Architecture for Argumentation-based Epistemic Planning: A First Approach with Contextual Preferences. IEEE Intelligent Systems, 36, 43-51. https://doi.org/10.1109/MIS.2020.3028833. [BibTeX]  [PDF]
Marko Djukanovic,  Christoph Berger,  Günther R. Raidl,  & Christian Blum (2021). An A⁎ search algorithm for the constrained longest common subsequence problem. Information Processing Letters, 166, 106041. https://doi.org/10.1016/j.ipl.2020.106041. [BibTeX]  [PDF]
Francesc Esteva,  Lluís Godo,  & Sandra Sandri (2021). A similarity-based three-valued modal logic approach to reason with prototypes and counterexamples. MJ. Lesot, & C. Marsala (Eds.), Fuzzy Approaches for Soft Computing and Approximate Reasoning: Theories and Applications (pp 45-59). Springer. https://doi.org/10.1007/978-3-030-54341-9_5. [BibTeX]  [PDF]
Marcelo Coniglio,  Francesc Esteva,  Joan Gispert,  & Lluís Godo (2021). Degree-preserving Gödel logics with an involution: intermediate logics and (ideal) paraconsistency. O. Arielli, & A. Zamansky (Eds.), Arnon Avron on Semantics and Proof Theory of Non-Classical Logics (pp 107--139). Springer. https://doi.org/10.1007/978-3-030-71258-7_6. [BibTeX]  [PDF]
Stefano Bonzio,  Gustavo Cevolani,  & Tommaso Flaminio (2021). How to Believe Long Conjunctions of Beliefs: Probability, Quasi-Dogmatism and Contextualism. Erkenntnis. https://doi.org/10.1007/s10670-021-00389-7. [BibTeX]  [PDF]
Francesc Esteva,  Aldo Figallo-Orellano,  Tommaso Flaminio,  & Lluís Godo (2021). Logics of formal inconsistency based on distributive involutive residuated lattices. Journal of Logic and Computation. https://doi.org/10.1093/logcom/exab029. [BibTeX]  [PDF]
Rodolfo Ertola-Biraben,  Francesc Esteva,  & Lluís Godo (2021). On distributive join semilattices. D. Fazio, A. Ledda, & F. Paoli (Eds.), Algebraic Perspectives on Substructural Logics (pp 21-40). Springer, Cham. https://doi.org/10.1007/978-3-030-52163-9_3. [BibTeX]  [PDF]
Tommaso Flaminio (2021). On standard completeness and finite model property for a probabilistic logic on Łukasiewicz events. Int. J. Approx. Reason., 131, 136--150. https://doi.org/10.1016/j.ijar.2020.12.023. [BibTeX]  [PDF]
Jon Perez,  Jose Luis Flores,  Christian Blum,  Jesus Cerquides,  & Alex Abuin (2021). Optimization Techniques and Formal Verification for the Software Design of Boolean Algebra Based Safety-Critical Systems. IEEE Transactions on Industrial Informatics, 1-1. https://doi.org/10.1109/TII.2021.3074394. [BibTeX]
Jesús Giráldez-Cru,  & Jordi Levy (2021). Popularity-similarity random SAT formulas. Artificial Intelligence, 299, 103537. https://doi.org/10.1016/j.artint.2021.103537. [BibTeX]
Pilar Dellunde,  Lluís Godo,  & Amanda Vidal (2021). Probabilistic argumentation: an approach based on conditional probability -- a preliminary report--. Wolfgang Faber, Gerhard Friedrich, Martin Gebser, & Michael Morak (Eds.), Logics in Artificial Intelligence - 17th European Conference, {JELIA} 2021, Virtual Event, May 17-20, 2021, Proceedings (pp. 25--32). Springer. https://doi.org/10.1007/978-3-030-75775-5\_3. [BibTeX]  [PDF]
Gabriela Ochoa,  Katherine M. Malan,  & Christian Blum (2021). Search trajectory networks: A tool for analysing and visualising the behaviour of metaheuristics. Applied Soft Computing, 109, 107492. https://doi.org/10.1016/j.asoc.2021.107492. [BibTeX]
Christian Blum,  Marko Djukanovic,  Alberto Santini,  Hua Jiang,  Chu-Min Li,  Felip Manyà,  & Günter R. Raidl (2021). Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem. Computers & Operations Research, article number 105089. https://doi.org/10.1016/j.cor.2020.105089. [BibTeX]