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) (alternative Version available from Imperial College). Funding of the second project phase (one postdoctoral researcher for 2 years) has been approved by the German Research Council (DFG) in September 2010.

Papers:

 

Go to year:  to appear   2012   2011   2010   2009   2008   2007   2006 

to appear     Back to top

Dirk Pattinson, Lutz Schröder. Generic Modal Cut Elimination Applied to Conditional Logics. In Log. Methods Comput. Sci. To appear.

2012     Back to top

Daniel Gorín, Lutz Schröder (2012). Narcisissts are easy, stepmothers are hard. In Lars Birkedal (Ed.), Foundations of Software Science and Computation Structures, FOSSACS 2012, Vol. 7213, pp. 240–254, Lecture Notes in Computer Science. Springer.

2011     Back to top

	Victor Gutierrez Basulto, Jean Christoph Jung, Carsten Lutz, Lutz Schröder (2011). The Complexity of Probabilistic EL. In Sebastian Rudolph, Michael Zakharyaschev (Eds.), Proc. 24th International Workshop on Description Logics (DL 2011) , CEUR-WS online proceedings. To appear.
	Corina Cirstea, Alexander Kurz, Dirk Pattinson, Lutz Schröder, Yde Venema (2011). Modal logics are coalgebraic. In The Computer Journal, 54 (1), pp. 31–41. Extends (Cirstea et al. 2008)..
	Victor Gutierrez-Basulto, Jean Christoph Jung, Carsten Lutz, Lutz Schröder (2011). A Closer Look at the Probabilistic Description Logic Prob-EL. In Wolfram Burgard, Dan Roth (Eds.), Proc. 25th Conference on Artificial Intelligence (AAAI-11), pp. 197–202. AAAI Press.
	Lutz Schröder, Dirk Pattinson (2011). Modular Algorithms for Heterogeneous Modal Logics via Multi-Sorted Coalgebra. In Math. Struct. Comput. Sci., 21 (2), pp. 235–266. Copyright Cambridge University Press.
	Lutz Schröder, Dirk Pattinson (2011). Description Logics and Fuzzy Probability. In Toby Walsh (Ed.), International Joint Conference on Artificial Intelligence, IJCAI 2011. AAAI Press, Menlo Park, CA. To appear. Accepted for oral and poster presentation.

2010     Back to top

	Rajeev Gore, Clemens Kupke, Dirk Pattinson, Lutz Schröder (2010). Global Caching for Coalgebraic Description Logics. In Jürgen Giesl, Reiner Haehnle (Eds.), International Joint Conference on Automated Reasoning, IJCAR 2010, Vol. 6173, pp. 46–60, Lecture Notes in Computer Science. Springer.
	Daniel Hausmann, Lutz Schröder (2010). Optimizing Conditional Logic Reasoning within CoLoSS. In Thomas Bolander, Torben Braüner (Eds.), Methods for Modalities (M4M-6, 2009), Vol. 262, (p. 157-171 ). , Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam.
	Carsten Lutz, Lutz Schröder (2010). Probabilistic Description Logics for Subjective Uncertainty. In Fangzhen Lin, Ulrike Sattler, Miroslaw Truszczynski (Eds.), Principles of Knowledge Representation and Reasoning (KR 2010), pp. 393–403. AAAI Press, Menlo Park, CA.
	Dirk Pattinson, Lutz Schröder (2010). Cut Elimination in Coalgebraic Logics. In Information and Computation, Vol. 208, pp. 1447–1468.
	Lutz Schröder, Dirk Pattinson (2010). Rank-1 modal logics are coalgebraic . In Journal of Logic and Computation, 20 (5), pp. 1113–1147. Extends (Schröder and Pattinson STACS 2007).
	Lutz Schröder, Dirk Pattinson (2010). Named Models in Coalgebraic Hybrid Logic. In Jean-Yves Marion, Thomas Schwentick (Eds.), 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, Vol. 5, pp. 645–656, Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Center of Informatics, Dagstuhl, Germany.
	Lutz Schröder, Dirk Pattinson (2010). Coalgebraic correspondence theory. In Luke Ong (Ed.), Foundations of Software Science and Computation Structures (FoSSaCS 2010), Vol. 6014, pp. 328–342, Lecture Notes in Computer Science. Springer.
	Lutz Schröder, Dirk Pattinson, Daniel Hausmann (2010). Optimal Tableaux for Conditional Logics with Cautious Monotonicity. In Michael Wooldridge (Ed.), European Conference on Artificial Intelligence (ECAI 2010), Vol. 215, pp. 707–712, Frontiers in Artificial Intelligence and Applications. IOS Press.
	Lutz Schröder, Yde Venema (2010). Flat coalgebraic fixed point logics. In Paul Gastin, François Laroussinie (Eds.), 21st International Conference on Concurrency Theory, CONCUR 2010, Vol. 6269, pp. 524–538, Lecture Notes in Computer Science. Springer.

2009     Back to top

	Georgel Calin, Rob Myers, Dirk Pattinson, Lutz Schröder (2009). CoLoSS: The Coalgebraic Logic Satisfiability Solver (System Description). In Carlos Areces, Stephane Demri (Eds.), Methods for Modalities (M4M-5, 2007), Vol. 231, pp. 41–54, Electronic Notes in Theoretical Computer Science. Elsevier Science.
	Rob Myers, Dirk Pattinson, Lutz Schröder (2009). Coalgebraic Hybrid Logic. In Luca de Alfaro (Ed.), Foundations of Software Science and Computation Structures (FOSSACS 2009), Vol. 5504, pp. 137–151, Lecture Notes in Computer Science. Springer.
	Dirk Pattinson, Lutz Schröder (2009). Generic Modal Cut Elimination Applied to Conditional Logics. In Martin Giese, Arild Waaler (Eds.), Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2009), Vol. 5607, pp. 280–294, Lecture Notes in Computer Science. Springer.
	Lutz Schröder, Dirk Pattinson (2009). PSPACE Bounds for Rank-1 Modal Logics. In ACM Transactions on Computational Logic, 10 (2:13), pp. 1–33.
	Lutz Schröder, Dirk Pattinson (2009). Strong completeness of coalgebraic modal logics. In Susanne Albers, Jean-Yves Marion (Eds.), 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), pp. 673–684, Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Center of Informatics, Dagstuhl, Germany.
	Lutz Schröder, Dirk Pattinson, Clemes Kupke (2009). Nominals for Everyone. In Craig Boutilier (Ed.), International Joint Conferences on Artificial Intelligence (IJCAI 2009), pp. 917–922. AAAI Press, Menlo Park, CA.

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.
	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

	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.), International Symposium on 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