{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:42:08Z","timestamp":1747546928409,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573227"},{"type":"electronic","value":"9783540480631"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57322-4_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:48:39Z","timestamp":1330260519000},"page":"262-275","source":"Crossref","is-referenced-by-count":6,"title":["A new translation from deduction into integer programming"],"prefix":"10.1007","author":[{"given":"Reiner","family":"H\u00e4hnle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"18_CR1","unstructured":"M. G. Beavers. Automated theorem proving for Lukasiewicz logics. Manuscript of talk given at 1991 Meeting of Society for Exact Philosophy, Victoria, Canada, may 1991."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Reiner H\u00e4hnle. Towards an efficient tableau proof procedure for multiple-valued logics. In Proceedings Workshop on Computer Science Logic, Heidelberg, pages 248\u2013260. Springer, LNCS 533, 1990.","DOI":"10.1007\/3-540-54487-9_62"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Reiner H\u00e4hnle. Uniform notation of tableaux rules for multiple-valued logics. In Proc. International Symposium on Multiple-Valued Logic, Victoria, pages 238\u2013245. IEEE Press, 1991.","DOI":"10.1109\/ISMVL.1991.130736"},{"key":"18_CR4","unstructured":"Reiner H\u00e4hnle. Tableaux-Based Theorem Proving in Multiple-Valued Logics. PhD thesis, University of Karlsruhe, Dept. of Computer Science, may 1992."},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0167-9236(88)90097-8","volume":"4","author":"J. N. Hooker","year":"1988","unstructured":"John N. Hooker. A quantitative approach to logical inference. Decision Support Systems, 4:45\u201369, 1988.","journal-title":"Decision Support Systems"},{"key":"18_CR6","volume-title":"Logic-Based Decision Support. Mixed Integer Model Formulation","author":"R. S. Jeroslow","year":"1988","unstructured":"Robert S. Jeroslow. Logic-Based Decision Support. Mixed Integer Model Formulation. Elsevier, Amsterdam, 1988."},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0304-3975(87)90083-1","volume":"52","author":"D. Mundici","year":"1987","unstructured":"Daniele Mundici. Satisfiability in many-valued sentential logic is NP-complete. Theoretical Computer Science, 52:145\u2013153, 1987.","journal-title":"Theoretical Computer Science"},{"key":"18_CR8","unstructured":"Daniele Mundici. Normal forms in infinite-valued logic: The case of one variable. In Proceedings Workshop Computer Science Logic 91, Berne. Springer, LNCS, 1991."},{"key":"18_CR9","first-page":"447","volume-title":"Handbooks in Operations Research and Management Science, Vol. II: Optimization, chapter VI","author":"G. L. Nemhauser","year":"1989","unstructured":"George L. Nemhauser and Laurence A. Wolsey. Integer programing. In G. L. Nemhauser, A. H. G. Rinnooy Kan, and M. J. Todd, editors, Handbooks in Operations Research and Management Science, Vol. II: Optimization, chapter VI, pages 447\u2013527. North-Holland, Amsterdam, 1989."},{"key":"18_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-86718-7","volume-title":"First-Order Logic","author":"R. Smullyan","year":"1968","unstructured":"Raymond Smullyan. First-Order Logic. Springer, New York, 1968."},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-94-009-5203-4_2","volume-title":"Handbook of Philosophical Logic, Vol. III: Alternatives in Classical Logic","author":"A. Urquhart","year":"1986","unstructured":"Alasdair Urquhart. Many-valued logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, Vol. III: Alternatives in Classical Logic, chapter 2, pages 71\u2013116. Reidel, Dordrecht, 1986."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Symbolic Mathematical Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57322-4_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:07:41Z","timestamp":1742594861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57322-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573227","9783540480631"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57322-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}