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]
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]
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]
Ramon Bejar,
Cesar Fernandez,
Carles Mateu,
Felip Manyà,
Francina Sole-Mauri,
& David Vidal
(2012).The Automated Vacuum Waste Collection Optimization Problem.AAAI 2012(pp. 264-266).
[BibTeX]
2011
J. Argerlich,
Chu Min Li,
Felip Manyà,
& Jordi Planes
(2011).Analyzing the Instances of the MaxSAT Evaluation.14th International Conference on Theory and Applications of Satisfiability Testing, SAT 2011(pp. 360-361).
Springer.[BibTeX]
Cesar Fernandez,
Hector Geffner,
& Felip Manyà
(2011).Artificial Intelligence Research and Development
.
[BibTeX]
J. Argerlich,
Chu Min Li,
Felip Manyà,
& Jordi Planes
(2011).Experimenting with the Instances of the MaxSAT Evaluation.14th International Conference of the Catalan Association for Artificial Intelligence(pp. 31-40).
IOS Press.[BibTeX]
Carlos Ansótegui,
Miquel Bofill,
Felip Manyà,
& Mateu Villaret
(2011).Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic.41st IEEE International Symposium on Multiple-Valued Logic, ISMVL 2011(pp. 230-235).
[BibTeX]
Chu Min Li,
Zhu Zhu,
Felip Manyà,
& Laurent Simon
(2011).Minimum Satisfiability and Its Applications.22nd International Joint Conference on Artificial Intelligence, IJCAI 2011(pp. 605-610).
[BibTeX]
2010
Chu Min Li,
Felip Manyà,
Zhe Quan,
& Zhu Zhu
(2010).Exact MinSAT Solving.International Conference on Theory and Applications of Satisfiability Testing (SAT)(pp. 363-368).
Springer.[BibTeX]
J. Argerlich,
Alba Cabiscol,
Ines Lynce,
& Felip Manyà
(2010).New Insights into Encodings from MaxCSP into Partial MaxSAT.40th IEEE International Symposium on Multiple-Valued Logic (ISMVL)(pp. 46-52).
IEEE Computer Society.[BibTeX]
Chu Min Li,
Felip Manyà,
Nouredine Ould Mohamedou,
& Jordi Planes
(2010).Resolution-Based Lower Bounds in MaxSAT.Constraints, 15, 29.[BibTeX]
2009
Chu Min Li,
Felip Manyà,
Nouredine Ould Mohamedou,
& Jordi Planes
(2009).Exploiting Cycle Structures in Max-SAT.12th International Conference on Theory and Applications of Satisfiability Testing (SAT 2009)(pp. 467-480).
Springer.[BibTeX]