Computational complexity of multimodal logics based on rough sets

Fundamenta Informaticae

Volumn 44, Issue 4, 2000, Pages 373-396

  Demri, Stéphane ^a   Stepaniuk, Jarosław ^b  

^a CNRS   (France)

^b BIALYSTOK UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Computational complexity; Ladner style algorithm; Multimodal logics; Rough sets; Tolerance rough sets

Indexed keywords

EID: 0039973695     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (33)

1. C. Chen and I. Lin. The complexity of prepositional modal theories and the complexity of consistency of propositional modal theories. In A. Nerode and Yu. V. Matiyasevich, editors, LFCS-3, St. Petersburg, pages 69-80. Springer-Verlag, LNCS 813, 1994.
2. S. Demri. Complexity of simple dependent bimodal logics. In R. Dyckhoff, editor, Automated Reasoning with Analytic Tableaux and Related Methods, St Andrews, Scotland, UK, pages 190-204. volume 1847 of Lecture Notes in Artificial Intelligence, Springer-Verlag, July 2000.
3. S. Demri. The nondeterministic information logic NIL is PSPACE-complete. Fundamenta Informaticae, 42(3-4):211-234, 2000.
4. F. Donini, M. Lenzerini, D. Nardi, and W. Nutt. The complexity of concept languages. Information and Computation, 134:1-58, 1997.
5. L. Fariñas del Cerro and E. Orlowska. DAL - A logic for data analysis. Theoretical Computer Science, 36:251-264, 1985. Corrigendum ibid, 47:345, 1986.
6. L. Fariñas del Cerro and E. Orlowska. DAL - A logic for data analysis. Theoretical Computer Science, 36:251-264, 1985. Corrigendum ibid, 47:345, 1986.
7. M. Fischer and N. Immerman. Interpreting logics of knowledge in propositional dynamic logic with converse. Information Processing Letters, 25:175-181, 1987.
8. M. Fischer and R. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18:194-211, 1979.
9. G. de Giacomo. Eliminating 'converse' from converse PDL. Journal of Logic, Language and Information, 5:193-208, 1996.
10. G. Hughes and M. Cresswell. A companion to modal logic. Methuen, 1984.
11. E. Hemaspaandra. Complexity transfer for modal logic (extended abstract). In Ninth Annual IEEE Symposium on Logic on Computer Science (LICS-9), pages 164-173, July 1994.
12. J. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319-379, 1992.
13. B. Konikowska. A logic for reasoning about relative similarity. Studia Logica, 58(1):185-226, 1997.
14. R. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal of Computing, 6(3):467-480, September 1977.
15. F. Massacci. Single steps tableaux for modal logics. Journal of Automated Reasoning, 24(3):319-364, 2000.
16. E. Orłowska (ed.). Incomplete Information: Rough Set Analysis. Studies in Fuzzmess and Soft Computing. Physica-Verlag, 1998.
17. E, Orłowska. Logic of indiscernibility relations. In A. Skowron, editor, 5th Symposium on Computation Theory, Zaborów, Poland, pages 177-186. Lecture Notes in Computer Science, Vol. 208, Springer-Verlag, 1984.
18. Ch. Papadimitriou. Computational Complexity. Addison-Wesley Publishing Company, 1994.
19. Z. Pawlak. Rough sets. International Journal of Information and Computer Sciences, 11:341-356, 1982.
20. Z. PawLak. Rough Sets - Theoretical Aspects of Reasoning about Data. Kluwer Academic Press, 1991.
21. L. Polkowski and A. Skowron. Rough sets: A perspective. In L. Polkowski and A. Skowron, editors, Rough sets in Knowledge Discovery, pages 31-56. Physica Verlag, Berlin, 1998.
22. L. Polkowski and A. Skowron (Eds.). Rough Sets in Knowledge Discovery. Studies in Fuzziness and Soft Computing. Physica-Verlag, 1998.
23. S. Pal and A. Skowron (Eds.). Rough-fuzzy Hybridization: A New Trend in Decision Making. Springer Verlag, Singapore, 1999.
24. H. Sahlqvist. Completeness and correspondence in the first and second order semantics for modal logics. In S. Ranger, editor, 3rd Scandinavian Logic Symposium, Uppsala, Sweden, 1973, pages 110-143. North Holland, 1975.
25. E. Spaan. Complexity of Modal Logics. PhD thesis, ILLC, Amsterdam University, March 1993.
26. E. Spaan. The complexity of prepositional tense logics. In M. de Rijke, editor. Diamonds and Defaults, pages 287-309. Kluwer Academic Publishers, Series Studies in Pure and Applied Intensional Logic, Volume 229, 1993.
27. A. Skowron and J. Stepaniuk. Towards an approximation theory of discrete problems. Fundamenta Informaticae, 15(2):187-208, 1991.
28. A. Skowron and J. Stepaniuk. Tolerance approximation spaces. Fundamenta Informaticae, 27:245-253, 1996.
29. J. Stepaniuk. Rough relations and logics. In L. Polkowski and A. Skowron, editors, Rough sets in Knowledge Discovery, pages 248-260. Physica Verlag, Berlin, 1998.
30. J. Stepaniuk. Knowledge discovery by application of rough set models. Institute of Computer Science, Polish Academy of Sciences, Report 887, October 1999, also in L. Polkowski, T.Y. Lin, S. Tsumoto, editors, Rough Sets: New Developments, Physica-Verlag, Heidelberg, 2000.
31. H. Tuominen. Dynamic logic as a uniform framework for theorem proving in intensional logic. In M. Stickel, editor, CADE-10, pages 514-527. LNCS 449, Springer, 1990.
32. D. Vakarelov. Modal logics for knowledge representation systems. Theoretical Computer Science, 90:433-456, 1991.
33. L. Vigano. Labelled Non-Classical Logics. Kluwer, 2000.