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
Prev
1 (current)
2
Next
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]
Stefano Bonzio,
Gustavo Cevolani,
& Tommaso Flaminio
(In Press).
How to believe long conjunctions of beliefs: probability, quasi-dogmatism and contextualism.
Erkenntnis.
https://doi.org/https://philarchive.org/rec/BONHTB-3.
[BibTeX]
[PDF]
Tommaso Flaminio
(In Press).
On standard completeness and finite model property for a probabilistic logic on Łukasiewicz events.
International Journal of Approximate Reasoning.
https://doi.org/10.1016/j.ijar.2020.12.023.
[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]
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]
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]
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]
Francesc Esteva,
Aldo Orellano,
Tommaso Flaminio,
& Lluís Godo
(2020).
Degree-preserving companion of Nelson logic expanded with a consistency operator.
Anais do I Workshop Brasileiro de Lógica
(pp. 41--48).
SBC.
https://doi.org/10.5753/wbl.2020.11457.
[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]
Tommaso Flaminio,
& Sara Ugolini
(2020).
Hyperstates of Involutive MTL-Algebras that Satisfy $(2x)^2=2(x^2)$.
Shier Ju, Alessandra Palmigiano, & Minghui Ma (Eds.),
Nonclassical Logics and Their Applications
(pp. 1--14).
Springer Singapore.
[BibTeX]
[PDF]
Prev
1 (current)
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
Next