Login / Signup

Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts.

Himanshu JainEdmund M. Clarke
Published in: DAC (2009)
Keyphrases
  • sat solving
  • sat solvers
  • boolean satisfiability
  • sat problem
  • horn clauses
  • clause learning
  • first order logic
  • reinforcement learning
  • np complete
  • search tree
  • sat instances
  • decision problems
  • constraint propagation