Carlos Ansótegui

J. Parallel Distributed Comput., March, 2024

SAT, Gadgets, Max2XOR, and Quantum Annealers.

[BibT_eX]

[DOI]

Juan A. Rodríguez-Aguilar

CoRR, 2024

Implementing 3-SAT Gadgets for Quantum Annealers with Random Instances.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2024, 2024

2023

Encoding Ethics to Compute Value-Aligned Norms.

[BibT_eX]

[DOI]

Marc Serramia

Manel Rodriguez-Soto

Maite López-Sánchez

Filippo Bistaffa

Paula Boddington

Michael J. Wooldridge

Minds Mach., December, 2023

A Benchmark Generator for Combinatorial Testing.

[BibT_eX]

[DOI]

CoRR, 2023

Interpretable decision trees through MaxSAT.

[BibT_eX]

[DOI]

Josep Alòs

Artif. Intell. Rev., 2023

Exploiting Configurations of MaxSAT Solvers.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

On the Density of States of Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2023

2022

Incomplete MaxSAT approaches for combinatorial testing.

[BibT_eX]

[DOI]

J. Heuristics, 2022

Reducing SAT to Max2XOR.

[BibT_eX]

[DOI]

CoRR, 2022

Boosting evolutionary algorithm configuration.

[BibT_eX]

[DOI]

Josep Pon

Ann. Math. Artif. Intell., 2022

Scale-Free Random SAT Instances.

[BibT_eX]

[DOI]

Algorithms, 2022

OptiLog V2: Model, Solve, Tune and Run.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

Yet Another (Fake) Proof of P=NP.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2022

2021

Learning Optimal Decision Trees Using MaxSAT.

[BibT_eX]

[DOI]

Josep Alos

CoRR, 2021

Learning How to Optimize Black-Box Functions With Extreme Limits on the Number of Function Evaluations.

[BibT_eX]

[DOI]

CoRR, 2021

PyDGGA: Distributed GGA for Automatic Configuration.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

OptiLog: A Framework for SAT-based Systems.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Learning to Optimize Black-Box Functions with Extreme Limits on the Number of Function Evaluations.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization - 15th International Conference, 2021

Reducing SAT to Max2SAT.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Building High Strength Mixed Covering Arrays with Constraints.

[BibT_eX]

[DOI]

Jesus Ojeda

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2019

Community Structure in Industrial SAT Instances.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2019

Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2019

Phase Transition in Realistic Random SAT Models.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2019

2018

Hyper-Reactive Tabu Search for MaxSAT.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse.

[BibT_eX]

[DOI]

Juan A. Rodríguez-Aguilar

Kevin Tierney

Proceedings of the Principles and Practice of Constraint Programming, 2018

Moral Values in Norm Decision Making.

[BibT_eX]

[DOI]

Marc Serramia

Maite López-Sánchez

Manel Rodriguez-Soto

Michael J. Wooldridge

Javier Morales

Juan A. Rodríguez-Aguilar

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Exploiting Moral Values to Choose the Right Norms.

[BibT_eX]

[DOI]

Marc Serramia

Maite López-Sánchez

Javier Morales

Michael J. Wooldridge

Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society, 2018

2017

Structure features for SAT instances classification.

[BibT_eX]

[DOI]

J. Appl. Log., 2017

WPM3: An (in)complete algorithm for weighted partial MaxSAT.

[BibT_eX]

[DOI]

Artif. Intell., 2017

Reactive Dialectic Search Portfolios for MaxSAT.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Exploiting subproblem optimization in SAT-based MaxSAT algorithms.

[BibT_eX]

[DOI]

J. Heuristics, 2016

Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers.

[BibT_eX]

[DOI]

Fuzzy Sets Syst., 2016

Community Structure in Industrial SAT Instances.

[BibT_eX]

[DOI]

CoRR, 2016

MaxSAT by improved instance-specific algorithm configuration.

[BibT_eX]

[DOI]

Artif. Intell., 2016

2015

SAT and SMT Technology for Many-Valued Logics.

[BibT_eX]

[DOI]

J. Multiple Valued Log. Soft Comput., 2015

Using Community Structure to Detect Relevant Learnt Clauses.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Model-Based Genetic Algorithms for Algorithm Configuration.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Exploiting the Structure of Unsatisfiable Cores in MaxSAT.

[BibT_eX]

[DOI]

Frédéric Didier

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

On the Classification of Industrial SAT Families.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2015

2014

The Fractal Dimension of SAT Formulas.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

MaxSAT by Improved Instance-Specific Algorithm Configuration.

