On the automata size for Presburger arithmetic

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 110-119

  Klaedtke, Felix ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIGITAL ARITHMETIC; INTEGER PROGRAMMING; LINEAR EQUATIONS; PARAMETER ESTIMATION; PROBLEM SOLVING;

AUTOMATA SIZE; DECISION PROBLEMS; LINEAR NUMBER; PRESBURGER ARITHMETIC (PA);

AUTOMATA THEORY;

EID: 4544383221     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2004.1319605     Document Type: Conference Paper

References (30)

1. C. Bartzis and T. Bultan. Efficient symbolic representations for arithmetic constraints in verification. Int. J. Found. Comput. Sci., 14(4):605-624, 2003.
2. L. Berman. The complexity of logical theories. Theor. Comput. Sci., 11:71-77, 1980.
3. A. Blumensath and E. Grädel. Automatic structures. In LICS'00, pp. 51-62, 2000.
4. B. Boigelot, S. Jodogne, and P. Wolper. On the use of weak automata for deciding linear arithmetic with integer and real veriables. In IJCAR'01, LNCS 2083, pp. 611-625, 2001.
5. B. Boigelot, S. Rassart, and P. Wolper. On the expressiveness of real and integer arithmetic automata (extended abstract). In ICALP'98, LNCS 1443, pp. 152-163, 1998.
6. A. Boudet and H. Comon. Diophantine equations, Presburger arithmetic and finite automata. In CAAP'96, LNCS 1059, pp. 30-43, 1996.
7. R. Bryant. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. on Comp., 40:205-213, 1991.
8. J. Büchi. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math., 6:66-92, 1960.
9. D. Cooper. Theorem proving in arithmetic without multiplication. Machine Intelligence, 7:91-99, 1972.
10. J. Dixmier. Proof of a conjecture by Erdös and Graham concerning the problem of Frobenius. J. Number Theory, 34(2): 198-209, 1990.
11. J. Ferrante and C. Rackoff. The Computational Complexity of Logical Theories. LNM 718. 1979.
12. M. Fischer and M. Rabin. Super-exponential complexity of Presburger arithmetic. In Symp. appl. Math., volume VII of SIAM-AMS Proc., pp. 27-41, 1974.
13. C. Frougny. Representations of numbers and finite automata. Math. Syst. Theory, 25(1):37-60, 1992.
14. V. Ganesh, S. Berezin, and D. Dill. Deciding Presburger arithmetic by model checking and comparisons with other methods. In FMCAD'02, LNCS 2517, pp. 171-186, 2002.
15. E. Grädel. Subclasses of Presburger arithmetic and the polynomial-time hierarchy. Theor. Comput. Sci., 56:289-301, 1988.
16. M. Hollander. Greedy numeration systems and regularity. Theory Comput. Syst., 31(2):111-133, 1998.
17. B. Khoussainov and A. Nerode. Automatic presentations of structures. ln LCC'94, LNCS 960, pp. 367-392, 1995.
18. 22pn upper bound on the complexity of Presburger arithmetic. J. Comput. Syst. Sci., 16:323-332, 1978.
19. M. Presburger. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In Sprawozdanie z 1 Kongresu metematyków slowiańskich, Warszawa 1929, pp. 92-101, 395, 1930.
20. C. Reddy and D. Loveland. Presburger arithmetic with bounded quantifier alternation. In STOC'78, pp. 320-325, 1978.
21. K. Reinhardt. The complexity of translating logic to finite automata. In E. Grädel, W. Thomas, and T. Wilke, editors, Automata, Logics, and Infinite Games, LNCS 2500, ch. 13, pp. 231-238. 2002.
22. T. Rybina and A. Voronkov. A decision procedure for term algebras with queues. ACM Trans. Comput. Log., 2(2):155-181, 2001.
23. T. Rybina and A. Voronkov. Upper bounds for a theory of queues. In ICALP'03, LNCS 2719, pp. 714-724, 2003.
24. U. Schöning. Complexity of Presburger arithmetic with fixed quantifier dimension. Theory Comput. Syst., 30(4):423-428, 1997.
25. J. Shallit. Numeration systems, linear recurrences, and regular sets. Inf. Comput., 113(2):331-347, 1994.
26. T. Shiple, J. Kukula, and R. Ranjan. A comparison of Presburger engines for EFSM reachability. In CAV'98, LNCS 1427, pp. 280-292, 1998.
27. T. Skolem. Über einige Satzfunktionen in der Arithmetik. In Skrifter utgitt av Det Norske Videnskaps-Akademi i Oslo, I. Matematisk naturvidenskapelig klasse, volume 7, pp. 1-28, Oslo, 1931.
28. L. Stockmeyer. The complexity of decision problems in automata theory and logic. PhD thesis, Department of Electrical Engineering, MIT, Boston, MA, USA, 1974.
29. V. Weispfenning. Mixed real-integer linear quantifier elimination. In ISSAC'99, pp. 129-136, 1999.
30. P. Wolper and B. Boigelot. On the construction of automata from linear arithmetic constraints. In TACAS'00, LNCS 1785, pp. 1-19, 2000.