Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
Abstract- Finding Golomb rulers is an extremely challenging optimization problem (with many practical applications) that has been approached by a variety of search methods in recen...
We solve the Flexible Job-Shop Problem (FJSP) by using dispatching rules discovered through Genetic Programming (GP). While Simple Priority Rules (SPR) have been widely applied in ...
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes setsharing. In thi...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Abstract. Invariants that incrementally maintain the value of expresder assignments to their variables are a natural abstraction to build high-level local search algorithms. But th...