{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:03:48Z","timestamp":1729652628270,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/lics.2004.1319605","type":"proceedings-article","created":{"date-parts":[[2004,11,12]],"date-time":"2004-11-12T19:14:14Z","timestamp":1100286854000},"page":"110-119","source":"Crossref","is-referenced-by-count":10,"title":["On the automata size for Presburger arithmetic"],"prefix":"10.1109","author":[{"given":"F.","family":"Klaedtke","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","first-page":"92","article-title":"U?ber die Vollsta?ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt","author":"presburger","year":"1930","journal-title":"Sprawozdanie z 1 Kongresu Metematyko?w Slowian?skich Warszawa 1929"},{"key":"17","first-page":"367","article-title":"Automatic presentations of structures","author":"khoussainov","year":"1995","journal-title":"LCC'94"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90021-1"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90136-3"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000082"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01368783"},{"key":"14","first-page":"171","article-title":"Deciding Presburger arithmetic by model checking and comparisons with other methods","author":"ganesh","year":"2002","journal-title":"FMCAD '02"},{"key":"11","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0062837","author":"ferrante","year":"1979","journal-title":"The Computational Complexity of Logical Theories"},{"key":"12","first-page":"27","article-title":"Super-exponential complexity of Presburger arithmetic","volume":"7","author":"fischer","year":"1974","journal-title":"Symp Appl Math Volume VII of SIAM-AMS Proc"},{"key":"21","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/3-540-36387-4_13","article-title":"The complexity of translating logic to finite automata","author":"reinhardt","year":"2002","journal-title":"Automata Logics and Infinite Games"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804361"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/371316.371494"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_56"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/BF02679468"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1076"},{"key":"26","first-page":"280","article-title":"A comparison of Presburger engines for EFSM reachability","author":"shiple","year":"1998","journal-title":"CAV'98"},{"key":"27","first-page":"1","article-title":"U?ber einige Satzfunktionen in der Arithmetik","volume":"7","author":"skolem","year":"1931","journal-title":"Skrifter Utgitt av Det Norske Videnskaps-akademi i Oslo I Matematisk Naturvidenskapelig Klasse"},{"journal-title":"The Complexity of Decision Problems in Automata Theory and Logic","year":"1974","author":"stockmeyer","key":"28"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1145\/309831.309888"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2000.855755"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90037-7"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(90)90150-P"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054103001911"},{"key":"30","first-page":"1","article-title":"On the construction of automata from linear arithmetic constraints","author":"wolper","year":"2000","journal-title":"TACAS'00"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/12.73590"},{"key":"6","first-page":"30","article-title":"Diophantine equations, Presburger arithmetic and finite automata","author":"boudet","year":"1996","journal-title":"CAAP'96"},{"key":"5","first-page":"152","article-title":"On the expressiveness of real and integer arithmetic automata","author":"boigelot","year":"1998","journal-title":"ICALP'98"},{"key":"4","first-page":"611","article-title":"On the use of weak automata for deciding linear arithmetic with integer and real veriables","author":"boigelot","year":"2001","journal-title":"IJCAR'01"},{"key":"9","first-page":"91","article-title":"Theorem proving in arithmetic without multiplication","volume":"7","author":"cooper","year":"1972","journal-title":"Machine Intelligence"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19600060105"}],"event":{"name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","start":{"date-parts":[[2004,7,17]]},"location":"Turku, Finland","end":{"date-parts":[[2004,7,17]]}},"container-title":["Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9221\/29239\/01319605.pdf?arnumber=1319605","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T05:27:29Z","timestamp":1545370049000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1319605\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/lics.2004.1319605","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}