Felip
Manyà
Scientific Researcher
Logic and Reasoning
Research areas:
- Combinatorial Optimisation
Impact areas:
SDGs:
2022
Chu-Min Li,
Zhenxing Xu,
Jordi Coll,
Felip Manyà,
Djamal Habet,
& Kun He
(2022).
Boosting branch-and-bound MaxSAT solvers with clause learning.
AI Communications, 35, 131-151.
https://doi.org/10.3233/AIC-210178.
[BibTeX]
2021
Chu-Min Li,
Zhenxing Xu,
Jordi Coll,
Felip Manyà,
Djamal Habet,
& Kun He
(2021).
{Combining Clause Learning and Branch and Bound for MaxSAT}.
{27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}
.
https://doi.org/10.4230/LIPIcs.CP.2021.38.
[BibTeX]
[PDF]
Chu-Min Li,
Felip Manyà,
Joan Ramon Soler,
& Amanda Vidal
(2021).
From Non-Clausal to Clausal MinSAT.
https://doi.org/10.3233/FAIA210113.
[BibTeX]
[PDF]
Carlos Ansótegui,
Felip Manyà,
Jesus Ojeda,
Josep M. Salvia,
& Eduard Torres
(2021).
Incomplete MaxSAT Approaches for Combinatorial Testing.
CoRR, abs/2105.12552.
https://arxiv.org/abs/2105.12552.
[BibTeX]
[PDF]
Chu Min Li,
& Felip Manyà
(2021).
MaxSAT, Hard and Soft Constraints.
Handbook of satisfiability, second edition (pp 903--927).
IOS Press.
[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]
(2021).
Theory and Applications of Satisfiability Testing - {SAT}2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings
.
Springer.
https://doi.org/10.1007/978-3-030-80223-3.
[BibTeX]
2020
Chu{-}Min Li,
Fan Xiao,
Mao Luo,
Felip Many{\`{a}},
Zhipeng L{\"{u}},
& Yu Li
(2020).
Clause vivification by unit propagation in {CDCL}{SAT}solvers.
Artificial Intelligence, 279.
https://doi.org/10.1016/j.artint.2019.103197.
[BibTeX]
[PDF]
Felip Many{\`{a}},
Santiago Negrete,
Carme Roig,
& Joan Ramon Soler
(2020).
Solving the Team Composition Problem in a Classroom.
Fundamenta Informaticae, 174, 83--101.
https://doi.org/10.3233/FI-2020-1933.
[BibTeX]
[PDF]
2019
Chu-Min Li,
Fan Xiao,
& Felip Manyà
(2019).
{A resolution calculus for MinSAT}.
Logic Journal of the IGPL, 29, 28-44.
https://doi.org/10.1093/jigpal/jzz028.
[BibTeX]
Josep Argelich,
Chu Min Li,
Felip Manyà,
& Joan Ramon Soler
(2019).
{Clause tableaux for maximum and minimum satisfiability}.
Logic Journal of the IGPL, 29, 7-27.
https://doi.org/10.1093/jigpal/jzz025.
[BibTeX]
2017
Felip Manyà,
Santiago Negrete,
Carme Roig,
& Joan Ramon Soler
(2017).
A MaxSAT-Based Approach to the Team Composition Problem in a Classroom
(pp. 82-89).
AAMAS 2017.
[BibTeX]
2015
Miquel Bofill,
Felip Manyà,
Amanda Vidal,
& Mateu Villaret
(2015).
Finding Hard Instances of Satisfiability in Lukasiewicz Logics.
2015 IEEE International Symposium on Multiple-Valued Logic, ISMVL 2015
(pp. 30-35).
IEEE Press.
[BibTeX]
Miquel Bofill,
Felip Manyà,
Amanda Vidal,
& Mateu Villaret
(2015).
The Complexity of 3-Valued Lukasiewicz Rules.
12th Conference on Modeling Decisions for Artificial Intelligence (MDAI 2015)
(pp. 221-229).
Springer.
http://link.springer.com/chapter/10.1007/978-3-319-23240-9_18.
[BibTeX]
2013
Carlos Ansótegui,
María Luisa Bonet,
Jordi Levy,
& Felip Manyà
(2013).
Resolution Procedures for Multiple-Valued Optimization.
Information Sciences, 227, 43-59.
[BibTeX]
[PDF]
2012
Zhu Zhu,
Chu Min Li,
Felip Manyà,
& J. Argerlich
(2012).
A New Encoding from MinSAT into MaxSAT.
CP 2012
(pp. 455-463).
[BibTeX]
Carlos Ansótegui,
& Felip Manyà
(2012).
A SAT-Based Approach to MinSAT.
CCIA 2012
(pp. 185-189).
[BibTeX]
Carlos Ansótegui,
Miquel Bofill,
Felip Manyà,
& Mateu Villaret
(2012).
Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers.
ISMVL 2012
.
[BibTeX]
J. Argerlich,
Alba Cabiscol,
Ines Lynce,
& Felip Manyà
(2012).
Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT.
Multiple-Valued Logic and Soft Computing, 19, 3-23.
[BibTeX]
Chu Min Li,
Zhu Zhu,
Felip Manyà,
& Laurent Simon
(2012).
Optimizing with minimum satisfiability.
Artificial intelligence, 190, 32-44.
[BibTeX]
Prev
1 (current)
2
3
Next