Login / Signup

SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs.

Michael CodishJürgen GieslPeter Schneider-KampRené Thiemann
Published in: J. Autom. Reason. (2012)
Keyphrases
  • sat solving
  • term rewrite systems
  • sat solvers
  • boolean satisfiability
  • sat problem
  • theorem proving
  • boolean optimization
  • symmetry breaking
  • search tree
  • constraint satisfaction
  • theorem prover
  • sat encodings