{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:12:48Z","timestamp":1759032768878,"version":"3.41.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Automated Reasoning"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1023\/a:1005784309139","type":"journal-article","created":{"date-parts":[[2002,12,21]],"date-time":"2002-12-21T23:13:52Z","timestamp":1040512432000},"page":"39-67","source":"Crossref","is-referenced-by-count":20,"title":["A Framework for Automated Reasoning in Multiple-Valued Logics"],"prefix":"10.1007","volume":"21","author":[{"given":"James J.","family":"Lu","sequence":"first","affiliation":[]},{"given":"Neil V.","family":"Murray","sequence":"additional","affiliation":[]},{"given":"Erik","family":"Rosenthal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"122673_CR1","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1145\/321592.321603","volume":"17","author":"R. Anderson","year":"1970","unstructured":"Anderson, R. and Bledsoe, W. W.: A linear format for resolution with merging and a new technique for establishing completeness, J. ACM\n17(3) (1970), 525\u2013534.","journal-title":"J. ACM"},{"issue":"4","key":"122673_CR2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1006\/jsco.1995.1021","volume":"19","author":"M. Baaz","year":"1995","unstructured":"Baaz, M. and Ferm\u00fcller, C. G.: Resolution-based theorem proving for many-valued logics, J. Symbolic Computation\n19(4) (1995), 353\u2013391.","journal-title":"J. Symbolic Computation"},{"key":"122673_CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(89)90126-6","volume":"68","author":"H. A. Blair","year":"1989","unstructured":"Blair, H. A. and Subrahmanian, V. S.: Paraconsistent logic programming, Theoretical Computer Science\n68 (1989), 135\u2013154.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"122673_CR4","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, J. Symbolic Logic\n52(2) (1987), 473\u2013493.","journal-title":"J. Symbolic Logic"},{"key":"122673_CR5","unstructured":"Davey, B. A. and Priestley, H. A.: Introduction to Lattices and Order, Cambridge University Press, 1990."},{"key":"122673_CR6","unstructured":"Doherty, P.: NML3 - A Non-Monotonic Formalism with Explicit Defaults. Link\u00f6ping Studies in Science and Technology. Dissertations No. 258. Department of Computer and Information Science, Link\u00f6ping University, 1991."},{"key":"122673_CR7","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":"122673_CR8","doi-asserted-by":"crossref","unstructured":"H\u00e4hnle, R.: Towards an efficient tableau proof procedure for multiple-valued logics, Proc. of the Workshop on Computer Science Logic pp. 248\u2013260, Lecture Notes in Computer Science Vol. 533, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-54487-9_62"},{"key":"122673_CR9","unstructured":"H\u00e4hnle, R.: Uniform notation tableau rules for multiple-valued Logics, Proc. Int. Symposium on Multiple-Valued Logic, IEEE Computer Society Press, 1991, pp. 26\u201329."},{"key":"122673_CR10","doi-asserted-by":"crossref","unstructured":"H\u00e4hnle, R.: Automated Deduction in Multiple-Valued Logics, International Series of Monographs on Computer Science Vol. 10, Oxford University Press, 1994.","DOI":"10.1093\/oso\/9780198539896.001.0001"},{"issue":"6","key":"122673_CR11","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1093\/logcom\/4.6.905","volume":"4","author":"R. H\u00e4hnle","year":"1994","unstructured":"H\u00e4hnle, R.: Short conjunctive normal forms in finitely-valued logics, J. Logic and Computation\n4(6) (1994), 905\u2013927.","journal-title":"J. Logic and Computation"},{"key":"122673_CR12","unstructured":"H\u00e4hnle, R.: Tableaux methods for many-valued logics, Handbook of Tableau Methods, M. d'Agostino, D. Gabbay, R. H\u00e4hnle and J. Posegga (eds), Kluwer, to appear."},{"issue":"1","key":"122673_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1080\/11663081.1996.10510866","volume":"6","author":"R. H\u00e4hnle","year":"1996","unstructured":"H\u00e4hnle, R.: Exploiting data dependencies in many-valued logics, J. Applied Non-Classical Logics\n6(1) (1996), 49\u201369.","journal-title":"J. Applied Non-Classical Logics"},{"key":"122673_CR14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF00245460","volume":"9","author":"M. Kifer","year":"1992","unstructured":"Kifer, M. and Lozinskii, E.: A logic for reasoning with inconsistency, J. Automated Reasoning\n9 (1992), 179\u2013215.","journal-title":"J. Automated Reasoning"},{"key":"122673_CR15","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0743-1066(92)90007-P","volume":"12","author":"M. Kifer","year":"1992","unstructured":"Kifer, M. and Subrahmanian, V. S.: Theory of generalized annotated logic programming and its applications, J. Logic Programming\n12 (1992), 335\u2013367.","journal-title":"J. Logic Programming"},{"key":"122673_CR16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF00712385","volume":"6","author":"S. M. Leach","year":"1996","unstructured":"Leach, S. M. and Lu, J. J.: Query processing in annotated logic programming: theory and implementation, J. Intelligent Information Systems\n6 (1996), 33\u201358.","journal-title":"J. Intelligent Information Systems"},{"key":"122673_CR17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/321679.321688","volume":"19","author":"R. Lee","year":"1972","unstructured":"Lee, R.: Fuzzy logic and the resolution principle, J. ACM\n19 (1972), 109\u2013119.","journal-title":"J. ACM"},{"key":"122673_CR18","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0020-0255(91)90033-Q","volume":"56","author":"X. H. Liu","year":"1991","unstructured":"Liu, X. H., Tsai, J. P. and Weigert, T.: \u039b-resolution and the interpretation of \u039b-implication in Fuzzy Operator Logic, Information Science\n56 (1991), 259\u2013278.","journal-title":"Information Science"},{"issue":"6","key":"122673_CR19","first-page":"775","volume":"6","author":"J. J. Lu","year":"1996","unstructured":"Lu, J. J.: Logic programming with signs and annotations, J. Logic and Computation\n6(6) (1996), 775\u2013778.","journal-title":"J. Logic and Computation"},{"key":"122673_CR20","doi-asserted-by":"crossref","unstructured":"Lu, J. J., Henschen, L. J., Subrahmanian, V. S. and da Costa, N. C. A.: Reasoning in paraconsistent logics, Automated Reasoning: Essays in Honor of Woody Bledsoe, R. Boyer (ed.), Kluwer, 1991, pp. 181\u2013210.","DOI":"10.1007\/978-94-011-3488-0_9"},{"key":"122673_CR21","doi-asserted-by":"crossref","unstructured":"Lu, J. J., Murray, N. V. and Rosenthal, E.: Signed formulas and annotated logics, Proc. Int. Symposium on Multiple-Valued Logic, Computer Society Press, 1993, pp. 48\u201353.","DOI":"10.1109\/ISMVL.1993.289582"},{"key":"122673_CR22","doi-asserted-by":"crossref","unstructured":"Lu, J. J., Murray, N. V. and Rosenthal, E.: Signed formulas and fuzzy operator logics, Proc. Int. Symposium on Methodologies for Intelligent Systems, Z. R\u00e1s and M. Zemankova (eds), pp. 75\u201384, Lecture Notes in Computer Science Vol. 864, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58495-1_8"},{"key":"122673_CR23","doi-asserted-by":"crossref","unstructured":"Lu, J. J. and Rosenthal, E.: Annotations, signs, and generally paraconsistent logics, Intelligent Systems, E. A. Yfantis (ed.), Kluwer, 1995, pp. 143\u2013157.","DOI":"10.1007\/978-94-011-7108-3_16"},{"key":"122673_CR24","unstructured":"Messing, B.: Knowledge representation and processing in many-valued logics, Bericht 320, Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren, Universit\u00e4t Karlsruhe."},{"key":"122673_CR25","doi-asserted-by":"crossref","first-page":"12","DOI":"10.4064\/fm-44-1-12-36","volume":"44","author":"A. Mostowski","year":"1957","unstructured":"Mostowski, A.: On a generalization of quantifiers, Fundamenta Mathematic\u00e6\n44 (1957), 12\u201336.","journal-title":"Fundamenta Mathematic\u00e6"},{"key":"122673_CR26","first-page":"224","volume-title":"Fuzzy Set and Possibility Theory","author":"M. Mukaidono","year":"1982","unstructured":"Mukaidono, M.: Fuzzy inference of resolution style, Fuzzy Set and Possibility Theory, R. Yager (ed.), Pergamon, New York, 1982, pp. 224\u2013231."},{"key":"122673_CR27","doi-asserted-by":"crossref","unstructured":"Murray, N. V. and Rosenthal, E.: Resolution and path dissolution in multiple-valued logics, Proc. Int. Symposium on Methodologies for Intelligent Systems, Z. R\u00e1s and M. Zemankova (eds), pp. 570\u2013579, Lecture Notes in Computer Science Vol. 542, Springer-Verlag, 1991.","DOI":"10.1007\/3-540-54563-8_120"},{"key":"122673_CR28","doi-asserted-by":"crossref","unstructured":"Murray, N. V. and Rosenthal, E.: Improving tableaux proofs in multiple-valued logic, Proc. International Symposium on Multiple-Valued Logic, IEEE Computer Society Press, 1991, pp. 230\u2013237.","DOI":"10.1109\/ISMVL.1991.130735"},{"key":"122673_CR29","doi-asserted-by":"crossref","first-page":"237","DOI":"10.3233\/FI-1994-2135","volume":"21","author":"N. V. Murray","year":"1994","unstructured":"Murray, N. V. and Rosenthal, E.: Adapting classical inference techniques to multiple-valued logics using signed formulas, Fundamenta Informaticae\n21 (1994), 237\u2013253.","journal-title":"Fundamenta Informaticae"},{"key":"122673_CR30","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF00881836","volume":"10","author":"R. Ng","year":"1993","unstructured":"Ng, R. and Subrahmanian, V. S.: A semantical framework for supporting subjective and conditional probabilities in deductive databases, J. Automated Reasoning\n10 (1993), 191\u2013235.","journal-title":"J. Automated Reasoning"},{"key":"122673_CR31","doi-asserted-by":"crossref","unstructured":"Ramesh, A. and Murray, N. V.: Computing prime implicants\/implicates for regular logics, Proc. International Symposium on Multiple-Valued Logics, IEEE Computer Society Press, 1994, pp. 115\u2013123.","DOI":"10.1109\/ISMVL.1994.302213"},{"key":"122673_CR32","unstructured":"Sandewall, E.: The semantics of non-monotonic entailment defined using partial interpretations, Non-Monotonic Reasoning, 2nd International Workshop, M. Ginsberg, M. Reinfrank and E. Sandewall (eds), pp. 570\u2013579, Lecture Notes in Computer Science Vol. 346, Springer-Verlag, 1988."},{"key":"122673_CR33","unstructured":"Subrahmanian, V. S.: On the semantics of quantitative logic programs, Proc. of the Symposium on Logic Programming, IEEE Computer Society Press, 1987, pp. 173\u2013182."},{"key":"122673_CR34","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0304-3975(92)90214-Z","volume":"93","author":"V. S. Subrahmanian","year":"1992","unstructured":"Subrahmanian, V. S.: Paraconsistent disjunctive databases, Theoretical Computer Science\n93 (1992), 115\u2013141.","journal-title":"Theoretical Computer Science"},{"key":"122673_CR35","first-page":"37","volume":"2","author":"W. Such\u00f3n","year":"1974","unstructured":"Such\u00f3n, W.: La m\u00e9thode de Smullyan de construire le calcul n-valent de Lukasiewicz avec implication et n\u00e9gation. Reports on Mathematical Logic, Universities of Cracow and Katowice 2 (1974), 37\u201342.","journal-title":"La m\u00e9thode de Smullyan de construire le calcul n-valent de Lukasiewicz avec implication et n\u00e9gation"},{"key":"122673_CR36","unstructured":"Surma, S. J.: An algorithm for axiomatizing every finite logic, Computer Science and Multiple-Valued Logics, David C. Rine (ed.), North-Holland, 1984, pp. 143\u2013149."},{"key":"122673_CR37","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF00881864","volume":"10","author":"T. J. Weigert","year":"1993","unstructured":"Weigert, T. J., Tsai, J. P. and Liu, X. H.: Fuzzy operator logic and fuzzy resolution, J. Automated Reasoning\n10 (1993), 59\u201378.","journal-title":"J. Automated Reasoning"},{"key":"122673_CR38","unstructured":"Zach, R.: Proof Theory of Finite-valued Logics, M. Phil. thesis, Institut f\u00fcr Algebra und diskrete Mathematik, TU Wien. Available as Technical Report TUW-E185.2\u2013Z.1\u201393."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1005784309139.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1005784309139\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1005784309139.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:34:37Z","timestamp":1749123277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1005784309139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["122673"],"URL":"https:\/\/doi.org\/10.1023\/a:1005784309139","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"type":"print","value":"0168-7433"},{"type":"electronic","value":"1573-0670"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}