{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:33:29Z","timestamp":1742942009436,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_7","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T15:05:04Z","timestamp":1246547104000},"page":"79-90","source":"Crossref","is-referenced-by-count":2,"title":["Semilinear Program Feasibility"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Jonsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"von Oertzen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.4064\/sm-1-1-211-216","volume":"1","author":"S. Banach","year":"1929","unstructured":"Banach, S.: Sur les fonctionelles lin\u00e9aires. Studia Math.\u00a01, 211\u2013216, 223\u2013229 (1929)","journal-title":"Studia Math."},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92800-3_8","volume-title":"Complexity of Constraints","author":"M. Bodirsky","year":"2008","unstructured":"Bodirsky, M.: Constraint satisfaction problems with infinite templates. In: Creignou, N., Kolaitis, P., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol.\u00a05250. Springer, Heidelberg (2008)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bodirsky, M., K\u00e1ra, J.: The complexity of temporal constraint satisfaction problems. In: Proceedings of the 40th ACM Symposium on Theory of Computing (STOC-2008), pp. 29\u201338 (2008)","DOI":"10.1145\/1374376.1374382"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S0097539700376676","volume":"34","author":"A. Bulatov","year":"2005","unstructured":"Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the computational complexity of constraints using finte algebras. SIAM J. Comput.\u00a034(3), 720\u2013742 (2005)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"7_CR5","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1145\/355483.355485","volume":"47","author":"D. Cohen","year":"2001","unstructured":"Cohen, D., Jeavons, P., Jonsson, P., Koubarakis, M.: Building tractable disjunctive constraints. J. ACM\u00a047(5), 826\u2013853 (2001)","journal-title":"J. ACM"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S1574-6526(05)80008-2","volume-title":"Handbook of Temporal Reasoning in Artificial Intelligence","author":"T. Drakengren","year":"2005","unstructured":"Drakengren, T., Jonsson, P.: Computational complexity of temporal constraint problems. In: Fisher, M., Gabbay, D., Vila, L. (eds.) Handbook of Temporal Reasoning in Artificial Intelligence, pp. 197\u2013218. Elsevier, Amsterdam (2005)"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1137\/0204006","volume":"4","author":"J. Ferrante","year":"1975","unstructured":"Ferrante, J., Rackoff, C.: A decision procedure for the first order theory of real addition with order. SIAM J. Comput.\u00a04(1), 69\u201376 (1975)","journal-title":"SIAM J. Comput."},{"key":"7_CR8","first-page":"56","volume-title":"Complexity of Computation","author":"M. Fischer","year":"1974","unstructured":"Fischer, M., Rabin, M.: Super-exponential complexity of Presburger arithmetic. In: Karp, R.M. (ed.) Complexity of Computation, pp. 56\u201364. SIAM, Philadelphia (1974); Proceedings of the SIAM-AMS symposium in applied mathematics"},{"key":"7_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1515\/crll.1927.157.214","volume":"157","author":"H. Hahn","year":"1927","unstructured":"Hahn, H.: \u00dcber linearer Gleichungssysteme in linearer R\u00e4umen. J. Reine Angew. Math.\u00a0157, 214\u2013229 (1927)","journal-title":"J. Reine Angew. Math."},{"key":"7_CR11","volume-title":"A Shorter Model Theory","author":"W. Hodges","year":"1997","unstructured":"Hodges, W.: A Shorter Model Theory. Cambridge University Press, New York (1997)"},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/263867.263489","volume":"44","author":"P. Jeavons","year":"1997","unstructured":"Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. J. ACM\u00a044(4), 527\u2013548 (1997)","journal-title":"J. ACM"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0004-3702(98)00031-9","volume":"102","author":"P. Jonsson","year":"1998","unstructured":"Jonsson, P., B\u00e4ckstr\u00f6m, C.: A unifying approach to temporal constraint reasoning. Artif. Intell.\u00a0102(1), 143\u2013155 (1998)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"7_CR14","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(00)00177-8","volume":"266","author":"M. Koubarakis","year":"2001","unstructured":"Koubarakis, M.: Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning. Theor. Comput. Sci.\u00a0266(1\u20132), 311\u2013339 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR15","volume-title":"Model Theory: An Introduction","author":"D. Marker","year":"2002","unstructured":"Marker, D.: Model Theory: An Introduction. Springer, Heidelberg (2002)"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/200836.200848","volume":"42","author":"B. Nebel","year":"1995","unstructured":"Nebel, B., B\u00fcrckert, H.-J.: Reasoning about temporal relations: a maximal tractable subclass of Allen\u2019s interval algebra. J. ACM\u00a042(1), 43\u201366 (1995)","journal-title":"J. ACM"},{"key":"7_CR17","unstructured":"Presburger, M.: \u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Comptes Rendus du I congr\u00e8s de Math\u00e9maticiens des Pays Slaves, pp. 92\u2013101 (1929)"},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1515\/crll.1910.137.167","volume":"137","author":"E. Steinitz","year":"1910","unstructured":"Steinitz, E.: Algebraischen Theorie der K\u00f6rper. J. Reine. Angew. Math.\u00a0137, 167\u2013309 (1910)","journal-title":"J. Reine. Angew. Math."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T21:38:15Z","timestamp":1685050695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}