{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:21:53Z","timestamp":1742998913945,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230243"},{"type":"electronic","value":"9783540301240"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30124-0_10","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T12:27:59Z","timestamp":1267532879000},"page":"85-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Goal-Directed Methods for \u0141ukasiewicz Logic"],"prefix":"10.1007","author":[{"given":"George","family":"Metcalfe","sequence":"first","affiliation":[]},{"given":"Nicola","family":"Olivetti","sequence":"additional","affiliation":[]},{"given":"Dov","family":"Gabbay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,9,9]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1008311022292","volume":"9","author":"S. Aguzzoli","year":"2000","unstructured":"Aguzzoli, S., Ciabattoni, A.: Finiteness in infinite-valued logic. Journal of Logic, Language and Information\u00a09(1), 5\u201329 (2000)","journal-title":"Journal of Logic, Language and Information"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1090\/S0002-9947-1958-0094302-9","volume":"88","author":"C.C. Chang","year":"1958","unstructured":"Chang, C.C.: Algebraic analysis of many-valued logics. Transactions of the American Mathematical Society\u00a088, 467\u2013490 (1958)","journal-title":"Transactions of the American Mathematical Society"},{"key":"10_CR3","volume-title":"Trends in Logic","author":"R. Cignoli","year":"1999","unstructured":"Cignoli, R., D\u2019Ottaviano, I.M.L., Mundici, D.: Algebraic Foundations of Many- Valued Reasoning. In: Trends in Logic, vol.\u00a07, Kluwer, Dordrecht (1999)"},{"key":"10_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-1713-7","volume-title":"Goal-directed Proof Theory","author":"D. Gabbay","year":"2000","unstructured":"Gabbay, D., Olivetti, N.: Goal-directed Proof Theory. Kluwer, Dordrecht (2000)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-94-017-0464-9_4","volume-title":"Handbook of Philosophical Logic","author":"D. Gabbay","year":"2002","unstructured":"Gabbay, D., Olivetti, N.: Goal oriented deductions. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, 2nd edn., vol.\u00a09, pp. 199\u2013285. Kluwer, Dordrecht (2002)","edition":"2"},{"key":"10_CR6","volume-title":"Automated Deduction in Multiple-Valued Logics","author":"R. H\u00e4hnle","year":"1993","unstructured":"H\u00e4hnle, R.: Automated Deduction in Multiple-Valued Logics. Oxford University Press, Oxford (1993)"},{"key":"10_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5300-3","volume-title":"Metamathematics of Fuzzy Logic","author":"P. H\u00e1jek","year":"1998","unstructured":"H\u00e1jek, P.: Metamathematics of Fuzzy Logic. Kluwer, Dordrecht (1998)"},{"issue":"1","key":"10_CR8","first-page":"5","volume":"1","author":"F. Klawonn","year":"1994","unstructured":"Klawonn, F., Kruse, R.: A \u0141ukasiewicz logic based Prolog. Mathware & Soft Computing\u00a01(1), 5\u201329 (1994)","journal-title":"Mathware & Soft Computing"},{"key":"10_CR9","unstructured":"\u0141ukasiewicz, J., Tarski, A.: Untersuchungen \u00fcber den Aussagenkalk\u00fcl. Comptes Rendus des S\u00e9ances de la Societ\u00e9 des Sciences et des Lettres de Varsovie, Classe III\u00a023 (1930)"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2268660","volume":"16","author":"R. McNaughton","year":"1951","unstructured":"McNaughton, R.: A theorem about infinite-valued sentential logic. Journal of Symbolic Logic\u00a016(1), 1\u201313 (1951)","journal-title":"Journal of Symbolic Logic"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-540-45220-1_33","volume-title":"Computer Science Logic","author":"G. Metcalfe","year":"2003","unstructured":"Metcalfe, G., Olivetti, N., Gabbay, D.: Goal-directed calculi for g\u00f6del-dummett logics. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 413\u2013426. Springer, Heidelberg (2003)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Metcalfe, G., Olivetti, N., Gabbay, D.: Sequent and hypersequent calculi for abelian and \u0141ukasiewicz logics. ACM TOCL (2004, To appear)","DOI":"10.1145\/1071596.1071600"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D. Miller","year":"1991","unstructured":"Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic\u00a051, 125\u2013157 (1991)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1-2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0304-3975(87)90083-1","volume":"52","author":"D. Mundici","year":"1987","unstructured":"Mundici, D.: Satisfiability in many-valued sentential logic is NP-complete. Theoretical Computer Science\u00a052(1-2), 145\u2013153 (1987)","journal-title":"Theoretical Computer Science"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1017\/CBO9780511983474.017","volume-title":"Knowledge, belief and strategic interaction","author":"D. Mundici","year":"1992","unstructured":"Mundici, D.: The logic of Ulam\u2019s game with lies. In: Bicchieri, C., Dalla Chiara, M.L. (eds.) Knowledge, belief and strategic interaction, pp. 275\u2013284. Cambridge University Press, Cambridge (1992)"},{"issue":"1\u20132","key":"10_CR16","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0304-3975(98)00012-7","volume":"200","author":"D. Mundici","year":"1998","unstructured":"Mundici, D., Olivetti, N.: Resolution and model building in the infinite-valued calculus of \u0141ukasiewicz. Theoretical Computer Science\u00a0200(1\u20132), 335\u2013366 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/A:1022989323091","volume":"73","author":"N. Olivetti","year":"2003","unstructured":"Olivetti, N.: Tableaux for _Lukasiewicz infinite-valued logic. Studia Logica\u00a073(1), 81\u2013111 (2003)","journal-title":"Studia Logica"},{"issue":"2","key":"10_CR18","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1093\/logcom\/4.2.175","volume":"4","author":"D.J. Pym","year":"1994","unstructured":"Pym, D.J., Harland, J.A.: The uniform proof-theoretic foundation of linear logic programming. Journal of Logic and Computation\u00a04(2), 175\u2013206 (1994)","journal-title":"Journal of Logic and Computation"},{"key":"10_CR19","unstructured":"Subrahmanian, V.S.: Intuitive semantics for quantitative rule sets. In: Kowalski, R., Bowen, K. (eds.) Logic Programmin, Proceedings of the Fifth International Conference and Symposium, pp. 1036\u20131053 (1988)"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0165-0114(01)00106-3","volume":"124","author":"P. Vojt\u00b4as","year":"2001","unstructured":"Vojt\u00b4as, P.: Fuzzy logic programming. Fuzzy Sets and Systems\u00a0124, 361\u2013370 (2001)","journal-title":"Fuzzy Sets and Systems"},{"key":"10_CR21","unstructured":"Wagner, H.: A new resolution calculus for the infinite-valued propositional logic of \u0141ukasiewicz. In: Caferra, R., Salzer, G. (eds.) Int. Workshop on First-Order Theorem Proving, pp. 234\u2013243 (1998)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30124-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,26]],"date-time":"2020-01-26T00:04:06Z","timestamp":1579997046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30124-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230243","9783540301240"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30124-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"9 September 2004","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}