Abstract: Hybridization of CP and SAT combines the strengths of both paradigms, Constraint Programming (CP) and the Boolean satisfiability problem (SAT). This hybridization allows for the use of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results