{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:40:40Z","timestamp":1725496840674},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665366"},{"type":"electronic","value":"9783540481683"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48168-0_20","type":"book-chapter","created":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T11:30:26Z","timestamp":1196508626000},"page":"277-291","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Resolution Method for Modal Logic with Well-Founded Frames"],"prefix":"10.1007","author":[{"given":"Shigeki","family":"Hagihara","sequence":"first","affiliation":[]},{"given":"Naoki","family":"Yonezaki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-2794-5","volume-title":"Proof Methods for Modal and Intutionistic Logics","author":"M. C. Fitting","year":"1983","unstructured":"Melvin C. Fitting. Proof Methods for Modal and Intutionistic Logics. Reidel, Dordrecht, 1983."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0743-1066(92)90028-2","volume":"12","author":"A. Foret","year":"1992","unstructured":"Annie Foret. Rewrite rule systems for modal propositional logic. The Journal of Logic Programming, 12:281\u2013298, 1992.","journal-title":"The Journal of Logic Programming"},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF00881803","volume":"15","author":"G. DAgostino","year":"1995","unstructured":"G. D\u2019Agostino, A. Montanari, and A. Policriti. A set-theoretic translation method for polymodal logics. Journal of Automated Reasoning, 15(3):317\u2013337, 1995.","journal-title":"Journal of Automated Reasoning"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"G.E. Hughes and M.J. Cresswell. A New Inroduction to Modal Logic. Routledge, 1996.","DOI":"10.4324\/9780203290644"},{"key":"20_CR5","unstructured":"Rajeev Gor\u00e9. Technical report tr-arp-15-95. Technical report, Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University, \nhttp:\/\/arp.anu.edu.au\/\n\n, 1995."},{"key":"20_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1007\/BFb0012852","volume-title":"CADE-9","author":"H.J. Ohlbach","year":"1988","unstructured":"H.J. Ohlbach. A resolution calculus for modal logics. In CADE-9, volume 310 of Lecture Notes in Computer Science, pages 500\u2013516. Springer, 1988."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"H.J. Ohlbach. Combining hilbert style and semantic reasoning in a resolution framework. In Automated Deduction, CADE-15, volume 1421 of LNAI, pages 205\u2013219, 1998.","DOI":"10.1007\/BFb0054261"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Andreas Nonnengart. Resolution-based calculi for modal and temporal logics. In Automated Deduction-CADE-13, volume 1104 of Lecture Notes in Artificial Intelligence, pages 598\u2013612. Springer, 1996.","DOI":"10.1007\/3-540-61511-3_116"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Jens Otten and Christoph Kreitz. T-string unification: Unifying prefixes in non-classical proof methods. In Theorem Proving with Analytic Tableaux and Related Methods, volume 1071 of Lecture Notes in Artificial Intelligence, pages 244\u2013260. Springer, 1996.","DOI":"10.1007\/3-540-61208-4_16"},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(89)90137-0","volume":"65","author":"P. Enjalbert","year":"1989","unstructured":"P. Enjalbert and L.Farinas del Cerro. Modal resolution in clausal form. Theoretical Computer Science, 65(1):1\u201333, 1989.","journal-title":"Theoretical Computer Science"},{"key":"20_CR11","unstructured":"Lincoln A. Wallen. Automated proof search in non-classical logics. MIT Press, 1990."},{"key":"20_CR12","unstructured":"Naoki Yonezaki and Takashi Hayama. Self-substitution in modal unification. In Information Modeling and Knowledge Bases IV, pages 180\u2013195. IOS Press, 1993."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48168-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T04:08:56Z","timestamp":1586146136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48168-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665366","9783540481683"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48168-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"13 May 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}