13 citations · 13 across the 1 of their papers we have counts for
2 papers
cs.AI2021★ 13 cited
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…
cs.PL2019
Resource Analysis driven by (Conditional) Termination Proofs
Elvira Albert, Miquel Bofill, Cristina Borralleras +2
When programs feature a complex control flow, existing techniques for resource analysis produce cost relation systems (CRS) whose cost functions retain the complex flow of the prog…