Carlos Ansótegui

	2009
33		Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: On the Structure of Industrial SAT Instances. CP 2009: 127-141
32		Carlos Ansótegui, Meinolf Sellmann, Kevin Tierney: A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. CP 2009: 142-157
31		Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: Towards Industrial-Like Random SAT Instances. IJCAI 2009: 387-392
30		Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: Solving (Weighted) Partial MaxSAT through Satisfiability Testing. SAT 2009: 427-440
	2008
29		Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: Generating Hard SAT/CSP Instances Using Expander Graphs. AAAI 2008: 1442-1443
28		Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Measuring the Hardness of SAT Instances. AAAI 2008: 222-228
27		Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: Random SAT Instances à la Carte. CCIA 2008: 109-117
26		Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: How Hard is a Commercial Puzzle: the Eternity II Challenge. CCIA 2008: 99-108
25		Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: From High Girth Graphs to Hard Instances. CP 2008: 298-312
24		Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: Edge Matching Puzzles as Hard SAT/CSP Benchmarks. CP 2008: 560-565
	2007
23		Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: On Balanced CSPs with High Treewidth. AAAI 2007: 161-166
22		Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Inference Rules for High-Order Consistency in Weighted CSP. AAAI 2007: 167-172
21		Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: What Is a Real-World SAT Instance? CCIA 2007: 19-28
20		Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: The Logic Behind Weighted CSP. IJCAI 2007: 32-37
19		Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: A Complete Resolution Calculus for Signed Max-SAT. ISMVL 2007: 22
18		Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Mapping CSP into Many-Valued SAT. SAT 2007: 10-15
17		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)
	2006
16		Meinolf Sellmann, Carlos Ansótegui: Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts. AAAI 2006
15		Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carla P. Gomes, Carles Mateu: The Impact of Balancing on Problem Hardness in a Highly Structured Domain. AAAI 2006
14		Santiago Macho González, Carlos Ansótegui, Pedro Meseguer: Boosting Open CSPs. CP 2006: 314-328
13		Ashish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman: QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. SAT 2006: 382-395
	2005
12		Carlos Ansótegui, Carla P. Gomes, Bart Selman: The Achilles' Heel of QBF. AAAI 2005: 275-281
11		Carlos Ansótegui, Felip Manyà: Mapping Many-Valued CNF Formulas to Boolean CNF Formulas. ISMVL 2005: 290-295
	2004
10		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
9		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
8		Carlos Ansótegui, Felip Manyà: Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables. SAT 2004
7		Carlos Ansótegui, Felip Manyà: Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. SAT (Selected Papers 2004: 1-15
	2003
6		Carlos Ansótegui, Jose Larrubia, Felip Manyà: Boosting Chaff's Performance by Incorporating CSP Heuristics. CP 2003: 96-107
5		Carlos Ansótegui: A New Approach to Solving SAT-Encoded Binary CSPs. CP 2003: 962
4		Carlos Ansótegui, Felip Manyà: New Logical and Complexity Results for Signed-SAT. ISMVL 2003: 181-187
3		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)
2		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
1		Carlos Ansótegui, Felip Manyà: Bridging the Gap between SAT and CSP. CP 2002: 784-785

Coauthor Index

1	Teresa Alsinet	[3]
2	Ramón Béjar	[3] [9] [15] [23] [24] [25] [26] [29]
3	Maria Luisa Bonet	[18] [19] [20] [21] [22] [27] [28] [30] [31] [33]
4	Alba Cabiscol	[9]
5	Iván Dotú (Iván Javier Dotú Rodríguez)	[10]
6	Cèsar Fernández	[3] [10] [15] [23] [24] [25] [26] [29]
7	Carla P. Gomes	[12] [13] [15]
8	Santiago Macho González	[14]
9	Justin W. Hart	[13]
10	Jose Larrubia	[6] [17]
11	Jordi Levy	[18] [19] [20] [21] [22] [27] [28] [30] [31] [33]
12	Chu Min Li	[17]
13	Felip Manyà	[1] [2] [3] [4] [6] [7] [8] [9] [10] [11] [17] [18] [19] [20] [21] [22] [28]
14	Carles Mateu	[15] [23] [24] [25] [26] [29]
15	Pedro Meseguer	[14]
16	Ashish Sabharwal	[13]
17	Meinolf Sellmann	[16] [32]
18	Bart Selman	[12] [13]
19	Kevin Tierney	[32]
20	Alvaro del Val	[10]

Colors in the list of coauthors