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
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

Mehmet Anil Akbay
PhD Student

Pedro Meseguer
Scientific Researcher
Phone Ext. 237

Pilar Dellunde
Adjunct Scientist
Phone Ext. 239

Pol Pastells
Master Student

Sara Ugolini
Contract Researcher

Teddy Nurcahyadi
PhD Student
Phone Ext. 234

Tommaso Flaminio
Tenured Scientist
Phone Ext. 233

Vicent Costa
PhD Student
Phone Ext. 303

In Press
Juan Carlos Teze,  & Lluís Godo (In Press). An Architecture for Argumentation-based Epistemic Planning: A First Approach with Contextual Preferences. IEEE Intelligent Systems. https://doi.org/10.1109/MIS.2020.3028833. [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]
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]
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]
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]
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
Teddy Nurcahyadi,  & Christian Blum (2020). A New Approach for Making Use of Negative Learning in Ant Colony Optimization. Marco Dorigo, Thomas Stützle, Maria J. Blesa, Christian Blum, Heiko Hamann, Mary Katherine Heinrich, & Volker Strobel (Eds.), Swarm Intelligence (pp. 16--28). Springer International Publishing. [BibTeX]
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]
Amanda Vidal,  Francesc Esteva,  & Lluís Godo (2020). Axiomatizing logics of fuzzy preferences using graded modalities. Fuzzy Sets and Systems, 401, 163-188. https://doi.org/10.1016/j.fss.2020.01.002. [BibTeX]  [PDF]
Pedro Pinacho-Davidson,  & Christian Blum (2020). BARRAKUDA: A Hybrid Evolutionary Algorithm for Minimum Capacitated Dominating Set Problem. Mathematics, 8. https://doi.org/10.3390/math8111858. [BibTeX]  [PDF]
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]
Marko Djukanovic,  Christoph Berger,  Günther R. Raidl,  & Christian Blum (2020). On Solving a Generalized Constrained Longest Common Subsequence Problem. Nicholas Olenev, Yuri Evtushenko, Michael Khachay, & Vlasta Malkova (Eds.), Optimization and Applications (pp. 55--70). Springer International Publishing. [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]
Matthias Horn,  Marko Djukanovic,  Christian Blum,  & Günther R. Raidl (2020). On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. Nicholas Olenev, Yuri Evtushenko, Michael Khachay, & Vlasta Malkova (Eds.), Optimization and Applications (pp. 134--149). Springer International Publishing. [BibTeX]  [PDF]