no code implementations • 13 Jun 2023 • Josep Alòs, Carlos Ansótegui, Josep M. Salvia, Eduard Torres
In this paper, we describe how we can effectively exploit alternative parameter configurations to a MaxSAT solver.
no code implementations • 4 Apr 2022 • Carlos Ansótegui, Jordi Levy
Representing some problems with XOR clauses (parity constraints) can allow to apply more efficient reasoning techniques.
no code implementations • 26 May 2021 • Carlos Ansótegui, Felip Manyà, Jesus Ojeda, Josep M. Salvia, Eduard Torres
We present a Satisfiability (SAT)-based approach for building Mixed Covering Arrays with Constraints of minimum length, referred to as the Covering Array Number problem.
no code implementations • 10 Jun 2016 • Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon
The research community on complex networks has developed techniques of analysis and algorithms to study real-world graphs that can be used by the SAT community.
