PDL with intersection and converse is decidable

Lecture Notes in Computer Science

Volumn 3634, Issue , 2005, Pages 413-427

  Lutz, Garsten ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; DATABASE SYSTEMS; INFORMATION ANALYSIS; TREES (MATHEMATICS);

EPISTEMIC LOGIC; INFINITE TREES; INFORMATION LOGIC; PREPOSITIONAL DYNAMIC LOGIC (PDL);

FORMAL LOGIC;

EID: 26944482326     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538363_29     Document Type: Conference Paper

References (24)

1. L. Afanasiev, P. Blackburn, I. Dimitriou, B. Gaiffe, E. Goris, M. Marx, and M. de Rijke. PDL for ordered trees. Journal of Applied Non-Classical Logic, 2005. To appear.
2. N. Alechina, S. Demri, and M. de Rijke. A modal perspective on path constraints. Journal of Logic and Computation, 13(6):939-956, 2003.
3. F. Baader. Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. In Proc. of IJCAI-91, pages 446-451, Sydney, Australia, 1991.
4. P. Balbiani and D. Vakarelov. Iteration-free PDL with intersection: a complete axiomatization. In Fundamenta Informaticae, volume 45, pages 1-22. 2001.
5. D. Berardi, D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Mecella. Automatic composition of e-services that export their behavior. In Proc. of the 1st Int. Conf. on Service Oriented Computing (ICSOC 2003), volume 2910 of LNCS, pages 43-58. Springer, 2003.
6. D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proc. of PODS'98, pages 149-158, 1998.
7. R. Danecki. Nondeterministic prepositional dynamic logic with intersection is decidable. In Proc. of the Fifth, Symposium on Computation Theory, volume 208 of LNCS, pages 34-53, Zaborów, Poland, Dec. 1984. Springer.
8. G. De Giacomo and M. Lenzerini. PDL-based framework for reasoning about actions. In Proc. of AI*IA'95, volume 992, pages 103-114. Springer, 1995.
9. F. M. Donini, M. Lenzerini, D. Nardi, and W. Nutt. The complexity of concept languages. Information and Computation, 134(1):1-58, 1997.
10. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning About Knowledge. MIT Press, 1995.
11. L. Farinas Del Cerro and E. Orlowska. DAL-a logic for data analysis. Theoretical Computer Science, 36(2-3):251-264, 1985.
12. M. J. Fischer and R. E. Ladner. Prepositional modal logic of programs. In Conference record of the ninth annual ACM Symposium on Theory of Computing, pages 286-294. ACM Press, 1977.
13. M. J. Fischer and R. E. Ladner. Prepositional dynamic logic of regular programs. J. Comput. Syst. Sci., 18:194-211, 1979.
14. G. D. Giacomo and M. Lenzerini. Boosting the correspondence between description logics and prepositional dynamic logics. In Proc. of AAAI'94. Volume 1, pages 205-212. AAAI Press, 1994.
15. D. Harel. Dynamic logic. In Handbook of Philosophical Logic, Volume II, pages 496-604. D. Reidel Publishers, 1984.
16. D. Kozen. Results on the propositional μ-calculus. In Automata, Languages and Programming, 9th Colloquium, volume 140 of Lecture Notes in Computer Science, pages 348-359. Springer-Verlag, 1982.
17. M. Lange. A lower complexity bound for propositional dynamic logic with intersection. In Advances in Modal Logic Volume 5. King's College Publications, 2005.
18. M. Lange and C. Lutz. 2-ExpTime lower bounds for propositional dynamic logics with intersection. 2005. Submitted.
19. C. Lutz. PDL with intersection and converse is decidable. LTCS-Report 05-05, Technical University Dresden, 2005. Available from http://lat.inf.tu- dresden.de/research/reports.html.
20. C. Lutz and U. Sattler. Mary likes all cats. In Proc. of DL2000, number 33 in CEUR-WS (http://ceur-ws.org/), pages 213-226, 2000.
21. F. Massacci. Decision procedures for expressive description logics with role intersection, composition and converse. In Proc. of IJCAI-01, pages 193-198, San Francisco, CA, Aug. 4-10 2001. Morgan Kaufmann Publishers, Inc.
22. V. Pratt. Considerations on floyd-hoare logic. In FOCS: IEEE Symposium on Foundations of Computer Science (FOCS), 1976.
23. K. D. Schild. A correspondence theory for terminological logics: Preliminary report. In Proc. of IJCAI-91, pages 466-471. Morgan Kaufmann, 1991.
24. M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logic of programs. Journal of Computer and System Sciences 32 (1986) 183-221