Now showing items 1-2 of 2

    • Reducing chaos in SAT-like search: finding solutions close to a given one 

      Abío Roig, Ignasi; Deters, Morgan; Nieuwenhuis, Robert Lukas Mario; Stuckey, Peter (Springer Verlag, 2011)
      Conference report
      Restricted access - publisher's policy
      Motivated by our own industrial users, we attack the following challenge that is crucial in many practical planning, scheduling or timetabling applications. Assume that a solver has found a solution for a given hard ...
    • To encode or to propagate? The best choice for each constraint in SAT 

      Abío Roig, Ignasi; Nieuwenhuis, Robert Lukas Mario; Oliveras Llunell, Albert; Rodríguez Carbonell, Enric; Stuckey, Peter (Springer, 2013)
      Conference report
      Open Access
      Sophisticated compact SAT encodings exist for many types of constraints. Alternatively, for instances with many (or large) constraints, the SAT solver can also be extended with built-in propagators (the SAT Modulo Theories ...