default search action
Carlos Ansótegui
Person information
- affiliation: University of Lleida, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j21]Carlos Ansótegui, Eduard Torres:
Effectively computing high strength mixed covering arrays with constraints. J. Parallel Distributed Comput. 185: 104791 (2024) - [c69]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: 277-291 - [i9]Carlos Ansótegui, Jordi Levy:
SAT, Gadgets, Max2XOR, and Quantum Annealers. CoRR abs/2403.00182 (2024) - 2023
- [j20]Josep Alòs
, Carlos Ansótegui, Eduard Torres
Interpretable decision trees through MaxSAT. Artif. Intell. Rev. 56(8): 8303-8323 (2023) - [j19]Marc Serramia
Encoding Ethics to Compute Value-Aligned Norms. Minds Mach. 33(4): 761-790 (2023) - [c68]Carlos Ansótegui
On the Density of States of Boolean Formulas. CCIA 2023: 369-382 - [c67]Josep Alòs, Carlos Ansótegui, Josep M. Salvia, Eduard Torres:
Exploiting Configurations of MaxSAT Solvers. CP 2023: 7:1-7:16 - [i8]Carlos Ansótegui, Eduard Torres
A Benchmark Generator for Combinatorial Testing. CoRR abs/2301.08134 (2023) - [i7]Josep Alòs, Carlos Ansótegui, Josep M. Salvia, Eduard Torres:
Exploiting Configurations of MaxSAT Solvers. CoRR abs/2306.07635 (2023) - 2022
- [j18]Carlos Ansótegui
Scale-Free Random SAT Instances. Algorithms 15(6): 219 (2022) - [j17]Carlos Ansótegui, Josep Pon
Boosting evolutionary algorithm configuration. Ann. Math. Artif. Intell. 90(7-9): 715-734 (2022) - [j16]Carlos Ansótegui, Felip Manyà, Jesus Ojeda, Josep M. Salvia, Eduard Torres
Incomplete MaxSAT approaches for combinatorial testing. J. Heuristics 28(4): 377-431 (2022) - [c66]Carlos Ansótegui, Jordi Levy:
Yet Another (Fake) Proof of P=NP. CCIA 2022: 25-34 - [c65]Josep Alos
OptiLog V2: Model, Solve, Tune and Run. SAT 2022: 25:1-25:16 - [i6]Carlos Ansótegui, Jordi Levy:
Reducing SAT to Max2XOR. CoRR abs/2204.01774 (2022) - 2021
- [c64]Carlos Ansótegui, Jesus Ojeda
Building High Strength Mixed Covering Arrays with Constraints. CP 2021: 12:1-12:17 - [c63]Carlos Ansótegui, Jordi Levy
Reducing SAT to Max2SAT. IJCAI 2021: 1367-1373 - [c62]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: 7-24 - [c61]Carlos Ansótegui, Jesus Ojeda
OptiLog: A Framework for SAT-based Systems. SAT 2021: 1-10 - [c60]Carlos Ansótegui, Josep Pon, Meinolf Sellmann, Kevin Tierney
PyDGGA: Distributed GGA for Automatic Configuration. SAT 2021: 11-20 - [i5]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 abs/2103.10321 (2021) - [i4]Carlos Ansótegui, Felip Manyà, Jesus Ojeda
Incomplete MaxSAT Approaches for Combinatorial Testing. CoRR abs/2105.12552 (2021) - [i3]Josep Alos, Carlos Ansótegui, Eduard Torres:
Learning Optimal Decision Trees Using MaxSAT. CoRR abs/2110.13854 (2021)
2010 – 2019
- 2019
- [j15]Carlos Ansótegui
Community Structure in Industrial SAT Instances. J. Artif. Intell. Res. 66: 443-472 (2019) - [c59]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
Phase Transition in Realistic Random SAT Models. CCIA 2019: 213-222 - [c58]Carlos Ansótegui, Miquel Bofill
Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints. CP 2019: 20-36 - 2018
- [c57]Marc Serramia
Exploiting Moral Values to Choose the Right Norms. AIES 2018: 264-270 - [c56]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: 1294-1302 - [c55]Carlos Ansótegui, Meinolf Sellmann, Kevin Tierney
Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse. CP 2018: 524-534 - [c54]Carlos Ansótegui, Britta Heymann, Josep Pon, Meinolf Sellmann, Kevin Tierney
Hyper-Reactive Tabu Search for MaxSAT. LION 2018: 309-325 - 2017
- [j14]Carlos Ansótegui, Joel Gabàs:
WPM3: An (in)complete algorithm for weighted partial MaxSAT. Artif. Intell. 250: 37-57 (2017) - [j13]Carlos Ansótegui
Structure features for SAT instances classification. J. Appl. Log. 23: 27-39 (2017) - [c53]Carlos Ansótegui, Josep Pon
Reactive Dialectic Search Portfolios for MaxSAT. AAAI 2017: 765-772 - 2016
- [j12]Carlos Ansótegui
MaxSAT by improved instance-specific algorithm configuration. Artif. Intell. 235: 26-39 (2016) - [j11]Carlos Ansótegui
Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers. Fuzzy Sets Syst. 292: 32-48 (2016) - [j10]Carlos Ansótegui
Exploiting subproblem optimization in SAT-based MaxSAT algorithms. J. Heuristics 22(1): 1-53 (2016) - [i2]Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy:
Community Structure in Industrial SAT Instances. CoRR abs/1606.03329 (2016) - 2015
- [j9]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): 151-172 (2015) - [c52]Carlos Ansótegui
On the Classification of Industrial SAT Families. CCIA 2015: 163-172 - [c51]Carlos Ansótegui, Frédéric Didier, Joel Gabàs:
Exploiting the Structure of Unsatisfiable Cores in MaxSAT. IJCAI 2015: 283-289 - [c50]Carlos Ansótegui, Yuri Malitsky, Horst Samulowitz, Meinolf Sellmann, Kevin Tierney:
Model-Based Genetic Algorithms for Algorithm Configuration. IJCAI 2015: 733-739 - [c49]Carlos Ansótegui
Using Community Structure to Detect Relevant Learnt Clauses. SAT 2015: 238-254 - 2014
- [c48]Carlos Ansótegui, Yuri Malitsky, Meinolf Sellmann:
MaxSAT by Improved Instance-Specific Algorithm Configuration. AAAI 2014: 2594-2600 - [c47]Carlos Ansótegui
The Fractal Dimension of SAT Formulas. IJCAR 2014: 107-121 - 2013
- [j8]Carlos Ansótegui
SAT-based MaxSAT algorithms. Artif. Intell. 196: 77-105 (2013) - [j7]Carlos Ansótegui
On the hardness of solving edge matching puzzles as SAT or CSP problems. Constraints An Int. J. 18(1): 7-37 (2013) - [j6]Carlos Ansótegui
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories. Constraints An Int. J. 18(2): 236-268 (2013) - [j5]Carlos Ansótegui
Resolution procedures for multiple-valued optimization. Inf. Sci. 227: 43-59 (2013) - [c46]Carlos Ansótegui
A Max-SAT-Based Approach to Constructing Optimal Covering Arrays. CCIA 2013: 51-59 - [c45]Carlos Ansótegui
Improving WPM2 for (Weighted) Partial MaxSAT. CP 2013: 117-132 - [c44]Carlos Ansótegui, Joel Gabàs:
Solving (Weighted) Partial MaxSAT with ILP. CPAIOR 2013: 403-409 - [i1]Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy:
The Fractal Dimension of SAT Formulas. CoRR abs/1308.5046 (2013) - 2012
- [c43]Carlos Ansótegui
Analysis and Generation of Pseudo-Industrial MaxSAT Instances. CCIA 2012: 173-184 - [c42]Carlos Ansótegui
A SAT-Based Approach to MinSAT. CCIA 2012: 185-189 - [c41]Carlos Ansótegui
Improving SAT-Based Weighted MaxSAT Solvers. CP 2012: 86-101 - [c40]Carlos Ansótegui
Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers. ISMVL 2012: 25-30 - [c39]Carlos Ansótegui
The Community Structure of SAT Formulas. SAT 2012: 410-423 - 2011
- [j4]Carlos Ansótegui
Generating highly balanced sudoku problems as hard problems. J. Heuristics 17(5): 589-614 (2011) - [c38]Carlos Ansótegui
On the Modularity of Industrial SAT Instances. CCIA 2011: 11-20 - [c37]Carlos Ansótegui
Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic. ISMVL 2011: 230-235 - [c36]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 - 2010
- [c35]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
A New Algorithm for Weighted Partial MaxSAT. AAAI 2010: 3-8 - [c34]Carlos Ansótegui
Solving Pseudo-Boolean Modularity Constraints. ECAI 2010: 867-872 - [c33]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
On Solving MaxSAT Through SAT. POS@SAT 2010: 41-48
2000 – 2009
- 2009
- [c32]Carlos Ansótegui
On Solving MaxSAT Through SAT. CCIA 2009: 284-292 - [c31]Carlos Ansótegui
On the Structure of Industrial SAT Instances. CP 2009: 127-141 - [c30]Carlos Ansótegui
A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. CP 2009: 142-157 - [c29]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
Towards Industrial-Like Random SAT Instances. IJCAI 2009: 387-392 - [c28]Carlos Ansótegui
Solving (Weighted) Partial MaxSAT through Satisfiability Testing. SAT 2009: 427-440 - 2008
- [c27]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
Measuring the Hardness of SAT Instances. AAAI 2008: 222-228 - [c26]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 - [c25]Carlos Ansótegui
How Hard is a Commercial Puzzle: the Eternity II Challenge. CCIA 2008: 99-108 - [c24]Carlos Ansótegui
Random SAT Instances à la Carte. CCIA 2008: 109-117 - [c23]Carlos Ansótegui
From High Girth Graphs to Hard Instances. CP 2008: 298-312 - [c22]Carlos Ansótegui
Edge Matching Puzzles as Hard SAT/CSP Benchmarks. CP 2008: 560-565 - [c21]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu:
Hard SAT and CSP instances with Expander Graphs. ISAIM 2008 - 2007
- [j3]Carlos Ansótegui
Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. Ann. Math. Artif. Intell. 49(1-4): 191-205 (2007) - [c20]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu:
On Balanced CSPs with High Treewidth. AAAI 2007: 161-166 - [c19]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
Inference Rules for High-Order Consistency in Weighted CSP. AAAI 2007: 167-172 - [c18]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
What Is a Real-World SAT Instance? CCIA 2007: 19-28 - [c17]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
The Logic Behind Weighted CSP. IJCAI 2007: 32-37 - [c16]Carlos Ansótegui
A Complete Resolution Calculus for Signed Max-SAT. ISMVL 2007: 22 - [c15]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
Mapping CSP into Many-Valued SAT. SAT 2007: 10-15 - 2006
- [c14]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: 10-15 - [c13]Meinolf Sellmann, Carlos Ansótegui:
Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts. AAAI 2006: 1051-1056 - [c12]Santiago Macho González, Carlos Ansótegui, Pedro Meseguer:
Boosting Open CSPs. CP 2006: 314-328 - [c11]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
- [c10]Carlos Ansótegui, Carla P. Gomes, Bart Selman:
The Achilles' Heel of QBF. AAAI 2005: 275-281 - [c9]Carlos Ansótegui, Felip Manyà:
Mapping Many-Valued CNF Formulas to Boolean CNF Formulas. ISMVL 2005: 290-295 - 2004
- [c8]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 - [c7]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 - [c6]Carlos Ansótegui, Felip Manyà:
Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables. SAT 2004 - [c5]Carlos Ansótegui, Felip Manyà:
Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. SAT (Selected Papers 2004: 1-15 - 2003
- [j2]Carlos Ansótegui, Felip Manyà:
Una introducción a los algoritmos de satisfactibilidad. Inteligencia Artif. 7(20): 43-56 (2003) - [j1]Teresa Alsinet
Automated monitoring of medical protocols: a secure and distributed architecture. Artif. Intell. Medicine 27(3): 367-392 (2003) - [c4]Carlos Ansótegui, Jose Larrubia, Felip Manyà:
Boosting Chaff's Performance by Incorporating CSP Heuristics. CP 2003: 96-107 - [c3]Carlos Ansótegui:
A New Approach to Solving SAT-Encoded Binary CSPs. CP 2003: 962 - [c2]Carlos Ansótegui, Felip Manyà:
New Logical and Complexity Results for Signed-SAT. ISMVL 2003: 181-187 - 2002
- [c1]Carlos Ansótegui, Felip Manyà:
Bridging the Gap between SAT and CSP. CP 2002: 784-785
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: