Login / Signup

Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper).

Florian FrohnJürgen Giesl
Published in: CADE (2023)
Keyphrases
  • clause learning
  • sat solvers
  • term rewrite systems
  • satisfiability problem
  • sat problem
  • sat solving
  • machine learning
  • co occurrence
  • constraint satisfaction
  • max sat
  • propositional satisfiability