Carlos Ansótegui

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 37

Top Topics

Number Of Function Evaluations

Fractal Dimension

Automated Theorem Provers

Top Venues

Publications

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