Login / Signup

Proving Non-Termination by Acceleration Driven Clause Learning with LoAT.

Florian FrohnJürgen Giesl
Published in: CoRR (2023)
Keyphrases
  • clause learning
  • sat solvers
  • term rewrite systems
  • sat problem
  • satisfiability problem
  • orders of magnitude
  • propositional satisfiability
  • sat solving
  • objective function
  • lower bound
  • logic programs
  • np complete