Generic Algorithms and Complexity Bounds in Coalgebraic Modal Logic

Lutz Schröder

This project is concerned with the extension of existing generic algorithmic methods in coalgebraic modal logic, conceived as a generic semantic framework for modal logics in a broad sense. Moreover, the algorithms obtained will be implemented in an experimental tool extending the existing Coalgebraic Logic Satisfiability Solver (CoLoSS). Funding of this project (one research associate for 2 years) has been approved by the German Research Council (DFG) in October 2007.

Material on Algorithms in Coalgebraic Modal Logic

Grant proposal (in German)

Papers:

 

Go to year:  to appear   2009   2008   2007   2006 

to appear     Back to top

	Lutz Schröder, Dirk Pattinson. PSPACE Bounds for Rank-1 Modal Logics. In ACM Transactions on Computational Logic. To appear. Preprint available as e-print arXiv:0706.4044. Extends (Schröder and Pattinson 2006).
	Lutz Schröder, Dirk Pattinson. Rank-1 modal logics are coalgebraic . In Journal of Logic and Computation. To appear. Extends (Schröder and Pattinson STACS 2007).

2009     Back to top

Lutz Schröder, Dirk Pattinson (2009). Strong completeness of coalgebraic modal logics. In Susanne Albers, Jean-Yves Marion (Eds.), Theoretical Aspects of Computer Science (STACS 2009). To appear.

2008     Back to top

	Corina Cirstea, Alexander Kurz, Dirk Pattinson, Lutz Schröder, Yde Venema (2008). Modal logics are coalgebraic. In Samson Abramsky, Erol Gelenbe, Vladimiro Sassone (Eds.), Visions of Computer Science, BCS International Academic Research Conference (BCS 2008), pp. 129–140. British Computer Society.
	Dirk Pattinson, Lutz Schröder (2008). Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics. In Roberto Amadio (Ed.), Foundations of Software Science and Computation Structures (FOSSACS 2008), Vol. 4962, pp. 66–80, Lecture Notes in Computer Science. Springer.
	Dirk Pattinson, Lutz Schröder (2008). Admissibility of Cut in Coalgebraic Logics. In J. Adamek, C. Kupke (Eds.), Coalgebraic Methods in Computer Science (CMCS 08), Vol. 203, pp. 221–241, Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam.
	Lutz Schröder, Dirk Pattinson (2008). How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics. In Gerhard Brewka, Jerôme Lang (Eds.), Principles of Knowledge Representation and Reasoning (KR 2008), pp. 307–218. AAAI Press, Menlo Park, CA. To appear.
	Lutz Schröder, Dirk Pattinson (2008). Shallow models for non-iterative modal logics. In Andreas Dengel, Karsten Berns, Thomas Breuel, Frank Bomarius, Thomas Roth-Berghofer (Eds.), Advances in Artificial Intelligence (KI 2008), Vol. 5243, pp. 324–331, Lecture Notes in Artificial Intelligence. Springer. Full version available as e-print arXiv:0802.0116.

2007     Back to top

	Georgel Calin, Rob Myers, Dirk Pattinson, Lutz Schröder (2007). CoLoSS: The Coalgebraic Logic Satisfiability Solver (System Description). In Carlos Areces, Stephane Demri (Eds.), Methods for Modalities (M4M-5), Electronic Notes in Theoretical Computer Science. Elsevier Science. To appear.
	Lutz Schröder (2007). A finite model construction for coalgebraic modal logic. In Journal of Logic and Algebraic Programming (FOSSACS 06 special issue), Vol. 73, pp. 97–110. Extends (Schröder 2006).
	Lutz Schröder, Dirk Pattinson (2007). Rank-1 Modal Logics are Coalgebraic. In Wolfgang Thomas, Pascal Weil (Eds.), Theoretical Aspects of Computer Science (STACS 07), Vol. 4393, pp. 573–585, Lecture Notes in Computer Science. Springer. Extended version available.
	Lutz Schröder, Dirk Pattinson (2007). Modular Algorithms for Heterogeneous Modal Logics. In Lars Arge, Andrzej Tarlecki, Christian Cachin (Eds.), Automata, Languages and Programming (ICALP 07), Vol. 4596, pp. 459–471, Lecture Notes in Computer Science. Springer.

2006     Back to top

	Lutz Schröder (2006). A Finite Model Construction for Coalgebraic Modal Logic. In Luca Aceto, Anna Ingólfsdóttir (Eds.), Foundations Of Software Science And Computation Structures, Vol. 3921, pp. 157–171, Lecture Notes in Computer Science. Springer, Berlin. EATCS Best Paper Award at ETAPS 2006.
	Lutz Schröder, Dirk Pattinson (2006). PSPACE Bounds for Rank 1 Modal Logics. In Rajeev Alur (Ed.), Logic in Computer Science (LICS 06), pp. 231–240. IEEE. Presentation slides available.
Show selected entries in BibTex Format