{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:39:53Z","timestamp":1725518393075},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540710691"},{"type":"electronic","value":"9783540710707"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71070-7_3","type":"book-chapter","created":{"date-parts":[[2008,8,29]],"date-time":"2008-08-29T05:56:30Z","timestamp":1219989390000},"page":"18-33","source":"Crossref","is-referenced-by-count":18,"title":["Linear Quantifier Elimination"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Nipkow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/11812289_4","volume-title":"Mathematical Knowledge Management","author":"C. Ballarin","year":"2006","unstructured":"Ballarin, C.: Interpretation of locales in Isabelle: Theories and proof contexts. In: Borwein, J.M., Farmer, W.M. (eds.) MKM 2006. LNCS (LNAI), vol.\u00a04108, pp. 31\u201343. Springer, Heidelberg (2006)"},{"key":"3_CR2","first-page":"103","volume-title":"The Correctness Problem in Computer Science","author":"R.S. Boyer","year":"1981","unstructured":"Boyer, R.S., Moore, J.S.: Metafunctions: proving them correct and using them efficiently as new proof procedures. In: Boyer, R., Moore, J. (eds.) The Correctness Problem in Computer Science, pp. 103\u2013184. Academic Press, London (1981)"},{"key":"3_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/11814771_43","volume-title":"Automated Reasoning","author":"A. Chaieb","year":"2006","unstructured":"Chaieb, A.: Verifying mixed real-integer quantifier elimination. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 528\u2013540. Springer, Heidelberg (2006)"},{"key":"3_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/11591191_26","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A. Chaieb","year":"2005","unstructured":"Chaieb, A., Nipkow, T.: Verifying and reflecting quantifier elimination for Presburger arithmetic. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 367\u2013380. Springer, Heidelberg (2005)"},{"key":"3_CR5","unstructured":"Cooper, D.C.: Theorem proving in arithmetic without multiplication. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol.\u00a07, pp. 91\u2013100. Edinburgh University Press (1972)"},{"key":"3_CR6","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. Computing\u00a04, 69\u201376 (1975)","journal-title":"SIAM J. Computing"},{"key":"3_CR7","unstructured":"Gonthier, G.: A computer-checked proof of the four-colour theorem, \n                    \n                      http:\/\/research.microsoft.com\/~gonthier\/4colproof.pdf"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-540-74464-1_11","volume-title":"Types for Proofs and Programs","author":"F. Haftmann","year":"2007","unstructured":"Haftmann, F., Wenzel, M.: Constructive type classes in Isabelle. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol.\u00a04502, pp. 160\u2013174. Springer, Heidelberg (2007)"},{"key":"3_CR9","unstructured":"Harrison, J.: Introduction to Logic and Automated Theorem Proving. Cambridge University Press, Cambridge (forthcoming)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","first-page":"159","volume-title":"Theorem Proving in Higher Order Logics","author":"J. Harrison","year":"2001","unstructured":"Harrison, J.: Complex quantifier elimination in HOL. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol.\u00a02152, pp. 159\u2013174. Springer, Heidelberg (2001)"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"16","DOI":"10.2307\/1968352","volume":"28","author":"C. Langford","year":"1927","unstructured":"Langford, C.: Some theorems on deducibility. Annals of Mathematics (2nd Series)\u00a028, 16\u201340 (1927)","journal-title":"Annals of Mathematics (2nd Series)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1093\/comjnl\/36.5.450","volume":"36","author":"R. Loos","year":"1993","unstructured":"Loos, R., Weispfenning, V.: Applying linear quantifier elimination. The Computer Journal\u00a036, 450\u2013462 (1993)","journal-title":"The Computer Journal"},{"key":"3_CR13","unstructured":"Mahboubi, A.: Contributions \u00e0 la certification des calculs sur \u211d: th\u00e9orie, preuves, programmation. PhD thesis, Universit\u00e9 de Nice (2006)"},{"key":"3_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/11532231_22","volume-title":"Automated Deduction \u2013 CADE-20","author":"S. McLaughlin","year":"2005","unstructured":"McLaughlin, S., Harrison, J.: A proof-producing decision procedure for real arithmetic. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol.\u00a03632, pp. 295\u2013314. Springer, Heidelberg (2005)"},{"key":"3_CR15","first-page":"245","volume-title":"Formal Logical Methods for System Security and Correctness","author":"T. Nipkow","year":"2008","unstructured":"Nipkow, T.: Reflecting quantifier elimination for linear arithmetic. In: Grumberg, O., Nipkow, T., Pfaller, C. (eds.) Formal Logical Methods for System Security and Correctness, pp. 245\u2013266. IOS Press, Amsterdam (2008)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL","author":"T. Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L., Wenzel, M.: Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/10930755_5","volume-title":"Theorem Proving in Higher Order Logics","author":"M. Norrish","year":"2003","unstructured":"Norrish, M.: Complete integer decision procedures as derived rules in HOL. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol.\u00a02758, pp. 71\u201386. Springer, Heidelberg (2003)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/11541868_15","volume-title":"Theorem Proving in Higher Order Logics","author":"S. Obua","year":"2005","unstructured":"Obua, S.: Proving bounds for real linear programs in Isabelle\/HOL. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol.\u00a03603, pp. 227\u2013244. Springer, Heidelberg (2005)"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0747-7171(88)80003-8","volume":"5","author":"V. Weispfenning","year":"1988","unstructured":"Weispfenning, V.: The complexity of linear problems in fields. J. Symbolic Computation\u00a05, 3\u201327 (1988)","journal-title":"J. Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71070-7_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:36:32Z","timestamp":1620002192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71070-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540710691","9783540710707"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71070-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}