Felip Manyà

Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Resolution procedures for multiple-valued optimization. Inf. Sci. 227: 43-59 (2013)

Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon: Optimizing with minimum satisfiability. Artif. Intell. 190: 32-44 (2012)

Francesc Esteva, Joan Gispert, Felip Manyà: Introduction to the Special Issue of the IEEE 40th International Symposium on Multiple-Valued Logic. Multiple-Valued Logic and Soft Computing 19(1-3): 1-2 (2012)

Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT. Multiple-Valued Logic and Soft Computing 19(1-3): 3-23 (2012)

Francesc Esteva, Joan Gispert, Felip Manyà: Foreward. Multiple-Valued Logic and Soft Computing 19(4): 283 (2012)

Ramón Béjar, Cèsar Fernández, Carles Mateu, Felip Manyà, Francina Sole-Mauri, David Vidal: The Automated Vacuum Waste Collection Optimization Problem. AAAI 2012

Carlos Ansótegui, Chu Min Li, Felip Manyà, Zhu Zhu: A SAT-Based Approach to MinSAT. CCIA 2012: 185-189

Zhu Zhu, Chu Min Li, Felip Manyà, Josep Argelich: A New Encoding from MinSAT into MaxSAT. CP 2012: 455-463

Ramón Béjar, Cèsar Fernández, Felip Manyà, Carles Mateu, Francina Sole-Mauri: Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems. ICTAI 2012: 291-298

Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret: Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers. ISMVL 2012: 25-30

Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes: Experimenting with the Instances of the MaxSAT Evaluation. CCIA 2011: 31-40

Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon: Minimum Satisfiability and Its Applications. IJCAI 2011: 605-610

Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret: Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic. ISMVL 2011: 230-235

Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes: Analyzing the Instances of the MaxSAT Evaluation. SAT 2011: 360-361

Cèsar Fernández, Hector Geffner, Felip Manyà (Eds.): Artificial Intelligence Research and Development - Proceedings of the 14th International Conference of the Catalan Association for Artificial Intelligence, Lleida, Catalonia, Spain, October 26-28, 2011. Frontiers in Artificial Intelligence and Applications 232, IOS Press 2011, isbn 978-1-60750-841-0

Chu Min Li, Felip Manyà, Jordi Planes: New Inference Rules for Max-SAT. CoRR abs/1111.0040 (2011)

Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes: Resolution-based lower bounds in MaxSAT. Constraints 15(4): 456-484 (2010)

Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: New Insights into Encodings from MaxCSP into Partial MaxSAT. ISMVL 2010: 46-52

Chu Min Li, Felip Manyà, Zhe Quan, Zhu Zhu: Exact MinSAT Solving. SAT 2010: 363-368

Ramón Béjar, Alba Cabiscol, Felip Manyà, Jordi Planes: Generating Hard Instances for MaxSAT. ISMVL 2009: 191-195

Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Regular Encodings from Max-CSP into Partial Max-SAT. ISMVL 2009: 196-202

Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Sequential Encodings from Max-CSP into Partial Max-SAT. SAT 2009: 161-166

Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes: Exploiting Cycle Structures in Max-SAT. SAT 2009: 467-480

Chu Min Li, Felip Manyà: MaxSAT, Hard and Soft Constraints. Handbook of Satisfiability 2009: 613-631

Teresa Alsinet, Felip Manyà, Jordi Planes: An efficient solver for weighted Max-SAT. J. Global Optimization 41(1): 61-73 (2008)

Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes: The First and Second Max-SAT Evaluations. JSAT 4(2-4): 251-278 (2008)

Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Measuring the Hardness of SAT Instances. AAAI 2008: 222-228

Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes: Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. CP 2008: 582-587

Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Encoding Max-CSP into Partial Max-SAT. ISMVL 2008: 106-111

Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Modelling Max-CSP as Partial Max-SAT. SAT 2008: 1-14

Josep Argelich, Chu Min Li, Felip Manyà: A Preprocessor for Max-SAT Solvers. SAT 2008: 15-20

Maria Luisa Bonet, Jordi Levy, Felip Manyà: Resolution for Max-SAT. Artif. Intell. 171(8-9): 606-618 (2007)

Carlos Ansótegui, Jose Larrubia, Chu Min Li, Felip Manyà: Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. Ann. Math. Artif. Intell. 49(1-4): 191-205 (2007)

Ramón Béjar, Felip Manyà, Alba Cabiscol, Cèsar Fernández, Carla P. Gomes: Regular-SAT: A many-valued approach to solving combinatorial problems. Discrete Applied Mathematics 155(12): 1613-1626 (2007)

Chu Min Li, Felip Manyà, Jordi Planes: New Inference Rules for Max-SAT. J. Artif. Intell. Res. (JAIR) 30: 321-359 (2007)

Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Inference Rules for High-Order Consistency in Weighted CSP. AAAI 2007: 167-172

Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: What Is a Real-World SAT Instance? CCIA 2007: 19-28

Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: The Logic Behind Weighted CSP. IJCAI 2007: 32-37

Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: A Complete Resolution Calculus for Signed Max-SAT. ISMVL 2007: 22

Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Mapping CSP into Many-Valued SAT. SAT 2007: 10-15

