PDL with negation of atomic programs

Journal of Applied Non-Classical Logics

Volumn 15, Issue 2, 2005, Pages 189-213

  Lutz, Carsten ^a   Walther, Dirk ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Complexity; Program negation; Propositional dynamic logic

Indexed keywords

EID: 32244443778     PISSN: 11663081     EISSN: 19585780     Source Type: Journal    
DOI: 10.3166/jancl.15.189-213     Document Type: Article

References (28)

1. ANDREKA H., NEMETI I., SAIN I., "Handbook of Philosophical Logic", vol. 2, chapter Algebraic Logic, p. 133-247, Kluwer Academic Publishers, second edition, 2001.
2. BAADER F., MCGUINESS D. L., NARDI D., PATEL-SCHNEIDER P., The Description Logic Handbook: Theory, implementation and applications, Cambridge University Press, 2003.
3. BROERSEN J., "Relativized Action Complement for Dynamic Logics", BALBIANI P., SUZUKI N.-Y., WOLTER F., ZAKHARYASCHEV M., Eds., Advances in Modal Logics Volume 4, King's College Publications, 2003, p. 51-69.
4. DANECKI S., "Nondeterministic Propositional Dynamic Logic with intersection is decidable", SKOWRON A., Ed., Proceedings of the Fifth Symposium on Computation Theory, vol. 208 of LNCS, Springer, 1984, p. 34-53.
5. EHRENFEUCHT A., ZEIGER P., "Complexity measures for regular expressions", Sixth annual ACM Symposium on Theory of Computing, New York, USA, 1974, ACM Press, p. 75-79.
6. FAGIN R., HALPERN J. Y., MOSES Y., VARDI M. Y., Reasoning About Knowledge, MIT Press, 1995.
7. FISCHER M. J., LADNER R. E., "Propositional modal logic of programs", Conference record of the ninth annual ACM Symposium on Theory of Computing, ACM Press, 1977, p. 286-294.
8. FISCHER M. J., LADNER R. E., "Propositional Dynamic Logic of Regular Programs", JCSS, vol. 18, 1979, p. 194-211.
9. GARGOV G., PASSY S., TINCHEV T., "Modal Environment for Boolean Speculations", SKORDEV D., Ed., Mathematical Logic and Applications, New York, USA, 1987, Plenum Press, p. 253-263.
10. DE GIACOMO G., LENZERINI M., "Boosting the Correspondence between Description Logics and Propositional Dynamic Logics", Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI'94). Volume 1, AAAI Press, 1994, p. 205-212.
11. DE GIACOMO G., LENZERINI M., "PDL-based Framework for Reasoning about Actions", Proceedings of the 4th Congress of the Italian Association for Artificial Intelligence (AI, IA'95), vol. 992, Springer, 1995, p. 103-114.
12. GORANKO V., "Modal Definability in Enriched Languages", Notre Dame Journal of Formal Logic, vol. 31, num. 1, 1990, p. 81-105.
13. GORANKO V., PASSY S., "Using the Universal Modality: Gains and Questions", Journal of Logic and Computation, vol. 2, num. 1, 1992, p. 5-30.
14. HAREL D., PRATT V., "Nondeterminism in logics of programs", Proceedings of the Fifth Symposium on Principles of Programming Languages, ACM, 1978, p. 203-213.
15. HAREL D., "Dynamic Logic", GABBAY D. M., GUENTHNER F., Eds., Handbook of Philosophical Logic, Volume II, p. 496-604, D. Reidel Publishers, 1984.
16. HAREL D., KOZEN D., TIURYN J., Dynamic Logic, MIT Press, 2000.
17. HUMBERSTONE I. L., "Inaccessible Worlds", Notre Dame Journal of Formal Logic, vol. 24, num. 3, 1983, p. 346-352.
18. KLEENE S., "Representation of events in nerve nets and finite automata", C.E.SHANNON, J.MCCARTHY, Eds., Automata Studies, p. 3-41, Princeton University Press, 1956
19. LUTZ C., SATTLER U., "Mary likes all Cats", BAADER F., SATTLER U., Eds., Proceedings of the 2000 International Workshop in Description Logics (DL2000), num. 33 CEUR-WS (http://ceur-ws.org/), 2000, p. 213-226.
20. LUTZ C., SATTLER U., "The Complexity of Reasoning with Boolean Modal Logics", WOLTER F., WANSING H., DE RIJKE M., ZAKHARYASCHEV M., Eds., Advances in Modal Logics Volume 3, CSLI Publications, Stanford, CA, USA, 2001.
21. LUTZ C., WALTHER D., "PDL with Negation of Atomic Programs", Proceedings of the Second International Joint Conference on Automated Reasoning (IJCAR'04), Lecture Notes in Artifical Intelligence, Springer-Verlag, 2004.
22. MATIJASEVICH Y., "Simple examples of undecidable associative calculi", Soviet mathematics (Doklady), vol. 2, num. 2, 1967, p. 555-557.
23. PASSY S., TINCHEV T., "An Essay in Combinatory Dynamic Logic", Information and Computation, vol. 93, num. 2, 1991.
24. PRATT, "Considerations on Floyd-Hoare Logic", FOCS: IEEE Symposium on Foundations of Computer Science (FOCS), 1976.
25. PRENDINGER H., SCHURZ G., "Reasoning about Action and Change: A Dynamic Logic Approach", Journal of Logic, Language, and Information, vol. 5, num. 2, 1996, p. 209-245.
26. SCHILD K. D., "A correspondence theory for terminological logics: Preliminary report", MYLOPOULOS J., REITER R., Eds., Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI-91), Morgan Kaufmann, 1991, p. 466-471.
27. VARDI M. Y., "The Taming of Converse: Reasoning about Two-way Computations", PARIKH R., Ed., Proceedings of the Conference on Logic of Programs, vol. 193 of LNCS, Springer, 1985, p. 413-424.
28. VARDI M. Y., WOLPER P., "Automata-theoretic techniques for modal logic of programs", Journal of Computer and System Sciences, vol. 32, 1986, p. 183-221. (Pubitemid 16586688)