Bridging the Gap between SAT and CSP. - Carlos Ansótegui; Felip Manyà (CP, 2002)

A New Approach to Solving SAT-Encoded Binary CSPs. - Carlos Ansótegui (CP, 2003)

Boosting Chaff's Performance by Incorporating CSP Heuristics. - Carlos Ansótegui; Jose Larrubia; Felip Manyà (CP, 2003)

New Logical and Complexity Results for Signed-SAT. - Carlos Ansótegui; Felip Manyà (ISMVL, 2003)

Una introducción a los algoritmos de satisfactibilidad. - Carlos Ansótegui; Felip Manyà (Inteligencia Artif., 2003)

Automated monitoring of medical protocols: a secure and distributed architecture. - Teresa Alsinet; Carlos Ansótegui; Ramón Béjar; Cèsar Fernández; Felip Manyà (Artif. Intell. Medicine, 2003)

Modeling Choices in Quasigroup Completion: SAT vs. CSP. - Carlos Ansótegui; Alvaro del Val; Iván Dotú; Cèsar Fernández; Felip Manyà (AAAI, 2004)

The Interface between P and NP in Signed CNF Formulas. - Carlos Ansótegui; Ramón Béjar; Alba Cabiscol; Felip Manyà (ISMVL, 2004)

Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables. - Carlos Ansótegui; Felip Manyà (SAT, 2004)

Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. - Carlos Ansótegui; Felip Manyà (SAT (Selected Papers, 2004)

The Achilles' Heel of QBF. - Carlos Ansótegui; Carla P. Gomes; Bart Selman (AAAI, 2005)

Mapping Many-Valued CNF Formulas to Boolean CNF Formulas. - Carlos Ansótegui; Felip Manyà (ISMVL, 2005)

The Impact of Balancing on Problem Hardness in a Highly Structured Domain. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández; Carla P. Gomes; Carles Mateu (AAAI, 2006)

Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts. - Meinolf Sellmann; Carlos Ansótegui (AAAI, 2006)

Boosting Open CSPs. - Santiago Macho González; Carlos Ansótegui; Pedro Meseguer (CP, 2006)

QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. - Ashish Sabharwal; Carlos Ansótegui; Carla P. Gomes; Justin W. Hart; Bart Selman (SAT, 2006)

On Balanced CSPs with High Treewidth. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández; Carles Mateu (AAAI, 2007)

Inference Rules for High-Order Consistency in Weighted CSP. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Felip Manyà (AAAI, 2007)

What Is a Real-World SAT Instance? - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Felip Manyà (CCIA, 2007)

The Logic Behind Weighted CSP. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Felip Manyà (IJCAI, 2007)

A Complete Resolution Calculus for Signed Max-SAT. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Felip Manyà (ISMVL, 2007)

Mapping CSP into Many-Valued SAT. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Felip Manyà (SAT, 2007)

Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. - Carlos Ansótegui; Jose Larrubia; Chu Min Li 001; Felip Manyà (Ann. Math. Artif. Intell., 2007)

Generating Hard SAT/CSP Instances Using Expander Graphs. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández; Carles Mateu (AAAI, 2008)

Measuring the Hardness of SAT Instances. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Felip Manyà (AAAI, 2008)

How Hard is a Commercial Puzzle: the Eternity II Challenge. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández; Carles Mateu (CCIA, 2008)

Random SAT Instances à la Carte. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy (CCIA, 2008)

From High Girth Graphs to Hard Instances. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández; Carles Mateu (CP, 2008)

Edge Matching Puzzles as Hard SAT/CSP Benchmarks. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández; Carles Mateu (CP, 2008)

Hard SAT and CSP instances with Expander Graphs. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández; Carles Mateu (ISAIM, 2008)

On Solving MaxSAT Through SAT. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy (CCIA, 2009)

On the Structure of Industrial SAT Instances. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy (CP, 2009)

A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. - Carlos Ansótegui; Meinolf Sellmann; Kevin Tierney (CP, 2009)

Towards Industrial-Like Random SAT Instances. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy (IJCAI, 2009)

Solving (Weighted) Partial MaxSAT through Satisfiability Testing. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy (SAT, 2009)

A New Algorithm for Weighted Partial MaxSAT. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy (AAAI, 2010)

Solving Pseudo-Boolean Modularity Constraints. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández; Francesc Guitart; Carles Mateu (ECAI, 2010)

On the Modularity of Industrial SAT Instances. - Carlos Ansótegui; Jordi Levy (CCIA, 2011)

Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic. - Carlos Ansótegui; Miquel Bofill; Felip Manyà; Mateu Villaret (ISMVL, 2011)

Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem. - Carlos Ansótegui; Miquel Bofill; Miquel Palahí; Josep Suy; Mateu Villaret (SARA, 2011)

Generating highly balanced sudoku problems as hard problems. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández; Carla P. Gomes; Carles Mateu (J. Heuristics, 2011)

Analysis and Generation of Pseudo-Industrial MaxSAT Instances. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Chu Min Li 001 (CCIA, 2012)

A SAT-Based Approach to MinSAT. - Carlos Ansótegui; Chu Min Li 001; Felip Manyà; Zhu Zhu (CCIA, 2012)

Improving SAT-Based Weighted MaxSAT Solvers. - Carlos Ansótegui; Maria Luisa Bonet; Joel Gabàs; Jordi Levy (CP, 2012)

Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers. - Carlos Ansótegui; Miquel Bofill; Felip Manyà; Mateu Villaret (ISMVL, 2012)

The Community Structure of SAT Formulas. - Carlos Ansótegui; Jesús Giráldez-Cru; Jordi Levy (SAT, 2012)

A Max-SAT-Based Approach to Constructing Optimal Covering Arrays. - Carlos Ansótegui; Idelfonso Izquierdo; Felip Manyà; José Torres-Jiménez (CCIA, 2013)

Improving WPM2 for (Weighted) Partial MaxSAT. - Carlos Ansótegui; Maria Luisa Bonet; Joel Gabàs; Jordi Levy (CP, 2013)

Solving (Weighted) Partial MaxSAT with ILP. - Carlos Ansótegui; Joel Gabàs (CPAIOR, 2013)

SAT-based MaxSAT algorithms. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy (Artif. Intell., 2013)

On the hardness of solving edge matching puzzles as SAT or CSP problems. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández; Carles Mateu (Constraints An Int. J., 2013)

Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories. - Carlos Ansótegui; Miquel Bofill; Miquel Palahí; Josep Suy; Mateu Villaret (Constraints An Int. J., 2013)

Resolution procedures for multiple-valued optimization. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Felip Manyà (Inf. Sci., 2013)

MaxSAT by Improved Instance-Specific Algorithm Configuration. - Carlos Ansótegui; Yuri Malitsky; Meinolf Sellmann (AAAI, 2014)

The Fractal Dimension of SAT Formulas. - Carlos Ansótegui; Maria Luisa Bonet; Jesús Giráldez-Cru; Jordi Levy (IJCAR, 2014)

On the Classification of Industrial SAT Families. - Carlos Ansótegui; Maria Luisa Bonet; Jesús Giráldez-Cru; Jordi Levy (CCIA, 2015)

Exploiting the Structure of Unsatisfiable Cores in MaxSAT. - Carlos Ansótegui; Frédéric Didier; Joel Gabàs (IJCAI, 2015)

Model-Based Genetic Algorithms for Algorithm Configuration. - Carlos Ansótegui; Yuri Malitsky; Horst Samulowitz; Meinolf Sellmann; Kevin Tierney (IJCAI, 2015)

Using Community Structure to Detect Relevant Learnt Clauses. - Carlos Ansótegui; Jesús Giráldez-Cru; Jordi Levy; Laurent Simon 001 (SAT, 2015)

SAT and SMT Technology for Many-Valued Logics. - Carlos Ansótegui; Miquel Bofill; Felip Manyà; Mateu Villaret (J. Multiple Valued Log. Soft Comput., 2015)

MaxSAT by improved instance-specific algorithm configuration. - Carlos Ansótegui; Joel Gabàs; Yuri Malitsky; Meinolf Sellmann (Artif. Intell., 2016)

Community Structure in Industrial SAT Instances. - Carlos Ansótegui; Maria Luisa Bonet; Jesús Giráldez-Cru; Jordi Levy (CoRR, 2016)

Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers. - Carlos Ansótegui; Miquel Bofill; Felip Manyà; Mateu Villaret (Fuzzy Sets Syst., 2016)

Exploiting subproblem optimization in SAT-based MaxSAT algorithms. - Carlos Ansótegui; Joel Gabàs; Jordi Levy (J. Heuristics, 2016)

Reactive Dialectic Search Portfolios for MaxSAT. - Carlos Ansótegui; Josep Pon; Meinolf Sellmann; Kevin Tierney (AAAI, 2017)

WPM3: An (in)complete algorithm for weighted partial MaxSAT. - Carlos Ansótegui; Joel Gabàs (Artif. Intell., 2017)

Structure features for SAT instances classification. - Carlos Ansótegui; Maria Luisa Bonet; Jesús Giráldez-Cru; Jordi Levy (J. Appl. Log., 2017)

Exploiting Moral Values to Choose the Right Norms. - Marc Serramia; Maite López-Sánchez; Juan A. Rodríguez-Aguilar; Javier Morales; Michael J. Wooldridge; Carlos Ansótegui (AIES, 2018)

Moral Values in Norm Decision Making. - Marc Serramia; Maite López-Sánchez; Juan A. Rodríguez-Aguilar; Manel Rodriguez-Soto; Michael J. Wooldridge; Javier Morales; Carlos Ansótegui (AAMAS, 2018)

Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse. - Carlos Ansótegui; Meinolf Sellmann; Kevin Tierney (CP, 2018)

Hyper-Reactive Tabu Search for MaxSAT. - Carlos Ansótegui; Britta Heymann; Josep Pon; Meinolf Sellmann; Kevin Tierney (LION, 2018)

Phase Transition in Realistic Random SAT Models. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy (CCIA, 2019)

Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints. - Carlos Ansótegui; Miquel Bofill; Jordi Coll; Nguyen Dang 001; Juan Luis Esteban; Ian Miguel; Peter Nightingale; András Z. Salamon; Josep Suy; Mateu Villaret (CP, 2019)

Community Structure in Industrial SAT Instances. - Carlos Ansótegui; Maria Luisa Bonet; Jesús Giráldez-Cru; Jordi Levy; Laurent Simon 001 (J. Artif. Intell. Res., 2019)

Building High Strength Mixed Covering Arrays with Constraints. - Carlos Ansótegui; Jesus Ojeda; Eduard Torres (CP, 2021)

Reducing SAT to Max2SAT. - Carlos Ansótegui; Jordi Levy (IJCAI, 2021)

Learning to Optimize Black-Box Functions with Extreme Limits on the Number of Function Evaluations. - Carlos Ansótegui; Meinolf Sellmann; Tapan Shah 001; Kevin Tierney (LION, 2021)

OptiLog: A Framework for SAT-based Systems. - Carlos Ansótegui; Jesus Ojeda; António Pacheco 004; Josep Pon; Josep M. Salvia; Eduard Torres (SAT, 2021)

PyDGGA: Distributed GGA for Automatic Configuration. - Carlos Ansótegui; Josep Pon; Meinolf Sellmann; Kevin Tierney (SAT, 2021)

Learning How to Optimize Black-Box Functions With Extreme Limits on the Number of Function Evaluations. - Carlos Ansótegui; Meinolf Sellmann; Tapan Shah 001; Kevin Tierney (CoRR, 2021)

Learning Optimal Decision Trees Using MaxSAT. - Josep Alos; Carlos Ansótegui; Eduard Torres (CoRR, 2021)

Yet Another (Fake) Proof of P=NP. - Carlos Ansótegui; Jordi Levy (CCIA, 2022)

OptiLog V2: Model, Solve, Tune and Run. - Josep Alos; Carlos Ansótegui; Josep M. Salvia; Eduard Torres (SAT, 2022)

Scale-Free Random SAT Instances. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy (Algorithms, 2022)

Boosting evolutionary algorithm configuration. - Carlos Ansótegui; Josep Pon; Meinolf Sellmann (Ann. Math. Artif. Intell., 2022)

Reducing SAT to Max2XOR. - Carlos Ansótegui; Jordi Levy (CoRR, 2022)

Incomplete MaxSAT approaches for combinatorial testing. - Carlos Ansótegui; Felip Manyà; Jesus Ojeda; Josep M. Salvia; Eduard Torres (J. Heuristics, 2022)

On the Density of States of Boolean Formulas. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy (CCIA, 2023)

Exploiting Configurations of MaxSAT Solvers. - Josep Alòs; Carlos Ansótegui; Josep M. Salvia; Eduard Torres (CP, 2023)

Interpretable decision trees through MaxSAT. - Josep Alòs; Carlos Ansótegui; Eduard Torres (Artif. Intell. Rev., 2023)

A Benchmark Generator for Combinatorial Testing. - Carlos Ansótegui; Eduard Torres (CoRR, 2023)

Encoding Ethics to Compute Value-Aligned Norms. - Marc Serramia; Manel Rodriguez-Soto; Maite López-Sánchez; Juan A. Rodríguez-Aguilar; Filippo Bistaffa; Paula Boddington; Michael J. Wooldridge; Carlos Ansótegui (Minds Mach., 2023)

Implementing 3-SAT Gadgets for Quantum Annealers with Random Instances. - Pol Rodríguez-Farrés; Rocco Ballester; Carlos Ansótegui; Jordi Levy; Jesús Cerquides (ICCS (6), 2024)

SAT, Gadgets, Max2XOR, and Quantum Annealers. - Carlos Ansótegui; Jordi Levy (CoRR, 2024)

Effectively computing high strength mixed covering arrays with constraints. - Carlos Ansótegui; Eduard Torres (J. Parallel Distributed Comput., 2024)

Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach. - Carlos Ansótegui; Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider; Hai Xia 001 (ICCS (2), 2025)