Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
Given a formula in quantifier-free Presburger arithmetic, if it has a satisfying solution, there is one whose size, measured in bits, is polynomially bounded in the size of the formula. In this paper, we consider a special class of quantifier-free Presburger formulas in which most linear constraints...
| Autores principales: | , |
|---|---|
| Formato: | Artículo |
| Lenguaje: | English |
| Publicado: |
Logical Methods in Computer Science e.V.
2005-12-01
|
| Colección: | Logical Methods in Computer Science |
| Materias: | |
| Acceso en línea: | https://lmcs.episciences.org/2270/pdf |