13 citations · 25 across the 5 of their papers we have counts for
5 papers
A Good Snowman is Hard to Plan
Miquel Bofill, Cristina Borralleras, Joan Espasa +3
In this work we face a challenging puzzle video game: A Good Snowman is Hard to Build. The objective of the game is to build snowmen by moving and stacking snowballs on a discrete…
On Grid Graph Reachability and Puzzle Games
Miquel Bofill, Cristina Borralleras, Joan Espasa +1
Many puzzle video games, like Sokoban, involve moving some agent in a maze. The reachable locations are usually apparent for a human player, and the difficulty of the game is mainl…
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…
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…
Solving the Wastewater Treatment Plant Problem with SMT
Miquel Bofill, Víctor Muñoz, Javier Murillo
In this paper we introduce the Wastewater Treatment Plant Problem, a real-world scheduling problem, and compare the performance of several tools on it. We show that, for a naive mo…