An effective decision procedure for linear arithmetic over the integers and reals

  title={An effective decision procedure for linear arithmetic over the integers and reals},
  author={Bernard Boigelot and S{\'e}bastien Jodogne and Pierre Wolper},
  journal={ACM Trans. Comput. Log.},
This article considers finite-automata-based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finite automata on infinite words, but this involves some difficult and delicate to implement algorithms. The contribution of this article is to show, using topological arguments, that only a restricted class of automata on infinite words are necessary for handling real and integer linear arithmetic. This… CONTINUE READING
Highly Cited
This paper has 72 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.

72 Citations

Citations per Year
Semantic Scholar estimates that this publication has 72 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-8 of 8 references

The Computational Complexity of Logical Theories

Lecture Notes in Mathematics, vol. 718. Springer-Verlag, Berlin and Heidelberg, Germany/New York, NY. • 1979
View 4 Excerpts
Highly Influenced

Weak alternating automata are not that weak

ACM Trans. Comput. Log. • 1997
View 9 Excerpts
Highly Influenced

On the Complexity of omega-Automata

FOCS • 1988
View 4 Excerpts
Highly Influenced

Alternating Finite Automata on omega-Words

View 4 Excerpts
Highly Influenced

Finite-State omega-Languages

J. Comput. Syst. Sci. • 1983
View 6 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…