Abstract
Propositional dynamic logic (PDL) is one of the most successful variants of modal logic. To make it even more useful for applications, many extensions of PDL have been considered in the literature. A very natural and useful such extension is with negation of programs. Unfortunately, as long-known, reasoning with the resulting logic is undecidable. In this paper, we consider the extension of PDL with negation of atomic programs, only. We argue that this logic is still useful, e.g. in the context of description logics, and prove that satisfiability is decidable and ExpTime-complete using an approach based on Büchi tree automata.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Pratt, V.: Considerations on floyd-hoare logic. In: FOCS: IEEE Symposium on Foundations of Computer Science, FOCS (1976)
Fischer, M.J., Ladner, R.E.: Propositional modal logic of programs. In: Conference record of the ninth annual ACM Symposium on Theory of Computing, pp. 286–294. ACM Press, New York (1977)
Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. Journal of Computer and System Sciences 18, 194–211 (1979)
Harel, D.: Dynamic logic. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. II, pp. 496–604. D. Reidel Publishers, Dordrechtz (1984)
Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (1995)
De Giacomo, G., Lenzerini, M.: PDL-based framework for reasoning about actions. In: Gori, M., Soda, G. (eds.) AI*IA 1995. LNCS, vol. 992, pp. 103–114. Springer, Heidelberg (1995)
Prendinger, H., Schurz, G.: Reasoning about action and change: A dynamic logic approach. Journal of Logic, Language, and Information 5, 209–245 (1996)
Giacomo, G.D., Lenzerini, M.: Boosting the correspondence between description logics and propositional dynamic logics. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 1994), vol. 1, pp. 205–212. AAAI Press, Menlo Park (1994)
Passy, S., Tinchev, T.: An essay in combinatory dynamic logic. Information and Computation 93 (1991)
Harel, D., Pratt, V.: Nondeterminism in logics of programs. In: Proceedings of the Fifth Symposium on Principles of Programming Languages, pp. 203–213. ACM, New York (1978)
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)
Danecki, S.: Nondeterministic propositional dynamic logic with intersection is decidable. In: Skowron, A. (ed.) SCT 1984. LNCS, vol. 208, pp. 34–53. Springer, Heidelberg (1985)
Broersen, J.: Relativized action complement for dynamic logics. In: Balbiani, P., Suzuki, N.-Y., Zakharyaschev, F.W., M. (eds.) Advances in Modal Logics, vol. 4, pp. 51–69. King’s College Publications (2003)
Goranko, V., Passy, S.: Using the universal modality: Gains and questions. Journal of Logic and Computation 2, 5–30 (1992)
Humberstone, I.L.: Inaccessible worlds. Notre Dame Journal of Formal Logic 24, 346–352 (1983)
Gargov, G., Passy, S., Tinchev, T.: Modal environment for Boolean speculations. In: Skordev, D. (ed.) Mathematical Logic and Applications, pp. 253–263. Plenum Press, New York (1987)
Goranko, V.: Modal definability in enriched languages. Notre Dame Journal of Formal Logic 31, 81–105 (1990)
Lutz, C., Sattler, U.: Mary likes all cats. In: Baader, F., Sattler, U. (eds.) Proceedings of the 2000 International Workshop in Description Logics (DL 2000). Number 33 in CEUR-WS, pp. 213–226 (2000), http://ceur-ws.org/
Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logic of programs. Journal of Computer and System Sciences 32, 183–221 (1986)
Lutz, C., Sattler, U.: The complexity of reasoning with boolean modal logics. In: Wolter, F., Wansing, H., de Rijke, M., Zakharyaschev, M. (eds.) Advances in Modal Logics, vol. 3, CSLI Publications, Stanford (2001)
Baader, F., McGuiness, D.L., Nardi, D., Patel-Schneider, P.: The Description Logic Handbook: Theory, implementation and applications. Cambridge University Press, Cambridge (2003)
Schild, K.D.: A correspondence theory for terminological logics: Preliminary report. In: Mylopoulos, J., Reiter, R. (eds.) Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI 1991), pp. 466–471. Morgan Kaufmann, San Francisco (1991)
Matijasevich, Y.: Simple examples of undecidable associative calculi. Soviet mathematics (Doklady), 555–557 (1967)
Kleene, S.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3–41. Princeton University Press, Princeton (1956)
Lutz, C., Walther, D.: PDL with negation of atomic programs. LTCS-Report 03-04, Technical University Dresden (2003), Available from http://lat.inf.tudresden.de/research/reports.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lutz, C., Walther, D. (2004). PDL with Negation of Atomic Programs. In: Basin, D., Rusinowitch, M. (eds) Automated Reasoning. IJCAR 2004. Lecture Notes in Computer Science(), vol 3097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25984-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-25984-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22345-0
Online ISBN: 978-3-540-25984-8
eBook Packages: Springer Book Archive