Computing a Complete Basis for Equalities Implied by a System of LRA Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Computing a Complete Basis for Equalities Implied by a System of LRA Constraints

Abstract

We present three new methods that investigate the equalities implied by a system of linear arithmetic constraints. Implied equalities can be used to simplify linear arithmetic constraints and are valuable in the context of Nelson-Oppen style combinations of theories. The first method efficiently checks whether a system of linear arithmetic constraints implies an equality at all. In case the system does, the method also returns a valid equality as an explanation. The second method uses the first method to compute a basis for all implied equalities, i.e., a finite representation of all equalities implied by the linear arithmetic constraints. The third method uses the second method to check efficiently whether a system of linear arithmetic constraints implies a given equality.
Fichier principal
Vignette du fichier
SMT2016.pdf (460.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01403214 , version 1 (25-11-2016)

Identifiers

  • HAL Id : hal-01403214 , version 1

Cite

Martin Bromberger, Christoph Weidenbach. Computing a Complete Basis for Equalities Implied by a System of LRA Constraints. 14th International Workshop on Satisfiability Modulo Theories, 2016, Coimbra, Portugal. pp.15-30. ⟨hal-01403214⟩
187 View
72 Download

Share

Gmail Facebook X LinkedIn More