{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T20:46:29Z","timestamp":1769978789759,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540201014","type":"print"},{"value":"9783540398134","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39813-4_10","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T19:27:49Z","timestamp":1277839669000},"page":"152-166","source":"Crossref","is-referenced-by-count":6,"title":["Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics"],"prefix":"10.1007","author":[{"given":"Silvio","family":"Ghilardi","sequence":"first","affiliation":[]},{"given":"Luigi","family":"Santocanale","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"The Description Logic Handbook","year":"2002","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2002)"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.919","volume":"16","author":"F. Baader","year":"2002","unstructured":"Baader, F., Lutz, C., Sturm, H., Wolter, F.: Fusions of description logics and abstract description systems. Journal of Artificial Intelligence Research (JAIR)\u00a016, 1\u201358 (2002)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-63104-6_3","volume-title":"Automated Deduction - CADE-14","author":"F. Baader","year":"1997","unstructured":"Baader, F., Tinelli, C.: A new approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method. In: McCune, W. (ed.) CADE 1997. LNCS, vol.\u00a01249, pp. 19\u201333. Springer, Heidelberg (1997)"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/inco.2001.3118","volume":"178","author":"F. Baader","year":"2002","unstructured":"Baader, F., Tinelli, C.: Deciding the word problem in the union of equational theories. Information and Computation\u00a0178(2), 346\u2013390 (2002)","journal-title":"Information and Computation"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1111\/j.1755-2567.1970.tb00428.x","volume":"36","author":"R.A. Bull","year":"1970","unstructured":"Bull, R.A.: An approach to tense logic. Theoria\u00a036, 282\u2013300 (1970)","journal-title":"Theoria"},{"key":"10_CR6","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Model theory","author":"C.C. Chang","year":"1990","unstructured":"Chang, C.C., Keisler, H.J.: Model theory, 3rd edn. Studies in Logic and the Foundations of Mathematics, vol.\u00a073. North-Holland Publishing Co., Amsterdam (1990)","edition":"3"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF00379767","volume":"44","author":"M. Fattorosi-Barnaba","year":"1985","unstructured":"Fattorosi-Barnaba, M., De Caro, F.: Graded modalities. I. Studia Logica\u00a044(2), 197\u2013221 (1985)","journal-title":"I. Studia Logica"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0304-3975(01)00248-1","volume":"294","author":"C. Fiorentini","year":"2003","unstructured":"Fiorentini, C., Ghilardi, S.: Combining word problems through rewriting in categories with products. Theoretical Computer Science\u00a0294, 103\u2013149 (2003)","journal-title":"Theoretical Computer Science"},{"key":"10_CR9","unstructured":"Gabbay, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Many-Dimensional Modal Logics: Theory and Applications. Elsevier (2003) (in print)"},{"issue":"6","key":"10_CR10","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/BF01054038","volume":"22","author":"G. Gargov","year":"1993","unstructured":"Gargov, G., Goranko, V.: Modal logic with names. J. Philos. Logic\u00a022(6), 607\u2013636 (1993)","journal-title":"J. Philos. Logic"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Ghilardi, S.: Quantifier elimination and provers integration. In: Proceedings of First Order Theorem Proving (FTP) 2003. Electronic Notes In Theoretical Computer Science (2003)","DOI":"10.1016\/S1571-0661(04)80650-9"},{"key":"10_CR12","unstructured":"Ghilardi, S.: Reasoners\u2019 cooperation and quantifier elimination. Technical Report 288-03, Dipartimento di Scienze dell\u2019Informazione, Universit\u00e0 degli Studi di Milano (March 2003)"},{"key":"10_CR13","series-title":"Trends in Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-9936-8","volume-title":"Sheaves, Games, and Model Completions","author":"S. Ghilardi","year":"2002","unstructured":"Ghilardi, S., Zawadowski, M.: Sheaves, Games, and Model Completions. Trends in Logic. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/logcom\/2.1.5","volume":"2","author":"V. Goranko","year":"1992","unstructured":"Goranko, V., Passy, S.: Using the universal modality: gains and questions. J. Logic Comput.\u00a02(1), 5\u201330 (1992)","journal-title":"J. Logic Comput."},{"key":"10_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77487-9","volume-title":"Universal algebra","author":"G. Gr\u00e4tzer","year":"1979","unstructured":"Gr\u00e4tzer, G.: Universal algebra, 2nd edn. Springer, New York (1979)","edition":"2"},{"key":"10_CR16","series-title":"Oxford Sci. Publ.","first-page":"1","volume-title":"Handbook of logic in artificial intelligence and logic programming","author":"J.Y. Halpern","year":"1995","unstructured":"Halpern, J.Y.: Reasoning about knowledge: a survey. In: Handbook of logic in artificial intelligence and logic programming. Oxford Sci. Publ., vol.\u00a04, pp. 1\u201334. Oxford Univ. Press, New York (1995)"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(80)90059-6","volume":"12","author":"G. Nelson","year":"1980","unstructured":"Nelson, G.: Complextity, convexity and combination of theories. Theoretical Computer Science\u00a012, 291\u2013302 (1980)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/357073.357079","volume":"1","author":"G. Nelson","year":"1979","unstructured":"Nelson, G., Oppen, D.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems\u00a01(2), 245\u2013257 (1979)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR19","doi-asserted-by":"crossref","first-page":"15","DOI":"10.4064\/cm-30-1-15-25","volume":"30","author":"D. Pigozzi","year":"1974","unstructured":"Pigozzi, D.: The join of equational theories. Colloq. Math.\u00a030, 15\u201325 (1974)","journal-title":"Colloq. Math."},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"60","DOI":"10.2307\/2268488","volume":"21","author":"N. Prior","year":"1956","unstructured":"Prior, N.: Modality and quantification in S5. J. Symb. Logic\u00a021, 60\u201362 (1956)","journal-title":"J. Symb. Logic"},{"key":"10_CR21","volume-title":"Complete theories","author":"A. Robinson","year":"1977","unstructured":"Robinson, A.: Complete theories, 2nd edn. North-Holland Publishing Co., Amsterdam (1977)","edition":"2"},{"key":"10_CR22","unstructured":"Santocanale, L.: Congruences of modal \u03bc-algebras. In: \u00c9sik, Z., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FICS 2002, June 2002. BRICS Notes Series, vol.\u00a0NS-02-02, pp. 83\u201387 (2002)"},{"issue":"1-3","key":"10_CR23","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0304-3975(02)00412-7","volume":"295","author":"L. Santocanale","year":"2003","unstructured":"Santocanale, L.: On the equational definition of the least prefixed point. Theoretical Computer Science\u00a0295(1-3), 341\u2013370 (2003)","journal-title":"Theoretical Computer Science"},{"key":"10_CR24","unstructured":"Schild, K.: From terminological logics to modal logics, 1991. In: Proceedings of the International Workshop on Terminological Logics, DFKI-D-91-13 (1991)"},{"key":"10_CR25","first-page":"552","volume":"24","author":"K. Segerberg","year":"1977","unstructured":"Segerberg, K.: A completeness theorem in the modal logic of programs. Notices Amer. Math. Soc\u00a024, A552 (1977); Abstract 77T-E69","journal-title":"Notices Amer. Math. Soc"},{"key":"10_CR26","unstructured":"Spaan, E.: Complexity of Modal Logics. PhD thesis, Department of Mathematics and Computer Science, University of Amsterdam, The Nethertlands (1993)"},{"key":"10_CR27","series-title":"Applied Logic Series","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-94-009-0349-4_5","volume-title":"Frontiers of Combining Systems, FROCOS 1996","author":"C. Tinelli","year":"1996","unstructured":"Tinelli, C., Harandi, M.: A new correctness proof of the Nelson-Oppen combination procedure. In: Baader, F., Schulz, K. (eds.) Frontiers of Combining Systems, FROCOS 1996. Applied Logic Series, vol.\u00a03, pp. 103\u2013120. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/3-540-15648-8_31","volume-title":"Logics of Programs","author":"M.Y. Vardi","year":"1985","unstructured":"Vardi, M.Y.: The taming of converse: reasoning about two-way computations. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol.\u00a0193, pp. 413\u2013424. Springer, Heidelberg (1985)"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/BFb0055090","volume-title":"Automata, Languages and Programming","author":"M.Y. Vardi","year":"1998","unstructured":"Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 628\u2013640. Springer, Heidelberg (1998)"},{"issue":"3-4","key":"10_CR30","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF02757007","volume":"25","author":"W.H. Wheeler","year":"1976","unstructured":"Wheeler, W.H.: Model-companions and definability in existentially complete structures. Israel J. Math.\u00a025(3-4), 305\u2013330 (1976)","journal-title":"Israel J. Math."},{"issue":"3","key":"10_CR31","doi-asserted-by":"publisher","first-page":"402","DOI":"10.2307\/2273518","volume":"43","author":"W.H. Wheeler","year":"1978","unstructured":"Wheeler, W.H.: A characterization of companionable, universal theories. J. Symbolic Logic\u00a043(3), 402\u2013429 (1978)","journal-title":"J. Symbolic Logic"},{"key":"#cr-split#-10_CR32.1","unstructured":"Wolter, F.: Fusions of modal logics revisited. In: Advances in modal logic, Berlin, vol.??1 (1996);"},{"key":"#cr-split#-10_CR32.2","unstructured":"CSLI Lecture Notes, vol. 87, pp. 361???379. CSLI Publ., Stanford, CA (1998)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39813-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T20:03:22Z","timestamp":1685649802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39813-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201014","9783540398134"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39813-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}