Abstract.
We introduce a new method (derived from model theoretic general combination procedures in automated deduction) for proving fusion decidability in modal systems. We apply it to show fusion decidability in case not only the boolean connectives, but also a universal modality and nominals are shared symbols.
Luigi Santocanale: The second author acknowledges financial support from the European Commission through a Marie Curie Individual Fellowship. We thank V. Goranko for suggestions on an earlier version of this paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2002)
Baader, F., Lutz, C., Sturm, H., Wolter, F.: Fusions of description logics and abstract description systems. Journal of Artificial Intelligence Research (JAIR) 16, 1–58 (2002)
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. 1249, pp. 19–33. Springer, Heidelberg (1997)
Baader, F., Tinelli, C.: Deciding the word problem in the union of equational theories. Information and Computation 178(2), 346–390 (2002)
Bull, R.A.: An approach to tense logic. Theoria 36, 282–300 (1970)
Chang, C.C., Keisler, H.J.: Model theory, 3rd edn. Studies in Logic and the Foundations of Mathematics, vol. 73. North-Holland Publishing Co., Amsterdam (1990)
Fattorosi-Barnaba, M., De Caro, F.: Graded modalities. I. Studia Logica 44(2), 197–221 (1985)
Fiorentini, C., Ghilardi, S.: Combining word problems through rewriting in categories with products. Theoretical Computer Science 294, 103–149 (2003)
Gabbay, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Many-Dimensional Modal Logics: Theory and Applications. Elsevier (2003) (in print)
Gargov, G., Goranko, V.: Modal logic with names. J. Philos. Logic 22(6), 607–636 (1993)
Ghilardi, S.: Quantifier elimination and provers integration. In: Proceedings of First Order Theorem Proving (FTP) 2003. Electronic Notes In Theoretical Computer Science (2003)
Ghilardi, S.: Reasoners’ cooperation and quantifier elimination. Technical Report 288-03, Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano (March 2003)
Ghilardi, S., Zawadowski, M.: Sheaves, Games, and Model Completions. Trends in Logic. Kluwer Academic Publishers, Dordrecht (2002)
Goranko, V., Passy, S.: Using the universal modality: gains and questions. J. Logic Comput. 2(1), 5–30 (1992)
Grätzer, G.: Universal algebra, 2nd edn. Springer, New York (1979)
Halpern, J.Y.: Reasoning about knowledge: a survey. In: Handbook of logic in artificial intelligence and logic programming. Oxford Sci. Publ., vol. 4, pp. 1–34. Oxford Univ. Press, New York (1995)
Nelson, G.: Complextity, convexity and combination of theories. Theoretical Computer Science 12, 291–302 (1980)
Nelson, G., Oppen, D.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1(2), 245–257 (1979)
Pigozzi, D.: The join of equational theories. Colloq. Math. 30, 15–25 (1974)
Prior, N.: Modality and quantification in S5. J. Symb. Logic 21, 60–62 (1956)
Robinson, A.: Complete theories, 2nd edn. North-Holland Publishing Co., Amsterdam (1977)
Santocanale, L.: Congruences of modal μ-algebras. In: Ésik, Z., Ingólfsdóttir, A. (eds.) FICS 2002, June 2002. BRICS Notes Series, vol. NS-02-02, pp. 83–87 (2002)
Santocanale, L.: On the equational definition of the least prefixed point. Theoretical Computer Science 295(1-3), 341–370 (2003)
Schild, K.: From terminological logics to modal logics, 1991. In: Proceedings of the International Workshop on Terminological Logics, DFKI-D-91-13 (1991)
Segerberg, K.: A completeness theorem in the modal logic of programs. Notices Amer. Math. Soc 24, A552 (1977); Abstract 77T-E69
Spaan, E.: Complexity of Modal Logics. PhD thesis, Department of Mathematics and Computer Science, University of Amsterdam, The Nethertlands (1993)
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. 3, pp. 103–120. Kluwer Academic Publishers, Dordrecht (1996)
Vardi, M.Y.: The taming of converse: reasoning about two-way computations. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol. 193, pp. 413–424. Springer, Heidelberg (1985)
Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 628–640. Springer, Heidelberg (1998)
Wheeler, W.H.: Model-companions and definability in existentially complete structures. Israel J. Math. 25(3-4), 305–330 (1976)
Wheeler, W.H.: A characterization of companionable, universal theories. J. Symbolic Logic 43(3), 402–429 (1978)
Wolter, F.: Fusions of modal logics revisited. In: Advances in modal logic, Berlin, vol. 1 (1996); CSLI Lecture Notes, vol. 87, pp. 361–379. CSLI Publ., Stanford, CA (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghilardi, S., Santocanale, L. (2003). Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics. In: Vardi, M.Y., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2003. Lecture Notes in Computer Science(), vol 2850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39813-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-39813-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20101-4
Online ISBN: 978-3-540-39813-4
eBook Packages: Springer Book Archive