{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T11:03:21Z","timestamp":1777892601899,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T00:00:00Z","timestamp":1146700800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JoLLI"],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1007\/s10849-005-9001-y","type":"journal-article","created":{"date-parts":[[2006,5,3]],"date-time":"2006-05-03T16:05:02Z","timestamp":1146672302000},"page":"195-218","source":"Crossref","is-referenced-by-count":15,"title":["Cut and Pay"],"prefix":"10.1007","volume":"15","author":[{"given":"Marcelo","family":"Finger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dov","family":"Gabbay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,4]]},"reference":[{"key":"9001_CR1","unstructured":"Anderson, A.R. and Belnap, N.D. Jr., 1975, Entailment: The Logic of Relevance and Necessity, Vol. 1. Princeton University Press."},{"key":"9001_CR2","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF00247711","volume":"13","author":"G. Boolos","year":"1984","unstructured":"Boolos, G., 1984, \u201cDon't eliminate cut,\u201d Journal of Philosophical Logic 13, 373\u2013378.","journal-title":"Journal of Philosophical Logic"},{"key":"9001_CR3","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198507291.001.0001","volume-title":"A Graphic Apology for Symmetry and Implicitness","author":"A. Carbone","year":"2000","unstructured":"Carbone, A. and Semmes, S., 2000, A Graphic Apology for Symmetry and Implicitness, Oxford Mathematical Monographs: Oxford University Press."},{"key":"9001_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF00156916","volume":"1","author":"M. D'Agostino","year":"1992","unstructured":"D'Agostino, M., 1992, \u201cAre tableaux an improvement on truth-tables? \u2013 Cut-free proofs and bivalence,\u201d Journal of Logic Language and Information 1, 235\u2013252.","journal-title":"Journal of Logic Language and Information"},{"key":"9001_CR5","doi-asserted-by":"crossref","unstructured":"D'Agostino, M., 1999, \u201cTableau methods for classical propositional logic,\u201d pp. 45\u2013124 in Handbook of Tableau Methods, Marcello D'Agostino, Dov Gabbay, Rainer Haehnle, and Joachim Posegga, eds., Kluwer.","DOI":"10.1007\/978-94-017-1754-0_2"},{"key":"9001_CR6","unstructured":"Dalal, M., 1996a, \u201cAnytime families of tractable propositional reasoners,\u201d pp. 42\u201345 in International Symposium of Artificial Intelligence and Mathematics AI\/MATH-96."},{"key":"9001_CR7","unstructured":"Dalal, M., 1996b, \u201cSemantics of an anytime family of reasoners,\u201d pp. 360\u2013364 in 12th European Conference on Artificial Intelligence."},{"issue":"4","key":"9001_CR8","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1305\/ndjfl\/1093891487","volume":"15","author":"N.C.A. da Costa","year":"1974","unstructured":"da Costa, N.C.A., 1974, \u201cOn the theory of inconsistent formal systems,\u201d Notre Dame Journal of Formal Logic 15(4), 497\u2013510.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"9001_CR9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1093\/logcom\/4.3.285","volume":"4","author":"M. D'Agostino","year":"1994","unstructured":"D'Agostino, M. and Mondadori, M., 1994, \u201cThe taming of the cut. Classical refutations with analytic cut,\u201d Journal of Logic and Computation 4, 285\u2013319.","journal-title":"Journal of Logic and Computation"},{"key":"9001_CR10","doi-asserted-by":"crossref","unstructured":"Finger, M., 2004a, \u201cPolynomial approximations of full propositional logic via limited bivalence,\u201d pp. 526\u2013538 in 9th European Conference on Logics in Artificial Intelligence (JELIA 2004), Vol. 3229 of Lecture Notes in Artificial Intellingence (LNAI), Lisbon, Portugal, Springer.","DOI":"10.1007\/978-3-540-30227-8_44"},{"key":"9001_CR11","doi-asserted-by":"crossref","unstructured":"Finger, M., 2004b, \u201cTowards polynomial approximations of full propositional logic,\u201d pp. 11\u201320 in XVII Brazilian Symposium on Artificial Intelligence (SBIA 2004), Ana L. C. Bazzan and Sofiane Labidi, eds., Vol. 3171 of Lecture Notes in Artificial Intellingence (LNAI), Springer.","DOI":"10.1007\/978-3-540-28645-5_2"},{"issue":"2","key":"9001_CR12","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1093\/logcom\/14.2.179","volume":"14","author":"M. Finger","year":"2004","unstructured":"Finger, M. and Wassermann, R., 2004, \u201cApproximate and limited reasoning: Semantics, proof theory, expressivity and control,\u201d Journal of Logic And Computation 14(2), 179\u2013204.","journal-title":"Journal of Logic And Computation"},{"key":"9001_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y., 1987, \u201cLinear logic,\u201d Theoretical Computer Science 50, 1\u2013102.","journal-title":"Theoretical Computer Science"},{"key":"9001_CR14","unstructured":"Massacci, F., 1998, \u201cAnytime approximate modal reasoning,\u201d pp. 274\u2013279 in AAAI-98, Jack Mostow and Charles Rich, eds., AAAIP."},{"key":"9001_CR15","doi-asserted-by":"crossref","unstructured":"Restall, G., 2000, An Introduction to Substructural Logics. Routledge.","DOI":"10.4324\/9780203252642"},{"issue":"2","key":"9001_CR16","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0004-3702(94)00009-P","volume":"74","author":"M. Schaerf","year":"1995","unstructured":"Schaerf, M. and Cadoli, M., 1995, \u201cTractable reasoning via approximation,\u201d Artificial Intelligence 74(2), 249\u2013310.","journal-title":"Artificial Intelligence"},{"key":"9001_CR17","doi-asserted-by":"crossref","unstructured":"Smullyan, R.M., 1968, First-Order Logic, Springer-Verlag.","DOI":"10.1007\/978-3-642-86718-7"},{"key":"9001_CR18","unstructured":"Van Dalen, D., 1984, \u201cIntuitionistic logic,\u201d in Handbook of Philosophical Logic, D. Gabbay and F. Guenthner, eds., Vol. III."}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-005-9001-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10849-005-9001-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-005-9001-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,4]],"date-time":"2024-02-04T05:44:38Z","timestamp":1707025478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10849-005-9001-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,4]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["9001"],"URL":"https:\/\/doi.org\/10.1007\/s10849-005-9001-y","relation":{},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"value":"0925-8531","type":"print"},{"value":"1572-9583","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5,4]]}}}