Search the dblp DataBase

Publications of Author

1. 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. [Citation Graph (0, 0)][DBLP]
   AAAI, 2006, pp:- [Conf]
   
2. Carlos Ansótegui, Carla P. Gomes, Bart Selman
   The Achilles' Heel of QBF. [Citation Graph (0, 0)][DBLP]
   AAAI, 2005, pp:275-281 [Conf]
   
3. Carlos Ansótegui, Alvaro del Val, Iván Dotú, Cèsar Fernández, Felip Manyà
   Modeling Choices in Quasigroup Completion: SAT vs. CSP. [Citation Graph (0, 0)][DBLP]
   AAAI, 2004, pp:137-142 [Conf]
   
4. Meinolf Sellmann, Carlos Ansótegui
   Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts. [Citation Graph (0, 0)][DBLP]
   AAAI, 2006, pp:- [Conf]
   
5. Carlos Ansótegui
   A New Approach to Solving SAT-Encoded Binary CSPs. [Citation Graph (0, 0)][DBLP]
   CP, 2003, pp:962- [Conf]
   
6. Carlos Ansótegui, Jose Larrubia, Felip Manyà
   Boosting Chaff's Performance by Incorporating CSP Heuristics. [Citation Graph (0, 0)][DBLP]
   CP, 2003, pp:96-107 [Conf]
   
7. Carlos Ansótegui, Felip Manyà
   Bridging the Gap between SAT and CSP. [Citation Graph (0, 0)][DBLP]
   CP, 2002, pp:784-785 [Conf]
   
8. Santiago Macho González, Carlos Ansótegui, Pedro Meseguer
   Boosting Open CSPs. [Citation Graph (0, 0)][DBLP]
   CP, 2006, pp:314-328 [Conf]
   
9. Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
   The Logic Behind Weighted CSP. [Citation Graph (0, 0)][DBLP]
   IJCAI, 2007, pp:32-37 [Conf]
   
10. Carlos Ansótegui, Ramón Béjar, Alba Cabiscol, Felip Manyà
    The Interface between P and NP in Signed CNF Formulas. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2004, pp:251-256 [Conf]
    
11. Carlos Ansótegui, Felip Manyà
    New Logical and Complexity Results for Signed-SAT. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2003, pp:181-187 [Conf]
    
12. Carlos Ansótegui, Felip Manyà
    Mapping Many-Valued CNF Formulas to Boolean CNF Formulas. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2005, pp:290-295 [Conf]
    
13. Carlos Ansótegui, Felip Manyà
    Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
    
14. Carlos Ansótegui, Felip Manyà
    Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:1-15 [Conf]
    
15. Ashish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman
    QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:382-395 [Conf]
    
16. Carlos Ansótegui, Felip Manyà
    Una introducción a los algoritmos de satisfactibilidad. [Citation Graph (0, 0)][DBLP]
    Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial, 2003, v:20, n:, pp:43-56 [Journal]
    
17. 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. [Citation Graph (0, 0)][DBLP]
    Artificial Intelligence in Medicine, 2003, v:27, n:3, pp:367-392 [Journal]
    
18. Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
    On Balanced CSPs with High Treewidth. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:161-166 [Conf]
    
19. Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
    Inference Rules for High-Order Consistency in Weighted CSP. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:167-172 [Conf]
    
20. Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
    Mapping CSP into Many-Valued SAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:10-15 [Conf]
    
21. Carlos Ansótegui, Jose Larrubia, Chu-Min Li, Felip Manyà
    Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2007, v:49, n:1-4, pp:191-205 [Journal]
    
22. 
    Generating Hard SAT/CSP Instances Using Expander Graphs. [Citation Graph (, )][DBLP]
    
    
23. 
    Measuring the Hardness of SAT Instances. [Citation Graph (, )][DBLP]
    
    
24. 
    A New Algorithm for Weighted Partial MaxSAT. [Citation Graph (, )][DBLP]
    
    
25. 
    What Is a Real-World SAT Instance? [Citation Graph (, )][DBLP]
    
    
26. 
    How Hard is a Commercial Puzzle: the Eternity II Challenge. [Citation Graph (, )][DBLP]
    
    
27. 
    Random SAT Instances à la Carte. [Citation Graph (, )][DBLP]
    
    
28. 
    On Solving MaxSAT Through SAT. [Citation Graph (, )][DBLP]
    
    
29. 
    From High Girth Graphs to Hard Instances. [Citation Graph (, )][DBLP]
    
    
30. 
    Edge Matching Puzzles as Hard SAT/CSP Benchmarks. [Citation Graph (, )][DBLP]
    
    
31. 
    On the Structure of Industrial SAT Instances. [Citation Graph (, )][DBLP]
    
    
32. 
    A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. [Citation Graph (, )][DBLP]
    
    
33. 
    Solving Pseudo-Boolean Modularity Constraints. [Citation Graph (, )][DBLP]
    
    
34. 
    Towards Industrial-Like Random SAT Instances. [Citation Graph (, )][DBLP]
    
    
35. 
    A Complete Resolution Calculus for Signed Max-SAT. [Citation Graph (, )][DBLP]
    
    
36. 
    Solving (Weighted) Partial MaxSAT through Satisfiability Testing. [Citation Graph (, )][DBLP]