Login / Signup
Termination of Programs using Term Rewriting and SAT Solving.
Jürgen Giesl
Peter Schneider-Kamp
René Thiemann
Stephan Swiderski
Manh Thang Nguyen
Danny De Schreye
Alexander Serebrenik
Published in:
Deduction and Decision Procedures (2007)
Keyphrases
</>
term rewriting
sat solving
rewrite systems
theorem proving
theorem prover
sat solvers
operational semantics
boolean satisfiability
sat problem
max sat
search tree
inference rules
machine learning
symmetry breaking
orders of magnitude
search space
lower bound