{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T22:21:53Z","timestamp":1649110913158},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1007\/bf01880323","type":"journal-article","created":{"date-parts":[[2005,7,4]],"date-time":"2005-07-04T18:23:23Z","timestamp":1120501403000},"page":"447-451","source":"Crossref","is-referenced-by-count":0,"title":["Automated reasoning and nonclassical logics: Introduction"],"prefix":"10.1007","volume":"7","author":[{"given":"Michael A.","family":"McRobbie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01880323_CR1","volume-title":"Entailment: The Logic of Relevance and Necessity","author":"A. R. Anderson","year":"1975","unstructured":"Anderson A. R. and Belnap N. D.Jr.,Entailment: The Logic of Relevance and Necessity, Vol. 1, Princeton UP, Princeton, New Jersey (1975)."},{"key":"BF01880323_CR2","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., \u2018Linear logic\u2019,Theoret. Comput. Sci.,50, 1\u2013102 (1987).","journal-title":"Theoret. Comput. Sci."},{"key":"BF01880323_CR3","volume-title":"The Development of Logic","author":"W. Kneale","year":"1962","unstructured":"Kneale W. and Kneale M.,The Development of Logic, OUP, London, 1962."},{"key":"BF01880323_CR4","doi-asserted-by":"crossref","unstructured":"Lusk, E. L., McCune, W. W., and Slaney, J. K., \u2018ROO \u2014 a parallel theorem prover\u2018, inInformal Proc. of the Internat. Workshop onParallel Processing for AI in Conjunction with IJCAI-91 (eds. L. N. Kanal and C. B. Suttner), Sydney, Australia, pp. 110\u2013116 (dy1991).","DOI":"10.2172\/5796402"},{"key":"BF01880323_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BFb0012833","volume-title":"Proc. 9th Internat. Conf. Automated Deduction","author":"M. A. McRobbie","year":"1988","unstructured":"McRobbie M. A., Meyer R. K., and Thistlewaite P. B., \u2018Towards efficient knowledge-based automated theorem proving for non-standard logics\u2019, inProc. 9th Internat. Conf. Automated Deduction (eds. E.Lusk and R.Overbeek), Lecture Notes in Computer Science, Vol. 310, Springer, Berlin, pp. 197\u2013217 (1988)."},{"key":"BF01880323_CR6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1002\/malq.19700160703","volume":"16","author":"R. K. Meyer","year":"1970","unstructured":"Meyer R. K., \u2018RI \u2014 The bounds of finitude\u2019,Z. Math. Logik Grundlag. Math. 16, 385\u2013387 (1970).","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"BF01880323_CR7","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1109\/TC.1976.1674704","volume":"25","author":"C. Morgan","year":"1976","unstructured":"Morgan C., \u2018Methods for automated theorem proving in nonclassical logics\u2019,IEEE Trans. Comput.,C-25, 852\u2013862 (1976).","journal-title":"IEEE Trans. Comput."},{"key":"BF01880323_CR8","series-title":"SEKI Report SR-88-08","volume-title":"Resolution calculus for modal logics","author":"H.-J. Ohlbach","year":"1988","unstructured":"Ohlbach H.-J., \u2018Resolution calculus for modal logics\u2019, SEKI Report SR-88-08, Artificial Intelligence Laboratories, Fachbereich Informatik, Universitaet Kaiserslautern, Germany (1988)."},{"key":"BF01880323_CR9","doi-asserted-by":"crossref","first-page":"487","DOI":"10.2307\/2274237","volume":"50","author":"J. K. Slaney","year":"1984","unstructured":"Slaney J. K., \u20183088 varieties: A solution to the Ackermann constant problem\u2019,J. Symbolic Logic 50, 487\u2013501 (1984).","journal-title":"J. Symbolic Logic"},{"key":"BF01880323_CR10","volume-title":"Automated Theorem-Proving in Non-Classical Logics","author":"P. B. Thistlewaite","year":"1988","unstructured":"Thistlewaite P. B., McRobbie M. A., and Meyer R. K.,Automated Theorem-Proving in Non-Classical Logics, Pitman, London, and Wiley, New York (1988)."},{"key":"BF01880323_CR11","volume-title":"IJCAI 87: Proc. Tenth Internat. Joint Conf. Artificial Intelligence","author":"L. A. Wallen","year":"1987","unstructured":"Wallen L. A., \u2018Matrix proof methods for modal logics\u2019,IJCAI 87: Proc. Tenth Internat. Joint Conf. Artificial Intelligence, Vols. 1 and 2, Morgan Kaufmann, Los Altos (1987)."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01880323.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01880323\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01880323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T04:03:15Z","timestamp":1586318595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01880323"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["BF01880323"],"URL":"https:\/\/doi.org\/10.1007\/bf01880323","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}