Felip Manyà

2008
51		Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Measuring the Hardness of SAT Instances. AAAI 2008: 222-228
50	EE	Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes: Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. CP 2008: 582-587
49	EE	Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Encoding Max-CSP into Partial Max-SAT. ISMVL 2008: 106-111
48	EE	Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Modelling Max-CSP as Partial Max-SAT. SAT 2008: 1-14
47	EE	Josep Argelich, Chu Min Li, Felip Manyà: A Preprocessor for Max-SAT Solvers. SAT 2008: 15-20
46	EE	Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes: The First and Second Max-SAT Evaluations. JSAT 4(2-4): 251-278 (2008)
2007
45		Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Inference Rules for High-Order Consistency in Weighted CSP. AAAI 2007: 167-172
44		Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: What Is a Real-World SAT Instance? CCIA 2007: 19-28
43	EE	Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: The Logic Behind Weighted CSP. IJCAI 2007: 32-37
42	EE	Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: A Complete Resolution Calculus for Signed Max-SAT. ISMVL 2007: 22
41	EE	Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Mapping CSP into Many-Valued SAT. SAT 2007: 10-15
40	EE	Josep Argelich, Felip Manyà: Partial Max-SAT Solvers with Clause Learning. SAT 2007: 28-40
39	EE	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)
38	EE	Maria Luisa Bonet, Jordi Levy, Felip Manyà: Resolution for Max-SAT. Artif. Intell. 171(8-9): 606-618 (2007)
37	EE	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)
36	EE	Chu Min Li, Felip Manyà, Jordi Planes: New Inference Rules for Max-SAT. J. Artif. Intell. Res. (JAIR) 30: 321-359 (2007)
2006
35		Chu Min Li, Felip Manyà, Jordi Planes: Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. AAAI 2006
34	EE	Josep Argelich, Xavier Domingo, Chu Min Li, Felip Manyà, Jordi Planes: Towards Solving Many-Valued MaxSAT. ISMVL 2006: 26
33	EE	Maria Luisa Bonet, Jordi Levy, Felip Manyà: A Complete Calculus for Max-SAT. SAT 2006: 240-251
32	EE	Josep Argelich, Felip Manyà: Exact Max-SAT solvers for over-constrained problems. J. Heuristics 12(4-5): 375-392 (2006)
2005
31	EE	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
30	EE	Josep Argelich, Felip Manyà: Solving Over-Constrained Problems with SAT. CP 2005: 838
29	EE	Carlos Ansótegui, Felip Manyà: Mapping Many-Valued CNF Formulas to Boolean CNF Formulas. ISMVL 2005: 290-295
28	EE	Josep Argelich, Felip Manyà: Solving Over-Constrained Problems with SAT Technology. SAT 2005: 1-15
27	EE	Teresa Alsinet, Felip Manyà, Jordi Planes: Improved Exact Solvers for Weighted Max-SAT. SAT 2005: 371-377
2004
26		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
25	EE	Teresa Alsinet, Felip Manyà, Jordi Planes: A Max-SAT Solver with Lazy Data Structures. IBERAMIA 2004: 334-342
24	EE	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
23	EE	Carlos Ansótegui, Felip Manyà: Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables. SAT 2004
22	EE	Carlos Ansótegui, Felip Manyà: Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. SAT (Selected Papers 2004: 1-15
2003
21	EE	Carlos Ansótegui, Jose Larrubia, Felip Manyà: Boosting Chaff's Performance by Incorporating CSP Heuristics. CP 2003: 96-107
20	EE	Carlos Ansótegui, Felip Manyà: New Logical and Complexity Results for Signed-SAT. ISMVL 2003: 181-187
19	EE	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)
18	EE	Hantao Zhang, Haiou Shen, Felip Manyà: Exact Algorithms for MAX-SAT. Electr. Notes Theor. Comput. Sci. 86(1): (2003)
17	EE	Felip Manyà, Carla P. Gomes: Técnicas de resolución de problemas de satisfacción de restricciones. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 19: 169-180 (2003)
16	EE	Carlos Ansótegui, Felip Manyà: Una introducción a los algoritmos de satisfactibilidad. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 20: 43-56 (2003)
2002
15	EE	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
14	EE	Carlos Ansótegui, Felip Manyà: Bridging the Gap between SAT and CSP. CP 2002: 784-785
2001
13	EE	Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes: Capturing Structure with Satisfiability. CP 2001: 137-152
12		Ramón Béjar, Reiner Hähnle, Felip Manyà: A Modular Reduction of Regular Logic to Classical Logic. ISMVL 2001: 221-226
11	EE	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)
2000
10		Ramón Béjar, Felip Manyà: Solving the Round Robin Problem Using Propositional Logic. AAAI/IAAI 2000: 262-266
9	EE	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
8	EE	Bernhard Beckert, Reiner Hähnle, Felip Manyà: The 2-SAT Problem of Regular Signed CNF Formulas. ISMVL 2000: 331-336
1999
7	EE	Ramón Béjar, Felip Manyà: A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas. ESCQARU 1999: 22-31
6		Ramón Béjar, Felip Manyà: Phase Transitions in the Regular Random 3-SAT Problem. ISMIS 1999: 292-300
5	EE	Bernhard Beckert, Reiner Hähnle, Felip Manyà: Transformations between Signed and Classical Clause Logic. ISMVL 1999: 248-255
4		Ramón Béjar, Felip Manyà: Solving Combinatorial Problems with Regular Local Search Algorithms. LPAR 1999: 33-43
1998
3	EE	Felip Manyà, Ramón Béjar, Gonzalo Escalada-Imaz: The satisfiability problem in regular CNF-formulas. Soft Comput. 2(3): 116-123 (1998)
1994
2		Gonzalo Escalada-Imaz, Felip Manyà: Efficient Interpretation of Propositional Multiple-valued Logic Programs. IPMU 1994: 428-439
1		Gonzalo Escalada-Imaz, Felip Manyà: The Satisfiability Problem in Multiple-Valued Horn Formulae. ISMVL 1994: 250-256

Coauthor Index

1	Teresa Alsinet	[9] [15] [19] [25] [27]
2	Carlos Ansótegui	[14] [16] [19] [20] [21] [22] [23] [24] [26] [29] [39] [41] [42] [43] [44] [45] [51]
3	Josep Argelich	[28] [30] [32] [34] [40] [46] [47] [48] [49]
4	Bernhard Beckert	[5] [8]
5	Ramón Béjar	[3] [4] [6] [7] [9] [10] [11] [12] [13] [15] [19] [24] [37]
6	Maria Luisa Bonet	[33] [38] [41] [42] [43] [44] [45] [51]
7	Alba Cabiscol	[11] [13] [15] [24] [37] [48] [49]
8	Xavier Domingo	[34]
9	Iván Dotú	[26]
10	Gonzalo Escalada-Imaz	[1] [2] [3]
11	Cèsar Fernández	[9] [11] [13] [15] [19] [26] [37]
12	Carla P. Gomes	[11] [13] [17] [37]
13	Reiner Hähnle	[5] [8] [12]
14	Jose Larrubia	[21] [39]
15	Jordi Levy	[33] [38] [41] [42] [43] [44] [45] [51]
16	Chu Min Li	[31] [34] [35] [36] [39] [46] [47] [50]
17	Inês Lynce	[48] [49]
18	Nouredine Ould Mohamedou	[50]
19	Jordi Planes	[25] [27] [31] [34] [35] [36] [46] [50]
20	Haiou Shen	[18]
21	Alvaro del Val	[26]
22	Hantao Zhang	[18]

Colors in the list of coauthors