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 | EE | Carlos Ansótegui,
Maria Luisa Bonet,
Jordi Levy:
Random SAT Instances à la Carte.
CCIA 2008: 109-117 |
26 | EE | 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 | EE | 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 | EE | 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 | EE | Carlos Ansótegui,
Maria Luisa Bonet,
Jordi Levy,
Felip Manyà:
The Logic Behind Weighted CSP.
IJCAI 2007: 32-37 |
19 | EE | Carlos Ansótegui,
Maria Luisa Bonet,
Jordi Levy,
Felip Manyà:
A Complete Resolution Calculus for Signed Max-SAT.
ISMVL 2007: 22 |
18 | EE | Carlos Ansótegui,
Maria Luisa Bonet,
Jordi Levy,
Felip Manyà:
Mapping CSP into Many-Valued SAT.
SAT 2007: 10-15 |
17 | 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) |
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 | EE | Santiago Macho González,
Carlos Ansótegui,
Pedro Meseguer:
Boosting Open CSPs.
CP 2006: 314-328 |
13 | EE | 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 | EE | 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 | 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 |
8 | EE | Carlos Ansótegui,
Felip Manyà:
Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables.
SAT 2004 |
7 | EE | Carlos Ansótegui,
Felip Manyà:
Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables.
SAT (Selected Papers 2004: 1-15 |
2003 |
6 | EE | Carlos Ansótegui,
Jose Larrubia,
Felip Manyà:
Boosting Chaff's Performance by Incorporating CSP Heuristics.
CP 2003: 96-107 |
5 | EE | Carlos Ansótegui:
A New Approach to Solving SAT-Encoded Binary CSPs.
CP 2003: 962 |
4 | EE | Carlos Ansótegui,
Felip Manyà:
New Logical and Complexity Results for Signed-SAT.
ISMVL 2003: 181-187 |
3 | 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) |
2 | 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 |
1 | EE | Carlos Ansótegui,
Felip Manyà:
Bridging the Gap between SAT and CSP.
CP 2002: 784-785 |