{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T12:10:02Z","timestamp":1749125402006,"version":"3.41.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":[[2002,5]]},"DOI":"10.1023\/a:1015849504706","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T01:08:46Z","timestamp":1041124126000},"page":"397-415","source":"Crossref","is-referenced-by-count":1,"title":["Alternative Translation Techniques for Propositional and First-Order Modal Logics"],"prefix":"10.1007","volume":"28","author":[{"given":"Angelo","family":"Montanari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Slanina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"399633_CR1","volume-title":"Non-Well-Founded Sets","author":"P. Aczel","year":"1988","unstructured":"Aczel, P.: Non-Well-Founded Sets, CSLI Lecture Notes 14, CSLI, Stanford, CA, 1988."},{"key":"399633_CR2","unstructured":"van Benthem, J.: Modal Logic and Classical Logic, Bibliopolis, Napoli, Italy, 1983."},{"issue":"2","key":"399633_CR3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1093\/logcom\/7.2.251","volume":"7","author":"J. van Benthem","year":"1997","unstructured":"van Benthem, J., D'Agostino, G., Montanari, A. and Policriti, A.: Modal deduction in second-order logic and set theory - I, J. Logic Comput.\n7(2) (1997), 251\u2013265.","journal-title":"J. Logic Comput."},{"issue":"3","key":"399633_CR4","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1023\/A:1005037512998","volume":"60","author":"J. van Benthem","year":"1998","unstructured":"van Benthem, J., D'Agostino, G., Montanari, A. and Policriti, A.: Modal deduction in second-order logic and set theory - II, Studia Logica\n60(3) (1998), 387\u2013420.","journal-title":"Studia Logica"},{"key":"399633_CR5","doi-asserted-by":"crossref","unstructured":"Blackburn, P., de Rijke, M. and Venema, Y.: Modal Logic, Cambridge Tracts in Theoret. Comput. Sci. 53, Cambridge Univ. Press, 2001.","DOI":"10.1017\/CBO9781107050884"},{"key":"399633_CR6","doi-asserted-by":"crossref","unstructured":"Bull, R. and Segerberg, K.: Basic modal logic, in (Gabbay and Guenthner, 1984), pp. 1\u201388.","DOI":"10.1007\/978-94-009-6259-0_1"},{"key":"399633_CR7","volume-title":"Set Theory for Computing. From Decision Procedures to Declarative Programming with Sets","author":"D. Cantone","year":"2001","unstructured":"Cantone, D., Omodeo, E. and Policriti, A.: Set Theory for Computing. From Decision Procedures to Declarative Programming with Sets, Monographs in Computer Science, Springer, Berlin, 2001."},{"key":"399633_CR8","doi-asserted-by":"crossref","unstructured":"Cantone, D. and Zarba, C. G.: A tableau calculus for integrating first-order and elementary set theory reasoning, in (Dyckhoff, 2000), pp. 143\u2013159.","DOI":"10.1007\/10722086_14"},{"issue":"3","key":"399633_CR9","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/BF00881803","volume":"15","author":"G. D'Agostino","year":"1995","unstructured":"D'Agostino, G., Montanari, A. and Policriti, A.: A set-theoretic translation method for polymodal logics, J. Automated Reasoning\n15(3) (1995), 314\u2013337.","journal-title":"J. Automated Reasoning"},{"key":"399633_CR10","unstructured":"D'Agostino, G., Montanari, A. and Policriti, A.: Set-theoretic decidability results for modal theorem proving, in Proceedings of ICTCS'95: 5th Italian Conference on Theoretical Computer Science, World Scientific, 1996, pp. 326\u2013342."},{"key":"399633_CR11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1093\/oso\/9780198537458.003.0002","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"M. Davis","year":"1993","unstructured":"Davis, M.: First order logic, in D. M. Gabbay, C. J. Hogger, and J. A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 1, Oxford University Press, Oxford, UK, 1993, pp. 31\u201365."},{"volume-title":"Proceedings of the International Conference on Theorem Proving with Analytic Tableaux and Related Methods","year":"2000","key":"399633_CR12","unstructured":"Dyckhoff, R. (ed.): Proceedings of the International Conference on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX), Lecture Notes in Artificial Intelligence 1847, Springer, Berlin, 2000."},{"key":"399633_CR13","first-page":"395","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"M. Fitting","year":"1993","unstructured":"Fitting, M.: Basic modal logic, in D. M. Gabbay, C. J. Hogger, and J. A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. I, Oxford University Press, Oxford, 1993, pp. 395\u2013448."},{"key":"399633_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-5292-1","volume-title":"First-Order Modal Logic","author":"M. Fitting","year":"1998","unstructured":"Fitting, M. and Mendelsohn, R. L.: First-Order Modal Logic, Synthese Library 277, Kluwer Acad. Publ., Dordrecht, The Netherlands, 1998."},{"key":"399633_CR15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0743-1066(92)90028-2","volume":"12","author":"A. Foret","year":"1992","unstructured":"Foret, A.: Rewrite rule systems for modal propositional logic, J. Logic Programming\n12 (1992), 281\u2013298.","journal-title":"J. Logic Programming"},{"volume-title":"Handbook of Philosophical Logic","year":"1984","key":"399633_CR16","unstructured":"Gabbay, D. M. and Guenthner, F. (eds.): Handbook of Philosophical Logic, Vol. II, Reidel, Dordrecht, The Netherlands, 1984."},{"key":"399633_CR17","first-page":"35","volume":"7","author":"D. M. Gabbay","year":"1992","unstructured":"Gabbay, D. M. and Ohlbach, H. J.: Quantifier elimination in second-order predicate logic, South African Computer J.\n7 (1992), 35\u201343.","journal-title":"South African Computer J."},{"key":"399633_CR18","doi-asserted-by":"crossref","unstructured":"Garson, J. W.: Quantification in modal logic, in (Gabbay and Guenthner, 1984), pp. 249\u2013307.","DOI":"10.1007\/978-94-009-6259-0_5"},{"issue":"5","key":"399633_CR19","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1093\/logcom\/7.5.649","volume":"7","author":"R. Gor\u00e9","year":"1997","unstructured":"Gor\u00e9, R., Heinle, W. and Heuerding, A.: Relations between propositional normal modal logics: An overview, J. Logic Comput.\n7(5) (1997), 649\u2013658.","journal-title":"J. Logic Comput."},{"key":"399633_CR20","unstructured":"Hsiang, J.: Topics in automated theorem proving and program generation, PhD Thesis, University of Illinois, 1982."},{"issue":"3","key":"399633_CR21","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0004-3702(85)90074-8","volume":"25","author":"J. Hsiang","year":"1985","unstructured":"Hsiang, J.: Refutational theorem proving using term-rewriting systems, J. Artificial Intelligence\n25(3) (1985), 255\u2013300.","journal-title":"J. Artificial Intelligence"},{"key":"399633_CR22","volume-title":"Lectures in Abstract Algebra","author":"N. Jacobson","year":"1951","unstructured":"Jacobson, N.: Lectures in Abstract Algebra, Vol. I, Van Nostrand, New York, 1951."},{"key":"399633_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4222-2","volume-title":"Temporal Verification of Reactive Systems: Safety","author":"Z. Manna","year":"1995","unstructured":"Manna, Z. and Pnueli, A.: Temporal Verification of Reactive Systems: Safety, Springer, New York, 1995."},{"key":"399633_CR24","unstructured":"McCune, W.: EQP 0.9c user's guide, Mathematics and Computer Science Division, Argonne National Laboratory, 1997."},{"key":"399633_CR25","unstructured":"Montanari, A. and Policriti, A.: Executing metric temporal logic, in C. Brzoska and M. Fisher (eds.), Proceedings of the IJCAI Workshop on Programming in Temporal and Non Classical Logics, Nagoya, Japan, 1997a, pp. 196\u2013201."},{"key":"399633_CR26","first-page":"196","volume-title":"Proceedings of the 15th IJCAI","author":"A. Montanari","year":"1997","unstructured":"Montanari, A. and Policriti, A.: A set-theoretic approach to automated deduction in graded modal logic, in M. E. Pollack (ed.), Proceedings of the 15th IJCAI, Morgan Kaufmann, San Francisco, 1997b, pp. 196\u2013201."},{"key":"399633_CR27","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1515\/9783112421505","volume-title":"MFCS 2000","author":"A. Montanari","year":"2000","unstructured":"Montanari, A., Policriti, A. and Slanina, M.: Derivability in locally quantified modal logics via translation in set theory, in M. Nielsen and B. Rovan (eds.), MFCS 2000, Lecture Notes in Comput. Sci. 1893, Springer, Berlin, 2000a, pp. 559\u2013568."},{"key":"399633_CR28","first-page":"547","volume-title":"Proceedings of the 7th KR","author":"A. Montanari","year":"2000","unstructured":"Montanari, A., Policriti, A. and Slanina, M.: Supporting automated deduction in first-order modal logics, in A. G. Cohn and F. Giunchiglia (eds.), Proceedings of the 7th KR, Morgan Kaufmann, San Francisco, 2000b, pp. 547\u2013556."},{"key":"399633_CR29","first-page":"80","volume-title":"Proceedings of the 13th IJCAI","author":"A. Nonnengart","year":"1993","unstructured":"Nonnengart, A.: First-order modal logic theorem proving and functional simulation, in R. Bajcsy (ed.), Proceedings of the 13th IJCAI, Morgan Kaufmann, San Francisco, 1993, pp. 80\u201385."},{"issue":"5","key":"399633_CR30","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1093\/logcom\/1.5.691","volume":"1","author":"H. J. Ohlbach","year":"1991","unstructured":"Ohlbach, H. J.: Semantic-based translation methods for modal logics, J. Logic Comput.\n1(5) (1991), 691\u2013746.","journal-title":"J. Logic Comput."},{"issue":"1","key":"399633_CR31","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1093\/jigpal\/1.1.69","volume":"1","author":"H. J. Ohlbach","year":"1993","unstructured":"Ohlbach, H. J.: Translation methods for non-classical logics - An overview, Bull. IGPL\n1(1) (1993), 69\u201389.","journal-title":"Bull. IGPL"},{"key":"399633_CR32","first-page":"205","volume-title":"Proceedings of CADE-15","author":"H. J. Ohlbach","year":"1998","unstructured":"Ohlbach, H. J.: Combining Hilbert style and semantic reasoning in a resolution framework, in C. Kirchner and H. Kirchner (eds.), Proceedings of CADE-15, Lecture Notes in Artificial Intelligence 1421, Springer, Berlin, 1998, pp. 205\u2013219."},{"key":"399633_CR33","doi-asserted-by":"crossref","unstructured":"Ohlbach, H. J., Nonnengart, A., Rijke, M. D. and Gabbay, D. M.: Encoding two-valued non-classical logics in classical logic, in A. Robinson and A. Voronkov (eds.), Handbook of Automated Reasoning, Elsevier, 2001, pp. 1403\u20131486.","DOI":"10.1016\/B978-044450813-3\/50023-0"},{"key":"399633_CR34","doi-asserted-by":"crossref","unstructured":"Piazza, C. and Policriti, A.: Towards tableau-based decision procedures for non-well-founded fragments of set theories, in (Dyckhoff, 2000), pp. 368\u2013382.","DOI":"10.1007\/10722086_29"},{"key":"399633_CR35","unstructured":"Slanina, M.: Sistemi di traduzione e implementazione per logiche modali, Technical Report 07\/01, Dipartimento di Matematica e Informatica, Universit\u00e0 di Udine, 2001 (in Italian)."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015849504706.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015849504706\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015849504706.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:34:40Z","timestamp":1749123280000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015849504706"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["399633"],"URL":"https:\/\/doi.org\/10.1023\/a:1015849504706","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"type":"print","value":"0168-7433"},{"type":"electronic","value":"1573-0670"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}