Skip to main content
×
×
Home

Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra

  • LUTZ SCHRÖDER (a1) and DIRK PATTINSON (a2)
Abstract

State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. In this paper, we show that the combination of features can be reflected algorithmically, and we develop modular decision procedures for heterogeneous modal logics. The modularity is achieved by formalising the underlying state-based systems as multi-sorted coalgebras and associating both a logical and algorithmic description with a number of basic building blocks. Our main result is that logics arising as combinations of these building blocks can be decided in polynomial space provided this is also the case for the components. By instantiating the general framework to concrete cases, we obtain PSpace decision procedures for a wide variety of structurally different logics, describing, for example, Segala systems and games with uncertain information.

Copyright
References
Hide All
Adámek, J., Herrlich, H. and Strecker, G. E. (1990) Abstract and Concrete Categories, Wiley Interscience.
Alur, R., Henzinger, T. A. and Kupferman, O. (2002) Alternating-time temporal logic. Journal of the ACM 49 672713.
Barr, M. (1993) Terminal coalgebras in well-founded set theory. Theoretical Computer Science 114 299315.
Bartels, F., Sokolova, A. and de Vink, E. (2003) A hierarchy of probabilistic system types. In: Gumm, H.-P. (ed.) Coalgebraic Methods in Computer Science, CMCS 03. Electronic Notes in Theoretical Computer Science 82.
Berghofer, S. and Wenzel, M. (1999) Inductive datatypes in HOL – lessons learned in formal-logic engineering. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C. and Théry, L. (eds.) Theorem Proving in Higher Order Logics, TPHOLs 1999. Springer-Verlag Lecture Notes in Computer Science 1690 1936.
Blackburn, P., de Rijke, M. and Venema, Y. (2001) Modal Logic, Cambridge University Press.
Calin, G., Myers, R., Pattinson, D. and Schröder, L. (2009) CoLoSS: The Coalgebraic Logic Satisfiability Solver (system description). In: Areces, C. and Demri, S. (eds.) Methods for Modalities, M4M-5, 2007. Electronic Notes in Theoretical Computer Science 231 4154.
Chandra, A. and Stockmeyer, L. (1981) Alternation. Journal of the ACM 28 (1)114133.
Chellas, B. (1980) Modal Logic, Cambridge University Press.
Cîrstea, C. and Pattinson, D. (2007) Modular construction of modal logics. Theoretical Computer Science 388 (1-3)83108.
D'Agostino, G. and Visser, A. (2002) Finality regained: A coalgebraic study of Scott-sets and multisets. Archive for Mathematical Logic 41 267298.
de Vink, E. and Rutten, J. (1999) Bisimulation for probabilistic transition systems: A coalgebraic approach. Theoretical Computer Science 221 271293.
Fine, K. (1972) In so many possible worlds. Notre Dame Journal of Formal Logic 13 516520.
Goré, R., Kupke, C. and Pattinson, D. (2010a) Optimal tableau algorithms for coalgebraic logics. In: Esparza, J. and Majumdar, R. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, TACAS 10. Springer-Verlag Lecture Notes in Computer Science 6015 114128.
Goré, R., Kupke, C., Pattinson, D. and Schröder, L. (2010b) Global caching for coalgebraic description logics. In: Giesl, J. and Haehnle, R. (eds.) International Joint Conference on Automated Reasoning, IJCAR 2010. Springer-Verlag Lecture Notes in Computer Science 6173 4660.
Halpern, J. Y. (2003) Reasoning About Uncertainty, MIT Press.
Hansson, H. and Jonsson, B. (1990) A calculus for communicating systems with time and probabilities. In: Real-Time Systems, RTSS 90, IEEE 278287.
Hansson, H. A. (1994) Time and Probability in Formal Design of Distributed Systems, Elsevier.
Heifetz, A. and Mongin, P. (2001) Probabilistic logic for type spaces. Games and Economic Behavior 35 3153.
Hemaspaandra, E. (1994) Complexity transfer for modal logic. In: Abramsky, S. (ed.) Logic in Computer Science, LICS 94, IEEE 164173.
Jacobs, B. (2001) Many-sorted coalgebraic modal logic: a model-theoretic study. Theoretical Informatics and Applications 35 3159.
Jonsson, B., Yi, W. and Larsen, K. G. (2001) Probabilistic extensions of process algebras. In: Bergstra, J., Ponse, A. and Smolka, S. (eds.) Handbook of Process Algebra, Elsevier.
Kurucz, A. (2006) Combining modal logics. In: van Benthem, J., Blackburn, P. and Wolter, F. (eds.) Handbook of Modal Logic, Elsevier.
Kutz, O., Lutz, C., Wolter, F. and Zakharyaschev, M. (2004) ℰ-connections of abstract description systems. Artificial Intelligence 156 173.
Larsen, K. and Skou, A. (1991) Bisimulation through probabilistic testing. Information and Computation 94 128.
Lewis, D. (1975) Intensional logics without iterative axioms. Journal of Philosophical Logic 3 457466.
Moss, L. (1999) Coalgebraic logic. Annals of Pure and Applied Logic 96 277317.
Mossakowski, T., Schröder, L., Roggenbach, M. and Reichel, H. (2006) Algebraic-coalgebraic specification in CoCASL. Journal of Logic and Algebraic Programming 67 146197.
Myers, R., Pattinson, D. and Schröder, L. (2009) Coalgebraic hybrid logic. In: de Alfaro, L. (ed.) Foundations of Software Science and Computation Structures, FoSSaCS 2009. Springer-Verlag Lecture Notes in Computer Science 5504 137151.
Olivetti, N., Pozzato, G. L. and Schwind, C. (2007) A sequent calculus and a theorem prover for standard conditional logics. ACM Transactions on Computational Logic 8.
Pattinson, D. (2004) Expressive logics for coalgebras via terminal sequence induction. Notre Dame Journal of Formal Logic 45 1933.
Pattinson, D. and Schröder, L. (2008) Beyond rank 1: Algebraic semantics and finite models for coalgebraic logics. In: Amadio, R. (ed.) Foundations of Software Science and Computation Structures, FoSSaCS 2008. Springer-Verlag Lecture Notes in Computer Science 4962 6680.
Pauly, M. (2002) A modal logic for coalitional power in games. Journal of Logic and Computation 12 149166.
Rutten, J. (2000) Universal coalgebra: A theory of systems. Theoretical Computer Science 249 380.
Schröder, L. (2007) A finite model construction for coalgebraic modal logic. Journal of Logic and Algebraic Programming 73 97110.
Schröder, L. (2008) Expressivity of coalgebraic modal logic: The limits and beyond. Theoretical Computer Science 390 230247.
Schröder, L. and Pattinson, D. (2007) Modular algorithms for heterogeneous modal logics. In: Arge, L., Tarlecki, A. and Cachin, C. (eds.) Automata, Languages and Programming, ICALP 2007. Springer-Verlag Lecture Notes in Computer Science 4596 459471.
Schröder, L. and Pattinson, D. (2008a) How many toes do I have? Parthood and number restrictions in description logics. In: Brewka, G. and Lang, J. (eds.) Principles of Knowledge Representation and Reasoning, KR 2008, AAAI Press 307–218.
Schröder, L. and Pattinson, D. (2008b) Shallow models for non-iterative modal logics. In: Dengel, A., Berns, K., Breuel, T., Bomarius, F. and Roth-Berghofer, T. (eds.) Advances in Artificial Intelligence, KI 2008. Springer-Verlag Lecture Notes in Artificial Intelligence 5243 324331.
Schröder, L. and Pattinson, D. (2009) PSPACE bounds for rank-1 modal logics. ACM Transactions on Computational Logic 10 (2:13)133.
Schröder, L. and Pattinson, D. (2010) Rank-1 modal logics are coalgebraic. Journal of Logic and Computation 20 (5)11131147.
Schröder, L., Pattinson, D. and Kupke, C. (2009) Nominals for everyone. In: Boutilier, C. (ed.) International Joint Conferences on Artificial Intelligence, IJCAI 09, AAAI Press 917922.
Segala, R. (1995) Modelling and Verification of Randomized Distributed Real-Time Systems, Ph.D. thesis, Massachusetts Institute of Technology.
Segala, R. (2006) Probability and nondeterminism in operational models of concurrency. In: Baier, C. and Hermanns, H. (eds.) Concurrency Theory, CONCUR 2006. Springer-Verlag Lecture Notes in Computer Science 4137 6478.
Segala, R. and Turrini, A. (2005) Comparative analysis of bisimulation relations on alternating and non-alternating probabilistic models. In: Quantitative Evaluation of Systems, QEST 2005, IEEE 4453.
Sokolova, A., de Vink, E. and Woracek, H. (2009) Coalgebraic weak bisimulation for action-type systems. Scientific Annals of Computer Science 19 93144.
Tobies, S. (2001) PSPACE reasoning for graded modal logics. Journal of Logic and Computation 11 85106.
Vardi, M. (1989) On the complexity of epistemic reasoning. In: Logic in Computer Science, LICS 89, IEEE 243251.
Wolter, F. (1998) Fusions of modal logics revisited. In: Kracht, M., de Rijke, M. and Wansing, H. (eds.) Advances in modal logic, AiML 98. CSLI Lecture Notes 1 361379.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed