Abstract
The propositional dynamic logic PDL is one of the most successful variants of modal logic; it plays an important role in many fields of computer science and artificial intelligence. As a logical basis for the W3C-recommended Web ontology language OWL, description logic provides considerable expressive power going far beyond propositional logic as while as the reasoning is still decidable. In this paper, we bring the power and character of description logic into PDL and present a dynamic logic ALC-DL for the semantic Web. The logic ALC-DL inherits the knowledge representation ability of both the description logic ALC and the logic PDL. With an approach based on Buchi tree automaton, we prove that the satisfiability problem of ALC-DL formulas is still decidable and is EXPTIME-complete. The logic ALC-DL is suitable for modeling and reasoning about dynamic knowledge in the semantic Web environment.
Chapter PDF
Similar content being viewed by others
References
Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)
Giacomo, G.D., Massacci, F.: Combining deduction and model checking into tableaux and algorithms for Converse-PDL. Information and Computation 162(1-2), 117–137 (2000)
Lutz, C., Walther, D.: PDL with negation of atomic programs. Journal of Applied Non-Classical Logic 15(2), 189–214 (2005)
Göller, S., Lohrey, M., Lutz, C.: PDL with intersection and converse is 2EXP-complete. In: Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures, pp. 198–212. Springer, Berlin (2007)
Baader, F., Ghilardi, S., Lutz, C.: LTL over description logic axioms. In: Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, pp. 684–694. AAAI Press, Cambridge (2008)
Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences 32(2), 183–221 (1986)
Hromkovic, J., Seibert, S., Wilke, T.: Translating regular expressions into small ε-free nondeterministic finite automata. In: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, pp. 55–66. Springer, Belin (1997)
Shi, Z.Z., Dong, M.K., Jiang, Y.C., Zhang, H.J.: A logical foundation for the semantic Web. Science in China, Ser. F: Information Sciences 48(2), 161–178 (2005)
Chang, L., Shi, Z.Z., Gu, T.L., Zhao, L.Z.: A family of dynamic description logics for representing and reasoning about actions. Journal of Automated Reasoning 49(1), 19–70 (2012)
Baader, F., Bauer, A., Lippmann, M.: Runtime Verification Using a Temporal Description Logic. In: Ghilardi, S., Sebastiani, R. (eds.) FroCoS 2009. LNCS, vol. 5749, pp. 149–164. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Chang, L., Zhang, Q., Gu, T., Shi, Z. (2012). Dynamic Logic for the Semantic Web. In: Shi, Z., Leake, D., Vadera, S. (eds) Intelligent Information Processing VI. IIP 2012. IFIP Advances in Information and Communication Technology, vol 385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32891-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-32891-6_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32890-9
Online ISBN: 978-3-642-32891-6
eBook Packages: Computer ScienceComputer Science (R0)