[BibT_eX]

[DOI]

Yuri Malitsky

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Resolution procedures for multiple-valued optimization.

[BibT_eX]

[DOI]

Inf. Sci., 2013

Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories.

[BibT_eX]

[DOI]

Constraints An Int. J., 2013

On the hardness of solving edge matching puzzles as SAT or CSP problems.

[BibT_eX]

[DOI]

Constraints An Int. J., 2013

SAT-based MaxSAT algorithms.

[BibT_eX]

[DOI]

Artif. Intell., 2013

Solving (Weighted) Partial MaxSAT with ILP.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

Improving WPM2 for (Weighted) Partial MaxSAT.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2013

A Max-SAT-Based Approach to Constructing Optimal Covering Arrays.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2013

2012

The Community Structure of SAT Formulas.

[BibT_eX]

[DOI]

Jesús Giráldez-Cru

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers.

[BibT_eX]

[DOI]

Proceedings of the 42nd IEEE International Symposium on Multiple-Valued Logic, 2012

Improving SAT-Based Weighted MaxSAT Solvers.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

A SAT-Based Approach to MinSAT.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2012

Analysis and Generation of Pseudo-Industrial MaxSAT Instances.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2012

2011

Generating highly balanced sudoku problems as hard problems.

[BibT_eX]

[DOI]

J. Heuristics, 2011

Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem.

[BibT_eX]

[DOI]

Proceedings of the Ninth Symposium on Abstraction, Reformulation, and Approximation, 2011

Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the 41st IEEE International Symposium on Multiple-Valued Logic, 2011

On the Modularity of Industrial SAT Instances.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2011

2010

Solving Pseudo-Boolean Modularity Constraints.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2010, 2010

A New Algorithm for Weighted Partial MaxSAT.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Solving (Weighted) Partial MaxSAT through Satisfiability Testing.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Towards Industrial-Like Random SAT Instances.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms.

[BibT_eX]

[DOI]

Kevin Tierney

Proceedings of the Principles and Practice of Constraint Programming, 2009

On the Structure of Industrial SAT Instances.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

On Solving MaxSAT Through SAT.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2009

2008

Hard SAT and CSP instances with Expander Graphs.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Edge Matching Puzzles as Hard SAT/CSP Benchmarks.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2008

From High Girth Graphs to Hard Instances.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2008

Random SAT Instances à la Carte.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2008

How Hard is a Commercial Puzzle: the Eternity II Challenge.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2008

Measuring the Hardness of SAT Instances.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

Generating Hard SAT/CSP Instances Using Expander Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

Exploiting multivalued knowledge in variable selection heuristics for SAT solvers.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2007

Mapping CSP into Many-Valued SAT.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

A Complete Resolution Calculus for Signed Max-SAT.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Multiple-Valued Logic, 2007

The Logic Behind Weighted CSP.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2007, 2007

What Is a Real-World SAT Instance?

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2007

Inference Rules for High-Order Consistency in Weighted CSP.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

On Balanced CSPs with High Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Boosting Open CSPs.

[BibT_eX]

[DOI]

Santiago Macho González

Pedro Meseguer

Proceedings of the Principles and Practice of Constraint Programming, 2006

Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

The Impact of Balancing on Problem Hardness in a Highly Structured Domain.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

2005

Mapping Many-Valued CNF Formulas to Boolean CNF Formulas.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2005), 2005

The Achilles' Heel of QBF.

[BibT_eX]

[DOI]

Carla P. Gomes

Bart Selman

Proceedings of the Proceedings, 2005

2004

Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2004

Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables.

[BibT_eX]

[DOI]

Proceedings of the SAT 2004, 2004

The Interface between P and NP in Signed CNF Formulas.

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2004), 2004

Modeling Choices in Quasigroup Completion: SAT vs. CSP.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003

Automated monitoring of medical protocols: a secure and distributed architecture.

[BibT_eX]

[DOI]

Artif. Intell. Medicine, 2003

Una introducción a los algoritmos de satisfactibilidad.

[BibT_eX]

[DOI]

Inteligencia Artif., 2003

New Logical and Complexity Results for Signed-SAT.

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 2003

Boosting Chaff's Performance by Incorporating CSP Heuristics.

[BibT_eX]

[DOI]

Jose Larrubia

Proceedings of the Principles and Practice of Constraint Programming, 2003

A New Approach to Solving SAT-Encoded Binary CSPs.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2003

2002

Bridging the Gap between SAT and CSP.

[BibT_eX]

[DOI]