Login / Signup

Memory Efficient Parallel SAT Solving with Inprocessing.

Markus IserTomás BalyoCarsten Sinz
Published in: ICTAI (2019)
Keyphrases
  • memory efficient
  • sat solving
  • sat solvers
  • iterative deepening
  • boolean optimization
  • search algorithm
  • sat problem
  • dynamic programming
  • upper bound
  • model checking
  • search tree
  • symmetry breaking
  • boolean satisfiability