Now showing items 1-3 of 3

    • On the hardness of solving edge matching puzzles as SAT or CSP problems 

      Ansótegui Gil, Carlos José; Béjar Torres, Ramón; Fernàndez Camon, César; Mateu Piñol, Carles (Springer Verlag, 2013)
      Edge matching puzzles have been amongst us for a long time now and traditionally they have been considered, both, a children’s game and an interesting mathematical divertimento. Their main characteristics have already been ...
    • SAT-based MaxSAT algorithms 

      Ansótegui Gil, Carlos José; Bonet, Maria Luisa; Levy, Jordi (Elsevier, 2013)
      Many industrial optimization problems can be translated to MaxSAT. Although the general problem is NP hard, like SAT, many practical problems may be solved using modern MaxSAT solvers. In this paper we present several ...
    • Scale-Free Random SAT Instances 

      Ansótegui Gil, Carlos José; Bonet, Maria Luisa; Levy, Jordi (MDPI, 2022)
      We focus on the random generation of SAT instances that have properties similar to real-world instances. It is known that many industrial instances, even with a great number of variables, can be solved by a clever solver ...