Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Felip Manyà
2010 – today
- 2013
[j19]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Resolution procedures for multiple-valued optimization. Inf. Sci. 227: 43-59 (2013)- 2012
- [j18]Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon: Optimizing with minimum satisfiability. Artif. Intell. 190: 32-44 (2012)
- [j17]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)
- [j16]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)
- [j15]Francesc Esteva, Joan Gispert, Felip Manyà: Foreward. Multiple-Valued Logic and Soft Computing 19(4): 283 (2012)
- [c54]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
- [c53]Carlos Ansótegui, Chu Min Li, Felip Manyà, Zhu Zhu: A SAT-Based Approach to MinSAT. CCIA 2012: 185-189
- [c52]Zhu Zhu, Chu Min Li, Felip Manyà, Josep Argelich: A New Encoding from MinSAT into MaxSAT. CP 2012: 455-463
- [c51]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
- [c50]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
- 2011
- [c49]Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes: Experimenting with the Instances of the MaxSAT Evaluation. CCIA 2011: 31-40
- [c48]Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon: Minimum Satisfiability and Its Applications. IJCAI 2011: 605-610
- [c47]Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret: Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic. ISMVL 2011: 230-235
- [c46]Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes: Analyzing the Instances of the MaxSAT Evaluation. SAT 2011: 360-361
- [e1]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
- [i1]
- 2010
- [j14]Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes: Resolution-based lower bounds in MaxSAT. Constraints 15(4): 456-484 (2010)
- [c45]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: New Insights into Encodings from MaxCSP into Partial MaxSAT. ISMVL 2010: 46-52
- [c44]
2000 – 2009
- 2009
- [c43]Ramón Béjar, Alba Cabiscol, Felip Manyà, Jordi Planes: Generating Hard Instances for MaxSAT. ISMVL 2009: 191-195
- [c42]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Regular Encodings from Max-CSP into Partial Max-SAT. ISMVL 2009: 196-202
- [c41]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Sequential Encodings from Max-CSP into Partial Max-SAT. SAT 2009: 161-166
- [c40]Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes: Exploiting Cycle Structures in Max-SAT. SAT 2009: 467-480
- [p1]Chu Min Li, Felip Manyà: MaxSAT, Hard and Soft Constraints. Handbook of Satisfiability 2009: 613-631
- 2008
- [j13]Teresa Alsinet, Felip Manyà, Jordi Planes: An efficient solver for weighted Max-SAT. J. Global Optimization 41(1): 61-73 (2008)
- [j12]Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes: The First and Second Max-SAT Evaluations. JSAT 4(2-4): 251-278 (2008)
- [c39]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Measuring the Hardness of SAT Instances. AAAI 2008: 222-228
- [c38]Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes: Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. CP 2008: 582-587
- [c37]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Encoding Max-CSP into Partial Max-SAT. ISMVL 2008: 106-111
- [c36]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Modelling Max-CSP as Partial Max-SAT. SAT 2008: 1-14
- [c35]
- 2007
- [j11]Maria Luisa Bonet, Jordi Levy, Felip Manyà: Resolution for Max-SAT. Artif. Intell. 171(8-9): 606-618 (2007)
- [j10]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)
- [j9]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)
- [j8]Chu Min Li, Felip Manyà, Jordi Planes: New Inference Rules for Max-SAT. J. Artif. Intell. Res. (JAIR) 30: 321-359 (2007)
- [c34]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Inference Rules for High-Order Consistency in Weighted CSP. AAAI 2007: 167-172
- [c33]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: What Is a Real-World SAT Instance? CCIA 2007: 19-28
- [c32]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: The Logic Behind Weighted CSP. IJCAI 2007: 32-37
- [c31]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: A Complete Resolution Calculus for Signed Max-SAT. ISMVL 2007: 22
- [c30]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Mapping CSP into Many-Valued SAT. SAT 2007: 10-15
- [c29]
- 2006
- [j7]Josep Argelich, Felip Manyà: Exact Max-SAT solvers for over-constrained problems. J. Heuristics 12(4-5): 375-392 (2006)
- [c28]Chu Min Li, Felip Manyà, Jordi Planes: Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. AAAI 2006: 86-91
- [c27]Josep Argelich, Xavier Domingo, Chu Min Li, Felip Manyà, Jordi Planes: Towards Solving Many-Valued MaxSAT. ISMVL 2006: 26
- [c26]
- 2005
- [c25]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
- [c24]
- [c23]Carlos Ansótegui, Felip Manyà: Mapping Many-Valued CNF Formulas to Boolean CNF Formulas. ISMVL 2005: 290-295
- [c22]
- [c21]Teresa Alsinet, Felip Manyà, Jordi Planes: Improved Exact Solvers for Weighted Max-SAT. SAT 2005: 371-377
- 2004
- [c20]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
- [c19]Teresa Alsinet, Felip Manyà, Jordi Planes: A Max-SAT Solver with Lazy Data Structures. IBERAMIA 2004: 334-342
- [c18]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
- [c17]Carlos Ansótegui, Felip Manyà: Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables. SAT 2004
- [c16]Carlos Ansótegui, Felip Manyà: Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. SAT (Selected Papers 2004: 1-15
- 2003
- [j6]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)
- [j5]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)
- [j4]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)
- [j3]Hantao Zhang, Haiou Shen, Felip Manyà: Exact Algorithms for MAX-SAT. Electr. Notes Theor. Comput. Sci. 86(1): 190-203 (2003)
- [c15]Carlos Ansótegui, Jose Larrubia, Felip Manyà: Boosting Chaff's Performance by Incorporating CSP Heuristics. CP 2003: 96-107
- [c14]Carlos Ansótegui, Felip Manyà: New Logical and Complexity Results for Signed-SAT. ISMVL 2003: 181-187
- 2002
- [c13]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
- [c12]
- 2001
- [j2]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)
- [c11]Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes: Capturing Structure with Satisfiability. CP 2001: 137-152
- [c10]Ramón Béjar, Reiner Hähnle, Felip Manyà: A Modular Reduction of Regular Logic to Classical Logic. ISMVL 2001: 221-226
- 2000
- [c9]Ramón Béjar, Felip Manyà: Solving the Round Robin Problem Using Propositional Logic. AAAI/IAAI 2000: 262-266
- [c8]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
- [c7]Bernhard Beckert, Reiner Hähnle, Felip Manyà: The 2-SAT Problem of Regular Signed CNF Formulas. ISMVL 2000: 331-336
1990 – 1999
- 1999
- [c6]Ramón Béjar, Felip Manyà: A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas. ESCQARU 1999: 22-31
- [c5]Ramón Béjar, Felip Manyà: Phase Transitions in the Regular Random 3-SAT Problem. ISMIS 1999: 292-300
- [c4]Bernhard Beckert, Reiner Hähnle, Felip Manyà: Transformations between Signed and Classical Clause Logic. ISMVL 1999: 248-255
- [c3]Ramón Béjar, Felip Manyà: Solving Combinatorial Problems with Regular Local Search Algorithms. LPAR 1999: 33-43
- 1998
- [j1]Felip Manyà, Ramón Béjar, Gonzalo Escalada-Imaz: The satisfiability problem in regular CNF-formulas. Soft Comput. 2(3): 116-123 (1998)
- 1994
- [c2]Gonzalo Escalada-Imaz, Felip Manyà: Efficient Interpretation of Propositional Multiple-valued Logic Programs. IPMU 1994: 428-439
- [c1]Gonzalo Escalada-Imaz, Felip Manyà: The Satisfiability Problem in Multiple-Valued Horn Formulae. ISMVL 1994: 250-256
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-16 21:40 CEST by the dblp team