13 citations · 13 across the 4 of their papers we have counts for
4 papers
SAT-IT: an Online Interactive SAT Tracer
Wilber Bermeo, Jordi Coll, Pau Ferrer +1
Modern Boolean Satisfiability (SAT) solvers, based on the Conflict-Driven Clause Learning (CDCL) paradigm, achieve state-of-the-art efficiency but present a steep learning curve du…
Certified Branch-and-Bound MaxSAT Solving (Extended Version)
Dieter Vandesande, Jordi Coll, Bart Bogaerts
Over the past few decades, combinatorial solvers have seen remarkable performance improvements, enabling their practical use in real-world applications. In some of these applicatio…
A Preliminary Case Study of Planning With Complex Transitions: Plotting
Jordi Coll, Joan Espasa, Ian Miguel +1
Plotting is a tile-matching puzzle video game published by Taito in 1989. Its objective is to reduce a given grid of coloured blocks down to a goal number or fewer. This is achieve…
SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints
Miquel Bofill, Jordi Coll, Peter Nightingale +3
When solving a combinatorial problem using propositional satisfiability (SAT), the encoding of the problem is of vital importance. We study encodings of Pseudo-Boolean (PB) constra…