{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:17Z","timestamp":1725663977014},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540568049"},{"type":"electronic","value":"9783540477501"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993]]},"DOI":"10.1007\/3-540-56804-2_26","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:39:58Z","timestamp":1330256398000},"page":"275-284","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Signed formulas: A liftable meta-logic for multiple-valued logics"],"prefix":"10.1007","author":[{"given":"Neil V.","family":"Murray","sequence":"first","affiliation":[]},{"given":"Erik","family":"Rosenthal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"crossref","first-page":"473","DOI":"10.2307\/2274395","volume":"52","author":"W. A. Carnielli","year":"1987","unstructured":"Carnielli, W.A. Systematization of finite many-valued logics through the method of tableaux. Journal of Symbolic Logic, 52,2 (June 1987), 473\u2013493.","journal-title":"Journal of Symbolic Logic"},{"key":"26_CR2","first-page":"72","volume-title":"Lecture Notes in Artificial Intelligence","author":"N. C. A. A. Costa da","year":"1990","unstructured":"da Costa, N.C.A., Henschen, L.J., Lu, J.J., and Subrahmanian, V.S. Automatic Theorem Proving in Paraconsistent Logics: theory and Implementation. Proceedings of the 10-th International Conference on Automated Deduction, Kaiserslautern, W. Germany, July 1990. In Lecture Notes in Artificial Intelligence, Springer Verlag, Vol. 449, 72\u201386."},{"key":"26_CR3","first-page":"498","volume-title":"Methodologies for Intelligent Systems, 5","author":"P. Doherty","year":"1990","unstructured":"Doherty, P. Preliminary report: NM3 \u2014 A three-valued non-monotonic formalism. Proceedings of the Fifth International Symposium on Methodologies for Intelligent Systems, Knoxville, Tennessee October 25\u201327, 1990. In Methodologies for Intelligent Systems, 5 (Ras, Z., Zemankova, M., and Emrich, M. eds.) North-Holland, 1990, 498\u2013505."},{"key":"26_CR4","unstructured":"Fitting, M. Resolution for Intuitionistic Logic. In Methodologies for Intelligent Systems, (Ras, Z. and Zemankova, M., eds.) North-Holland, 1987, 400\u2013407."},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF00244394","volume":"4","author":"M. Fitting","year":"1988","unstructured":"Fitting, M. First-order modal tableaux. J. Automated Reasoning\n4, (1988) 191\u2013213.","journal-title":"J. Automated Reasoning"},{"key":"26_CR6","unstructured":"Gabbay, D. LDS \u2014 Labeled Deductive Systems. Oxford University Press, to appear."},{"key":"26_CR7","first-page":"248","volume-title":"Lecture Notes in Computer Science","author":"R. H\u00e4hnle","year":"1990","unstructured":"H\u00e4hnle, R. Towards an efficient tableau proof procedure for multiple-valued logics. Proceedings of the Workshop on Computer Science Logic, Heidelberg, 1990. In Lecture Notes in Computer Science, Springer Verlag, Vol 533, 248\u2013260."},{"key":"26_CR8","unstructured":"H\u00e4hnle, R. Uniform notation tableau rules for multiple-valued logics. Proceedings of the International Symposium on Multiple-Valued Logic, Victoria, BC, May 26\u201329, 1991, 238\u2013245."},{"key":"26_CR9","unstructured":"Kifer, M. and Subrahmanian, V.S. On the expressive power of annotated logic programs. Proceedings of the 1989 North American conference on Logic rogramming, Cleveland, OH, 1069\u20131089."},{"key":"26_CR10","first-page":"311","volume":"74\u201376","author":"C. Morgan","year":"1976","unstructured":"Morgan, C. Resolution for many-valued logics. Logique et Analyse 74\u201376 (1976), 311\u2013339.","journal-title":"Logique et Analyse"},{"issue":"2","key":"26_CR11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/23005.23716","volume":"34","author":"N. V. Murray","year":"1987","unstructured":"Murray, N.V., and Rosenthal, E. Inference with Path Resolution and Semantic Graphs. JACM 34,2 (April 1987), 225\u2013254.","journal-title":"JACM"},{"key":"26_CR12","unstructured":"Murray, N.V., and Rosenthal, E. Dissolution: Making paths vanish. To appear, JACM."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Murray, N.V., and Rosenthal, E. Employing path dissolution to shorten tableau proofs. Proceedings of the 1989 International Symposium on Symbolic and Algebraic Computation, Portland, Oregon July 17\u201319, 1989, 373\u2013381.","DOI":"10.1145\/74540.74584"},{"key":"26_CR14","unstructured":"Murray, N.V., and Rosenthal, E. Improving tableaux proofs in multiple-valued logic. Proceedings of the 21st International Symposium on Multiple-Valued Logic, Victoria, B.C., Canada, May 26\u201329, 1991, 230\u2013237."},{"key":"26_CR15","first-page":"570","volume-title":"In Lecture Notes in Artificial Intelligence","author":"N. V. Murray","year":"1991","unstructured":"Murray, N.V., and Rosenthal, E. Resolution and path dissolution in multiple-valued logics. Proceedings of the International Symposium on Methodologies for Intelligent Systems, Charlotte, NC, October 16\u201319, 1991. In Lecture Notes in Artificial Intelligence, Springer-Verlag, Vol. 542, 570\u2013579."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"O'hearn, P., and Stachniak, Z. Note on theorem proving strategies for resolution counterparts of non-classical logics. Proceedings of the 1989 International Symposium on Symbolic and Algebraic Computation, Portland, Oregon July 17\u201319, 1989, 364\u2013372.","DOI":"10.1145\/74540.74583"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Sandewall, E. The semantics of non-monotonic entailment defined using partial interpretations. In M. Ginsburg, M. Reinfrank, and E. Sandewall, ed., Non-Monotonic Reasoning, 2\n\n nd\n \nInternational Workshop. Springer, 1988.","DOI":"10.1007\/3-540-50701-9_18"},{"key":"26_CR18","first-page":"528","volume-title":"Lecture Notes in Artificial Intelligence","author":"Schwind","year":"1990","unstructured":"Schwind. A tableau based theorem prover for a decidable subset of default logic. Proceedings of the 10\n\n th\n \nInternational Conference on Automated Deduction, Kaiserslautern, W. Germany, July 24\u201327, 1990. In Lecture Notes in Artificial Intelligence, Springer-Verlag, Vol. 449, 528\u2013542."},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Smullyan, R.M. First-Order Logic. Springer Verlag, 1968.","DOI":"10.1007\/978-3-642-86718-7"},{"key":"26_CR20","first-page":"37","volume":"2","author":"W. Sucho\u0144","year":"1974","unstructured":"Sucho\u0144, W. La m\u00e9thode de Smullyan de construire le calcul n-valent de Lukasiewicz avec implication et negation. Reports on Mathematical Logic, Universities of Cracow and Katowice, 1974, 2, 37\u201342.","journal-title":"Reports on Mathematical Logic, Universities of Cracow and Katowice"},{"key":"26_CR21","first-page":"143","volume-title":"Computer Science and Multiple-Valued Logics","author":"S. J. Surma","year":"1984","unstructured":"Surma, S.J. An algorithm for axiomatizing every finite logic. In Computer Science and Multiple-Valued Logics, David C. Rine, Ed., North-Holland, Amsterdam, 1984, 143\u2013149."},{"key":"26_CR22","first-page":"620","volume-title":"Lecture Notes in Artificial Intelligence","author":"Z. Stachniak","year":"1991","unstructured":"Stachniak, Z. Note on resolution circuits. Proceedings of the International Symposium on Methodologies for Intelligent Systems, Charlotte, NC, October 16\u201319, 1991. In Lecture Notes in Artificial Intelligence, Springer-Verlag, Vol. 542, 620\u2013629."}],"container-title":["Lecture Notes in Computer Science","Methodologies for Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56804-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:19:46Z","timestamp":1558268386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56804-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540568049","9783540477501"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-56804-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"30 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}