Variational satisfiability solving: efficiently solving lots of related sat problems

HIGHLIGHTS

• who: Jeffrey M. Young from the IOHK, Longmont, CO, USA University of Ulm, Ulm, Germany have published the Article: Variational satisfiability solving: efficiently solving lots of related SAT problems, in the Journal: (JOURNAL)
• what: The authors show assuming a input that the prototype solver scales better for these problems than four off-the-shelf incremental solvers while also automatically tracking individual results. The authors show that the performance benefit of using an incremental solver to solve a large number of related SAT problems can be achieved while mitigating the main drawbacks of incremental solvers, that . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.