Josep Argelich, Felip Manyà: Partial Max-SAT Solvers with Clause Learning. SAT 2007: 28-40

Josep Argelich, Felip Manyà: Exact Max-SAT solvers for over-constrained problems. J. Heuristics 12(4-5): 375-392 (2006)

Chu Min Li, Felip Manyà, Jordi Planes: Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. AAAI 2006: 86-91

Josep Argelich, Xavier Domingo, Chu Min Li, Felip Manyà, Jordi Planes: Towards Solving Many-Valued MaxSAT. ISMVL 2006: 26

Maria Luisa Bonet, Jordi Levy, Felip Manyà: A Complete Calculus for Max-SAT. SAT 2006: 240-251

Chu Min Li, Felip Manyà, Jordi Planes: Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. CP 2005: 403-414

Josep Argelich, Felip Manyà: Solving Over-Constrained Problems with SAT. CP 2005: 838

Carlos Ansótegui, Felip Manyà: Mapping Many-Valued CNF Formulas to Boolean CNF Formulas. ISMVL 2005: 290-295

Josep Argelich, Felip Manyà: Solving Over-Constrained Problems with SAT Technology. SAT 2005: 1-15

Teresa Alsinet, Felip Manyà, Jordi Planes: Improved Exact Solvers for Weighted Max-SAT. SAT 2005: 371-377

Carlos Ansótegui, Alvaro del Val, Iván Dotú, Cèsar Fernández, Felip Manyà: Modeling Choices in Quasigroup Completion: SAT vs. CSP. AAAI 2004: 137-142

Teresa Alsinet, Felip Manyà, Jordi Planes: A Max-SAT Solver with Lazy Data Structures. IBERAMIA 2004: 334-342

Carlos Ansótegui, Ramón Béjar, Alba Cabiscol, Felip Manyà: The Interface between P and NP in Signed CNF Formulas. ISMVL 2004: 251-256

Carlos Ansótegui, Felip Manyà: Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables. SAT 2004

Carlos Ansótegui, Felip Manyà: Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. SAT (Selected Papers 2004: 1-15

Felip Manyà, Carla P. Gomes: Técnicas de resolución de problemas de satisfacción de restricciones. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 7(19): 169-180 (2003)

Carlos Ansótegui, Felip Manyà: Una introducción a los algoritmos de satisfactibilidad. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 7(20): 43-56 (2003)

Teresa Alsinet, Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Felip Manyà: Automated monitoring of medical protocols: a secure and distributed architecture. Artificial Intelligence in Medicine 27(3): 367-392 (2003)

Hantao Zhang, Haiou Shen, Felip Manyà: Exact Algorithms for MAX-SAT. Electr. Notes Theor. Comput. Sci. 86(1): 190-203 (2003)

Carlos Ansótegui, Jose Larrubia, Felip Manyà: Boosting Chaff's Performance by Incorporating CSP Heuristics. CP 2003: 96-107

Carlos Ansótegui, Felip Manyà: New Logical and Complexity Results for Signed-SAT. ISMVL 2003: 181-187

Teresa Alsinet, Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà: Minimal and Redundant SAT Encodings for the All-Interval-Series Problem. CCIA 2002: 139-144

Carlos Ansótegui, Felip Manyà: Bridging the Gap between SAT and CSP. CP 2002: 784-785

Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes: Extending the Reach of SAT with Many-Valued Logics. Electronic Notes in Discrete Mathematics 9: 392-407 (2001)

Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes: Capturing Structure with Satisfiability. CP 2001: 137-152

Ramón Béjar, Reiner Hähnle, Felip Manyà: A Modular Reduction of Regular Logic to Classical Logic. ISMVL 2001: 221-226

Ramón Béjar, Felip Manyà: Solving the Round Robin Problem Using Propositional Logic. AAAI/IAAI 2000: 262-266

Teresa Alsinet, Ramón Béjar, Cèsar Fernández, Felip Manyà: A Multi-agent system architecture for monitoring medical protocols. Agents 2000: 499-505

Bernhard Beckert, Reiner Hähnle, Felip Manyà: The 2-SAT Problem of Regular Signed CNF Formulas. ISMVL 2000: 331-336

Ramón Béjar, Felip Manyà: A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas. ESCQARU 1999: 22-31

Ramón Béjar, Felip Manyà: Phase Transitions in the Regular Random 3-SAT Problem. ISMIS 1999: 292-300

Bernhard Beckert, Reiner Hähnle, Felip Manyà: Transformations between Signed and Classical Clause Logic. ISMVL 1999: 248-255

Ramón Béjar, Felip Manyà: Solving Combinatorial Problems with Regular Local Search Algorithms. LPAR 1999: 33-43

Felip Manyà, Ramón Béjar, Gonzalo Escalada-Imaz: The satisfiability problem in regular CNF-formulas. Soft Comput. 2(3): 116-123 (1998)

Gonzalo Escalada-Imaz, Felip Manyà: Efficient Interpretation of Propositional Multiple-valued Logic Programs. IPMU 1994: 428-439

Gonzalo Escalada-Imaz, Felip Manyà: The Satisfiability Problem in Multiple-Valued Horn Formulae. ISMVL 1994: 250-256