Login / Signup

Automatic Combinability of Rewriting-Based Satisfiability Procedures.

Hélène KirchnerSilvio RaniseChristophe RingeissenDuc-Khanh Tran
Published in: LPAR (2006)
Keyphrases
  • computational complexity
  • real time
  • np complete
  • databases
  • phase transition
  • presburger arithmetic
  • data driven
  • semi automatic
  • satisfiability problem