Carlos Ansótegui

102 papers A* 16A 26B 1C 1Misc 1Journal 32Unranked 25
YearRankTypeTitle / Venue / Authors
2026 J jnl
Revisiting SAT-based Solvers: MaxSAT Rules and Core Sequences.
J. Artif. Intell. Res.
Josep Alòs, Carlos Ansótegui, Eduard Torres
2025 J jnl
SAT, gadgets, Max2XOR, and quantum annealers.
Quantum Inf. Process.
Carlos Ansótegui, Jordi Levy
2025 — conf
Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach.
ICCS (2)
Carlos Ansótegui, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider, Hai Xia
2024 J jnl
Effectively computing high strength mixed covering arrays with constraints.
J. Parallel Distributed Comput.
Carlos Ansótegui, Eduard Torres
2024 — conf
Implementing 3-SAT Gadgets for Quantum Annealers with Random Instances.
ICCS (6)
Pol Rodríguez-Farrés, Rocco Ballester, Carlos Ansótegui, Jordi Levy, Jesús Cerquides
2024 J jnl
SAT, Gadgets, Max2XOR, and Quantum Annealers.
CoRR
Carlos Ansótegui, Jordi Levy
2023 J jnl
A Benchmark Generator for Combinatorial Testing.
CoRR
Carlos Ansótegui, Eduard Torres
2023 J jnl
Encoding Ethics to Compute Value-Aligned Norms.
Minds Mach.
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
2023 A conf
Exploiting Configurations of MaxSAT Solvers.
CP
Josep Alòs, Carlos Ansótegui, Josep M. Salvia, Eduard Torres
2023 J jnl
Exploiting Configurations of MaxSAT Solvers.
CoRR
Josep Alòs, Carlos Ansótegui, Josep M. Salvia, Eduard Torres
2023 J jnl
Interpretable decision trees through MaxSAT.
Artif. Intell. Rev.
Josep Alòs, Carlos Ansótegui, Eduard Torres
2023 — conf
On the Density of States of Boolean Formulas.
CCIA
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
2022 J jnl
Boosting evolutionary algorithm configuration.
Ann. Math. Artif. Intell.
Carlos Ansótegui, Josep Pon, Meinolf Sellmann
2022 J jnl
Incomplete MaxSAT approaches for combinatorial testing.
J. Heuristics
Carlos Ansótegui, Felip Manyà, Jesus Ojeda, Josep M. Salvia, Eduard Torres
2022 A conf
OptiLog V2: Model, Solve, Tune and Run.
SAT
Josep Alos, Carlos Ansótegui, Josep M. Salvia, Eduard Torres
2022 J jnl
Reducing SAT to Max2XOR.
CoRR
Carlos Ansótegui, Jordi Levy
2022 J jnl
Scale-Free Random SAT Instances.
Algorithms
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
2022 — conf
Yet Another (Fake) Proof of P=NP.
CCIA
Carlos Ansótegui, Jordi Levy
2021 A conf
Building High Strength Mixed Covering Arrays with Constraints.
CP
Carlos Ansótegui, Jesus Ojeda, Eduard Torres
2021 J jnl
Incomplete MaxSAT Approaches for Combinatorial Testing.
CoRR
Carlos Ansótegui, Felip Manyà, Jesus Ojeda, Josep M. Salvia, Eduard Torres
2021 J jnl
Learning How to Optimize Black-Box Functions With Extreme Limits on the Number of Function Evaluations.
CoRR
Carlos Ansótegui, Meinolf Sellmann, Tapan Shah, Kevin Tierney
2021 J jnl
Learning Optimal Decision Trees Using MaxSAT.
CoRR
Josep Alos, Carlos Ansótegui, Eduard Torres
2021 — conf
Learning to Optimize Black-Box Functions with Extreme Limits on the Number of Function Evaluations.
LION
Carlos Ansótegui, Meinolf Sellmann, Tapan Shah, Kevin Tierney
2021 A conf
OptiLog: A Framework for SAT-based Systems.
SAT
Carlos Ansótegui, Jesus Ojeda, António Pacheco, Josep Pon, Josep M. Salvia, Eduard Torres
2021 A conf
PyDGGA: Distributed GGA for Automatic Configuration.
SAT
Carlos Ansótegui, Josep Pon, Meinolf Sellmann, Kevin Tierney
2021 A* conf
Reducing SAT to Max2SAT.
IJCAI
Carlos Ansótegui, Jordi Levy
2019 A conf
Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints.
CP
Carlos Ansótegui, Miquel Bofill, Jordi Coll, Nguyen Dang, Juan Luis Esteban, Ian Miguel, Peter Nightingale, András Z. Salamon, Josep Suy, Mateu Villaret
2019 J jnl
Community Structure in Industrial SAT Instances.
J. Artif. Intell. Res.
Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon
2019 — conf
Phase Transition in Realistic Random SAT Models.
CCIA
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
2018 C conf
Exploiting Moral Values to Choose the Right Norms.
AIES
Marc Serramia, Maite López-Sánchez, Juan A. Rodríguez-Aguilar, Javier Morales, Michael J. Wooldridge, Carlos Ansótegui
2018 — conf
Hyper-Reactive Tabu Search for MaxSAT.
LION
Carlos Ansótegui, Britta Heymann, Josep Pon, Meinolf Sellmann, Kevin Tierney
2018 A conf
Moral Values in Norm Decision Making.
AAMAS
Marc Serramia, Maite López-Sánchez, Juan A. Rodríguez-Aguilar, Manel Rodriguez-Soto, Michael J. Wooldridge, Javier Morales, Carlos Ansótegui
2018 A conf
Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse.
CP
Carlos Ansótegui, Meinolf Sellmann, Kevin Tierney
2017 A* conf
Reactive Dialectic Search Portfolios for MaxSAT.
AAAI
Carlos Ansótegui, Josep Pon, Meinolf Sellmann, Kevin Tierney
2017 J jnl
Structure features for SAT instances classification.
J. Appl. Log.
Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy
2017 J jnl
WPM3: An (in)complete algorithm for weighted partial MaxSAT.
Artif. Intell.
Carlos Ansótegui, Joel Gabàs
2016 J jnl
Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers.
Fuzzy Sets Syst.
Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
2016 J jnl
Community Structure in Industrial SAT Instances.
CoRR
Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy
2016 J jnl
Exploiting subproblem optimization in SAT-based MaxSAT algorithms.
J. Heuristics
Carlos Ansótegui, Joel Gabàs, Jordi Levy
2016 J jnl
MaxSAT by improved instance-specific algorithm configuration.
Artif. Intell.
Carlos Ansótegui, Joel Gabàs, Yuri Malitsky, Meinolf Sellmann
2015 A* conf
Exploiting the Structure of Unsatisfiable Cores in MaxSAT.
IJCAI
Carlos Ansótegui, Frédéric Didier, Joel Gabàs
2015 A* conf
Model-Based Genetic Algorithms for Algorithm Configuration.
IJCAI
Carlos Ansótegui, Yuri Malitsky, Horst Samulowitz, Meinolf Sellmann, Kevin Tierney
2015 — conf
On the Classification of Industrial SAT Families.
CCIA
Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy
2015 J jnl
SAT and SMT Technology for Many-Valued Logics.
J. Multiple Valued Log. Soft Comput.
Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
2015 A conf
Using Community Structure to Detect Relevant Learnt Clauses.
SAT
Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon
2014 A* conf
MaxSAT by Improved Instance-Specific Algorithm Configuration.
AAAI
Carlos Ansótegui, Yuri Malitsky, Meinolf Sellmann
2014 A conf
The Fractal Dimension of SAT Formulas.
IJCAR
Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy
2013 — conf
A Max-SAT-Based Approach to Constructing Optimal Covering Arrays.
CCIA
Carlos Ansótegui, Idelfonso Izquierdo, Felip Manyà, José Torres-Jiménez
2013 A conf
Improving WPM2 for (Weighted) Partial MaxSAT.
CP
Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy
2013 J jnl
On the hardness of solving edge matching puzzles as SAT or CSP problems.
Constraints An Int. J.
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
2013 J jnl
Resolution procedures for multiple-valued optimization.
Inf. Sci.
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
2013 J jnl
SAT-based MaxSAT algorithms.
Artif. Intell.
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
2013 B conf
Solving (Weighted) Partial MaxSAT with ILP.
CPAIOR
Carlos Ansótegui, Joel Gabàs
2013 J jnl
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories.
Constraints An Int. J.
Carlos Ansótegui, Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret
2013 J jnl
The Fractal Dimension of SAT Formulas.
CoRR
Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy
2012 — conf
A SAT-Based Approach to MinSAT.
CCIA
Carlos Ansótegui, Chu Min Li, Felip Manyà, Zhu Zhu
2012 — conf
Analysis and Generation of Pseudo-Industrial MaxSAT Instances.
CCIA
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Chu Min Li
2012 — conf
Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers.
ISMVL
Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
2012 A conf
Improving SAT-Based Weighted MaxSAT Solvers.
CP
Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy
2012 A conf
The Community Structure of SAT Formulas.
SAT
Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy
2011 — conf
Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic.
ISMVL
Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
2011 J jnl
Generating highly balanced sudoku problems as hard problems.
J. Heuristics
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carla P. Gomes, Carles Mateu
2011 — conf
On the Modularity of Industrial SAT Instances.
CCIA
Carlos Ansótegui, Jordi Levy
2011 — conf
Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem.
SARA
Carlos Ansótegui, Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret
2010 A* conf
A New Algorithm for Weighted Partial MaxSAT.
AAAI
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
2010 — conf
On Solving MaxSAT Through SAT.
POS@SAT
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
2010 A conf
Solving Pseudo-Boolean Modularity Constraints.
ECAI
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Francesc Guitart, Carles Mateu
2009 A conf
A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms.
CP
Carlos Ansótegui, Meinolf Sellmann, Kevin Tierney
2009 — conf
On Solving MaxSAT Through SAT.
CCIA
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
2009 A conf
On the Structure of Industrial SAT Instances.
CP
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
2009 A conf
Solving (Weighted) Partial MaxSAT through Satisfiability Testing.
SAT
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
2009 A* conf
Towards Industrial-Like Random SAT Instances.
IJCAI
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
2008 A conf
Edge Matching Puzzles as Hard SAT/CSP Benchmarks.
CP
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
2008 A conf
From High Girth Graphs to Hard Instances.
CP
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
2008 A* conf
Generating Hard SAT/CSP Instances Using Expander Graphs.
AAAI
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
2008 Misc conf
Hard SAT and CSP instances with Expander Graphs.
ISAIM
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
2008 — conf
How Hard is a Commercial Puzzle: the Eternity II Challenge.
CCIA
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
2008 A* conf
Measuring the Hardness of SAT Instances.
AAAI
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
2008 — conf
Random SAT Instances à la Carte.
CCIA
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
2007 — conf
A Complete Resolution Calculus for Signed Max-SAT.
ISMVL
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
2007 J jnl
Exploiting multivalued knowledge in variable selection heuristics for SAT solvers.
Ann. Math. Artif. Intell.
Carlos Ansótegui, Jose Larrubia, Chu Min Li, Felip Manyà
2007 A* conf
Inference Rules for High-Order Consistency in Weighted CSP.
AAAI
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
2007 A conf
Mapping CSP into Many-Valued SAT.
SAT
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
2007 A* conf
On Balanced CSPs with High Treewidth.
AAAI
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
2007 A* conf
The Logic Behind Weighted CSP.
IJCAI
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
2007 — conf
What Is a Real-World SAT Instance?
CCIA
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
2006 A conf
Boosting Open CSPs.
CP
Santiago Macho González, Carlos Ansótegui, Pedro Meseguer
2006 A* conf
Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts.
AAAI
Meinolf Sellmann, Carlos Ansótegui
2006 A conf
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency.
SAT
Ashish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman
2006 A* conf
The Impact of Balancing on Problem Hardness in a Highly Structured Domain.
AAAI
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carla P. Gomes, Carles Mateu
2005 — conf
Mapping Many-Valued CNF Formulas to Boolean CNF Formulas.
ISMVL
Carlos Ansótegui, Felip Manyà
2005 A* conf
The Achilles' Heel of QBF.
AAAI
Carlos Ansótegui, Carla P. Gomes, Bart Selman
2004 A conf
Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables.
SAT
Carlos Ansótegui, Felip Manyà
2004 — conf
Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables.
SAT (Selected Papers
Carlos Ansótegui, Felip Manyà
2004 A* conf
Modeling Choices in Quasigroup Completion: SAT vs. CSP.
AAAI
Carlos Ansótegui, Alvaro del Val, Iván Dotú, Cèsar Fernández, Felip Manyà
2004 — conf
The Interface between P and NP in Signed CNF Formulas.
ISMVL
Carlos Ansótegui, Ramón Béjar, Alba Cabiscol, Felip Manyà
2003 A conf
A New Approach to Solving SAT-Encoded Binary CSPs.
CP
Carlos Ansótegui
2003 J jnl
Automated monitoring of medical protocols: a secure and distributed architecture.
Artif. Intell. Medicine
Teresa Alsinet, Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Felip Manyà
2003 A conf
Boosting Chaff's Performance by Incorporating CSP Heuristics.
CP
Carlos Ansótegui, Jose Larrubia, Felip Manyà
2003 — conf
New Logical and Complexity Results for Signed-SAT.
ISMVL
Carlos Ansótegui, Felip Manyà
2003 J jnl
Una introducción a los algoritmos de satisfactibilidad.
Inteligencia Artif.
Carlos Ansótegui, Felip Manyà
2002 A conf
Bridging the Gap between SAT and CSP.
CP
Carlos Ansótegui, Felip Manyà