no code implementations • 19 Apr 2016 • Florian Brandl, Felix Brandt, Manuel Eberl, Christian Geist
Our proof is obtained by formulating the claim as a satisfiability problem over predicates from real-valued arithmetic, which is then checked using an SMT (satisfiability modulo theories) solver.
