Logic & Reasoning

The activity of this group is centered around the logical and mathematical modelling of reasoning, with special attention to logics for incomplete information, 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

 Coordinated by IIIA
Amanda Vidal
Contract Researcher
Phone Ext. 252
Christian Blum
Scientific Researcher
Phone Ext. 214
Felip Manyà
Tenured Scientist
Phone Ext. 248
Francesc Esteva
Adjunct Professor Ad Honorem
Phone Ext. 219
Gonzalo Escalada-Imaz
Tenured Scientist
Phone Ext. 212
Joan Ramon Soler
PhD Student
Phone Ext. 204
Jordi Levy
Tenured Scientist
Phone Ext. 240
Lluís Godo
Research Professor
Phone Ext. 217
Marco Mantilla
Ex PhD Student
   
Pedro Meseguer
Scientific Researcher
Phone Ext. 237
Pilar Dellunde
Adjunct Scientist
Phone Ext. 239
Teddy Nurcahyadi
PhD Student
Phone Ext. 234
Tommaso Flaminio
Tenured Scientist
Phone Ext. 233
Vicent Costa
PhD Student
Phone Ext. 303
In Press
Francesc Esteva,  Lluís Godo,  & Sandra Sandri (In Press). A similarity-based three-valued modal logic approach to reason with prototypes and counterexamples. [BibTeX]  [PDF]
Amanda Vidal,  Francesc Esteva,  & Lluís Godo (In Press). Axiomatizing logics of fuzzy preferences using graded modalities. Fuzzy Sets and Systems. https://doi.org/10.1016/j.fss.2020.01.002. [BibTeX]  [PDF]
Marcelo Coniglio,  Francesc Esteva,  Joan Gispert,  & Lluís Godo (In Press). Degree-preserving Gödel logics with an involution: intermediate logics and (ideal) paraconsistency. [BibTeX]  [PDF]
Rodolfo Ertola,  Francesc Esteva,  & Lluís Godo (In Press). On distributive join semilattices. Proceedings ASUBL [TAKE 6]. Springer. [BibTeX]  [PDF]
2021
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]
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]
2020
Christian Blum,  Marta Verdaguer,  Hèctor Monclús,  & Manel Poch (2020). A new optimization model for wastewater treatment planning with a temporal component. Process Safety and Environmental Protection, 136, 157 - 168. [BibTeX]
Marko Djukanovic,  Günther R. Raidl,  & Christian Blum (2020). Anytime algorithms for the longest common palindromic subsequence problem. Computers & Operations Research, 114, article number 104827. https://doi.org/10.1016/j.cor.2019.104827. [BibTeX]
Tommaso Flaminio,  Lluís Godo,  & Hykel Hosni (2020). Boolean algebras of conditionals, probability and logic. Artificial Intelligence, 286, 103347. https://doi.org/10.1016/j.artint.2020.103347. [BibTeX]  [PDF]
Maria Luisa Bonet,  & Jordi Levy (2020). Equivalence Between Systems Stronger Than Resolution. Proc. of the 23rd Int. Conf. on Theory and Applications of Satisfiability Testing, SAT'20, Alghero, Italy, July 3-10, 2020 (pp. 166--181). https://doi.org/10.1007/978-3-030-51825-7\_13. [BibTeX]  [PDF]
Marko Djukanovic,  Günther R. Raidl,  & Christian Blum (2020). Finding Longest Common Subsequences: New anytime A* search results. Applied Soft Computing, 95, 106499. https://doi.org/10.1016/j.asoc.2020.106499. [BibTeX]
Christian Blum (2020). Minimum common string partition: on solving large-scale problem instances. International Transactions in Operational Research, 27, 91--111. https://doi.org/10.1111/itor.12603. [BibTeX]
Bohan Li,  Xindi Zhang,  Shaowei Cai,  Jinkun Lin,  Yiyuan Wang,  & Christian Blum (2020). NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set. Proceedings of the Twenty-Nineth International Joint Conference on Artificial Intelligence, {IJCAI-20} . International Joint Conferences on Artificial Intelligence Organization. [BibTeX]
Francesc Esteva,  Lluís Godo,  Ricardo Oscar Rodríguez,  & Thomas Vetterlein (2020). On Ruspini's Models of Similarity-Based Approximate Reasoning. Marie{-}Jeanne Lesot, Susana M. Vieira, Marek Z. Reformat, Jo{\\~{a}}o Paulo Carvalho, Anna Wilbik, Bernadette Bouchon{-}Meunier, & Ronald R. Yager (Eds.), Information Processing and Management of Uncertainty in Knowledge-Based Systems - 18th International Conference, {IPMU}2020, Lisbon, Portugal, June 15-19, 2020, Proceedings, Part {I} (pp. 3--13). Springer. https://doi.org/10.1007/978-3-030-50146-4\_1. [BibTeX]  [PDF]
Lluís Godo,  Martín Sócola-Ramos,  & Francesc Esteva (2020). On the Logic of Left-Continuous t-Norms and Right-Continuous t-Conorms. Marie{-}Jeanne Lesot, Susana M. Vieira, Marek Z. Reformat, Jo{\\~{a}}o Paulo Carvalho, Anna Wilbik, Bernadette Bouchon{-}Meunier, & Ronald R. Yager (Eds.), Information Processing and Management of Uncertainty in Knowledge-Based Systems - 18th International Conference, {IPMU}2020, Lisbon, Portugal, June 15-19, 2020, Proceedings, Part {III} (pp. 654--665). Springer. https://doi.org/10.1007/978-3-030-50153-2\_48. [BibTeX]  [PDF]
Thomas Bläsius,  Tobias Friedrich,  Andreas Göbel,  Jordi Levy,  & Ralf Rothenberger (2020). The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. CoRR, abs/2004.07319. https://doi.org/https://arxiv.org/abs/2004.07319. [BibTeX]  [PDF]
Tommaso Flaminio (2020). Three Characterizations of Strict Coherence on Infinite-Valued Events. The Review of Symbolic Logic, 1--18. https://doi.org/10.1017/S1755020319000546. [BibTeX]
2019
Tommaso Flaminio,  Lluís Godo,  & Ricardo Oscar Rodriguez (2019). A Representation Theorem for Finite Godel Algebras with Operators. 11th conference of the European Society for Fuzzy Logic and Technology, EUSFLAT-2019 (Book of Abstracts) (pp. 51). [BibTeX]  [PDF]
Tommaso Flaminio,  Lluís Godo,  & Ricardo Oscar Rodriguez (2019). A Representation Theorem for Finite Gödel Algebras with Operators. 26th Workshop on Logic, Language, Information and Computation, WoLLIC 2019 (pp. 223-235). Springer. https://doi.org/10.1007/978-3-662-59533-6_14. [BibTeX]  [PDF]
Carlos Ansótegui,  Maria Luisa Bonet,  Jesús Giráldez-Cru,  Jordi Levy,  & Laurent Simon (2019). Community Structure in Industrial SAT Instances. J. Artif. Intell. Res., 66, 443--472. https://doi.org/10.1613/jair.1.11741. [BibTeX]  [PDF]