A Coq Tactic for Equality Learning in Linear Arithmetic
Authors: Sylvain Boulmé and Alexandre Maréchal
Paper Information
Title: | A Coq Tactic for Equality Learning in Linear Arithmetic |
Authors: | Sylvain Boulmé and Alexandre Maréchal |
Proceedings: | ITP Papers |
Editors: | Jeremy Avigad and Assia Mahboubi |
Keywords: | Linear Programming, Clause Learning, Skeptical Approach, The Coq Proof Assistant |
Abstract: | ABSTRACT. Coq provides linear arithmetic tactics such as omega or lia. Currently, these tactics either fully prove the current goal in progress, or fail. We propose to improve this behavior: when the goal is not provable in linear arithmetic, we inject in hypotheses new equalities discovered from the linear inequalities. These equalities may help other Coq tactics to discharge the goal. In other words, we apply -- in interactive proofs -- one of the seminal idea of SMT-solving: combining tactics by exchanging equalities. The paper describes how we have implemented equality learning in a new Coq tactic, dealing with linear arithmetic over rationals. It also illustrates how this tactic interacts with other Coq tactics. |
Pages: | 18 |
Talk: | Jul 10 12:00 (Session 54C) |
Paper: |