Login / Signup
SAT Solving for Termination Analysis with Polynomial Interpretations.
Carsten Fuhs
Jürgen Giesl
Aart Middeldorp
Peter Schneider-Kamp
René Thiemann
Harald Zankl
Published in:
SAT (2007)
Keyphrases
</>
sat solving
termination analysis
active rules
active databases
sat solvers
boolean satisfiability
sat problem
orders of magnitude
database
domain independent
business rules
sat encodings
data model
integrity constraints
object oriented databases
satisfiability problem