{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:49Z","timestamp":1725566329892},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232421"},{"type":"electronic","value":"9783540302278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30227-8_44","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:34:52Z","timestamp":1284860092000},"page":"526-538","source":"Crossref","is-referenced-by-count":3,"title":["Polynomial Approximations of Full Propositional Logic via Limited Bivalence"],"prefix":"10.1007","author":[{"given":"Marcelo","family":"Finger","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","volume-title":"Symbolic Logic and Mechanical Theorem Proving","author":"C. Chang","year":"1973","unstructured":"Chang, C., Lee, R.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, London (1973)"},{"issue":"1","key":"44_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02136173","volume":"18","author":"M. Cadoli","year":"1996","unstructured":"Cadoli, M., Schaerf, M.: The complexity of entailment in propositional multivalued logics. Annals of Mathematics and Artificial Intelligence\u00a018(1), 29\u201350 (1996)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"44_CR3","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198507291.001.0001","volume-title":"Graphic Apology for Symmetry and Implicitness. Oxford Mathematical Monographs","author":"A. Carbone","year":"2000","unstructured":"Carbone, A., Semmes, S.: Graphic Apology for Symmetry and Implicitness. Oxford Mathematical Monographs. Oxford University Press, Oxford (2000)"},{"key":"44_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF00156916","volume":"1","author":"M. D\u2019Agostino","year":"1992","unstructured":"D\u2019Agostino, M.: Are tableaux an improvement on truth-tables? \u2014 cut-free proofs and bivalence. Journal of Logic, Language and Information\u00a01, 235\u2013252 (1992)","journal-title":"Journal of Logic, Language and Information"},{"key":"44_CR5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-94-017-1754-0_2","volume-title":"Handbook of Tableau Methods","author":"M. D\u2019Agostino","year":"1999","unstructured":"D\u2019Agostino, M.: Tableau methods foc classical propositional logic. In: D\u2019Agostino, M., Gabbay, D., Haehnle, R., Posegga, J. (eds.) Handbook of Tableau Methods, pp. 45\u2013124. Kluwer, Dordrecht (1999)"},{"key":"44_CR6","unstructured":"Dalal, M.: Anytime families of tractable propositional reasoners. In: International Symposium of Artificial Intelligence and Mathematics AI\/MATH 1996, pp. 42\u201345 (1996)"},{"key":"44_CR7","unstructured":"Dalal, M.: Semantics of an anytime family of reasponers. In: 12th European Conference on Artificial Intelligence, pp. 360\u2013364 (1996)"},{"key":"44_CR8","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1093\/logcom\/4.3.285","volume":"4","author":"M. D\u2019Agostino","year":"1994","unstructured":"D\u2019Agostino, M., Mondadori, M.: The taming of the cut. classical refutations with analytic cut. Journal of Logic and Computation\u00a04, 285\u2013319 (1994)","journal-title":"Journal of Logic and Computation"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Finger, M.: Towards polynomial approximations of full propositional logic. Technical Report RT-2004-04, Department of Computer Science, IME\/USP (2004), Available for download at www.ime.usp.br\/~mfinger\/publications","DOI":"10.1007\/978-3-540-28645-5_2"},{"issue":"2","key":"44_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1093\/logcom\/14.2.179","volume":"14","author":"M. Finger","year":"2004","unstructured":"Finger, M., Wassermann, R.: Approximate and limited reasoning: Semantics, proof theory, expressivity and control. Journal of Logic And Computation\u00a014(2), 179\u2013204 (2004)","journal-title":"Journal of Logic And Computation"},{"key":"44_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"44_CR12","first-page":"274","volume-title":"AAAI 1998","author":"F. Massacci","year":"1998","unstructured":"Massacci, F.: Anytime approximate modal reasoning. In: Mostow, J., Rich, C. (eds.) AAAI 1998, pp. 274\u2013279. AAAI Press, Menlo Park (1998)"},{"key":"44_CR13","unstructured":"Massacci, F.: Efficient Approximate Deduction and an Application to Computer Security. PhD thesis, Dottorato in Ingegneria Informatica, Universit\u00e0 di Roma I \u201cLa Sapienza\u201d, Dipartimento di Informatica e Sistemistica (June 1998)"},{"key":"44_CR14","unstructured":"McAllester, D.: Truth maintenance. In: Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI 1990), pp. 1109\u20131116 (1990)"},{"issue":"2","key":"44_CR15","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0004-3702(94)00009-P","volume":"74","author":"M. Schaerf","year":"1995","unstructured":"Schaerf, M., Cadoli, M.: Tractable reasoning via approximation. Artificial Intelligence\u00a074(2), 249\u2013310 (1995)","journal-title":"Artificial Intelligence"},{"key":"44_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-86718-7","volume-title":"First-Order Logic","author":"R.M. Smullyan","year":"1968","unstructured":"Smullyan, R.M.: First-Order Logic. Springer, Heidelberg (1968)"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30227-8_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T15:59:22Z","timestamp":1711814362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30227-8_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232421","9783540302278"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30227-8_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}