Lutz Schröder

Christoph Hertzberg, René Wagner, Udo Frese, Lutz Schröder: Integrating generic sensor fusion algorithms with sound state representations through encapsulation of manifolds. Information Fusion 14(1): 57-77 (2013)

Daniel Gorín, Lutz Schröder: Simulations and Bisimulations For Coalgebraic Modal Logics. CoRR abs/1303.2467 (2013)

Daniel Gorín, Lutz Schröder: Extending ALCQ with Bounded Self-Reference. Advances in Modal Logic 2012: 300-316

Daniel Gorín, Lutz Schröder: Narcissists Are Easy, Stepmothers Are Hard. FoSSaCS 2012: 240-254

Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder: Coalgebraic Predicate Logic. ICALP (2) 2012: 299-311

Dirk Pattinson, Lutz Schröder (Eds.): Coalgebraic Methods in Computer Science - 11th International Workshop, CMCS 2012, Colocated with ETAPS 2012, Tallinn, Estonia, March 31 - April 1, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7399, Springer 2012, isbn 978-3-642-32783-4

Corina Cîrstea, Alexander Kurz, Dirk Pattinson, Lutz Schröder, Yde Venema: Modal Logics are Coalgebraic. Comput. J. 54(1): 31-41 (2011)

Dirk Pattinson, Lutz Schröder: Generic Modal Cut Elimination Applied to Conditional Logics. Logical Methods in Computer Science 7(1) (2011)

Lutz Schröder, Dirk Pattinson: Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra. Mathematical Structures in Computer Science 21(2): 235-266 (2011)

Víctor Gutiérrez-Basulto, Jean Christoph Jung, Carsten Lutz, Lutz Schröder: A Closer Look at the Probabilistic Description Logic Prob-EL. AAAI 2011

Sergey Goncharov, Lutz Schröder: A Counterexample to Tensorability of Effects. CALCO 2011: 208-221

Jean Christoph Jung, Víctor Gutiérrez-Basulto, Carsten Lutz, Lutz Schröder: The Complexity of Probabilistic EL. Description Logics 2011

Dominik Dietrich, Lutz Schröder, Ewaryst Schulz: Formalizing and Operationalizing Industrial Standards. FASE 2011: 81-95

Sergey Goncharov, Lutz Schröder: A Coinductive Calculus for Asynchronous Side-Effecting Processes. FCT 2011: 276-287

Lutz Schröder, Dirk Pattinson: Description Logics and Fuzzy Probability. IJCAI 2011: 1075-1081

Sergey Goncharov, Lutz Schröder: Powermonads and Tensors of Unranked Effects. LICS 2011: 227-236

Sergey Goncharov, Lutz Schröder: Powermonads and Tensors of Unranked Effects. CoRR abs/1101.2777 (2011)

Sergey Goncharov, Lutz Schröder: A Coinductive Calculus for Asynchronous Side-effecting Processes. CoRR abs/1104.2936 (2011)

Christoph Hertzberg, René Wagner, Udo Frese, Lutz Schröder: Integrating Generic Sensor Fusion Algorithms with Sound State Representations through Encapsulation of Manifolds. CoRR abs/1107.1119 (2011)

Daniel Hausmann, Lutz Schröder: Optimizing Conditional Logic Reasoning within CoLoSS. Electr. Notes Theor. Comput. Sci. 262: 157-171 (2010)

Till Mossakowski, Lutz Schröder, Sergey Goncharov: A generic complete dynamic logic for reasoning about purity and effects. Formal Asp. Comput. 22(3-4): 363-384 (2010)

Dirk Pattinson, Lutz Schröder: Cut elimination in coalgebraic logics. Inf. Comput. 208(12): 1447-1468 (2010)

Lutz Schröder, Dirk Pattinson: Rank-1 Modal Logics are Coalgebraic. J. Log. Comput. 20(5): 1113-1147 (2010)

Rajeev Goré, Clemens Kupke, Dirk Pattinson, Lutz Schröder: Global Caching for Coalgebraic Description Logics. IJCAR 2010: 46-60

Lutz Schröder, Yde Venema: Flat Coalgebraic Fixed Point Logics. CONCUR 2010: 524-538

Lutz Schröder, Dirk Pattinson, Daniel Hausmann: Optimal Tableaux for Conditional Logics with Cautious Monotonicity. ECAI 2010: 707-712

Lutz Schröder, Dirk Pattinson: Coalgebraic Correspondence Theory. FOSSACS 2010: 328-342

Carsten Lutz, Lutz Schröder: Probabilistic Description Logics for Subjective Uncertainty. KR 2010

Lutz Schröder, Dirk Pattinson: Named Models in Coalgebraic Hybrid Logic. STACS 2010: 645-656

Lutz Schröder, Dirk Pattinson: Named Models in Coalgebraic Hybrid Logic. CoRR abs/1001.0735 (2010)

Lutz Schröder, Yde Venema: Flat coalgebraic fixed point logics. CoRR abs/1004.2717 (2010)

Georgel Calin, Robert S. R. Myers, Dirk Pattinson, Lutz Schröder: CoLoSS: The Coalgebraic Logic Satisfiability Solver. Electr. Notes Theor. Comput. Sci. 231: 41-54 (2009)

Lutz Schröder, Till Mossakowski: HasCasl: Integrated higher-order specification and program development. Theor. Comput. Sci. 410(12-13): 1217-1260 (2009)

Lutz Schröder, Dirk Pattinson: PSPACE bounds for rank-1 modal logics. ACM Trans. Comput. Log. 10(2) (2009)

Sergey Goncharov, Lutz Schröder, Till Mossakowski: Kleene Monads: Handling Iteration in a Framework of Generic Effects. CALCO 2009: 18-33

Michael Kohlhase, Johannes Lemburg, Lutz Schröder, Ewaryst Schulz: Formal Management of CAD/CAM Processes. FM 2009: 223-238

Robert S. R. Myers, Dirk Pattinson, Lutz Schröder: Coalgebraic Hybrid Logic. FOSSACS 2009: 137-151

Lutz Schröder, Dirk Pattinson, Clemens Kupke: Nominals for Everyone. IJCAI 2009: 917-922

Lutz Schröder, Dirk Pattinson: Strong Completeness of Coalgebraic Modal Logics. STACS 2009: 673-684

Dirk Pattinson, Lutz Schröder: Generic Modal Cut Elimination Applied to Conditional Logics. TABLEAUX 2009: 280-294

Lutz Schröder, Dirk Pattinson: Strong Completeness of Coalgebraic Modal Logics. CoRR abs/0902.2072 (2009)

Dirk Pattinson, Lutz Schröder: Admissibility of Cut in Coalgebraic Logics. Electr. Notes Theor. Comput. Sci. 203(5): 221-241 (2008)

Lutz Schröder: Bootstrapping Inductive and Coinductive Types in HasCASL. Logical Methods in Computer Science 4(4) (2008)

Lutz Schröder: Expressivity of coalgebraic modal logic: The limits and beyond. Theor. Comput. Sci. 390(2-3): 230-247 (2008)

Corina Cîrstea, Alexander Kurz, Dirk Pattinson, Lutz Schröder, Yde Venema: Modal Logics are Coalgebraic. BCS Int. Acad. Conf. 2008: 128-140

Till Mossakowski, Lutz Schröder, Sergey Goncharov: A Generic Complete Dynamic Logic for Reasoning About Purity and Effects. FASE 2008: 199-214

Dirk Pattinson, Lutz Schröder: Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics. FoSSaCS 2008: 66-80

Lutz Schröder, Dirk Pattinson: Shallow Models for Non-iterative Modal Logics. KI 2008: 324-331

Lutz Schröder, Dirk Pattinson: How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics. KR 2008: 307-317

Lutz Schröder, Dirk Pattinson: The craft of model making: PSPACE bounds for non-iterative modal logics. CoRR abs/0802.0116 (2008)

Lutz Schröder: Bootstrapping Inductive and Coinductive Types in HasCASL. CoRR abs/0812.3836 (2008)

Joseph A. Goguen, Till Mossakowski, Valeria de Paiva, Florian Rabe, Lutz Schröder: An Institutional View on Categorical Logic. Int. J. Software and Informatics 1(1): 129-152 (2007)

Lutz Schröder: A finite model construction for coalgebraic modal logic. J. Log. Algebr. Program. 73(1-2): 97-110 (2007)

Lutz Schröder: Bootstrapping Types and Cotypes in HasCASL. CALCO 2007: 447-461

Stefan Wölfl, Till Mossakowski, Lutz Schröder: Qualitative Constraint Calculi: Heterogeneous Verification of Composition Tables. FLAIRS Conference 2007: 665-670

Lutz Schröder, Dirk Pattinson: Modular Algorithms for Heterogeneous Modal Logics. ICALP 2007: 459-471

Lutz Schröder, Dirk Pattinson: Rank-1 Modal Logics Are Coalgebraic. STACS 2007: 573-585

Lutz Schröder, Dirk Pattinson: PSPACE Bounds for Rank-1 Modal Logics. CoRR abs/0706.4044 (2007)

Till Mossakowski, Lutz Schröder, Markus Roggenbach, Horst Reichel: Algebraic-coalgebraic specification in CoCasl. J. Log. Algebr. Program. 67(1-2): 146-197 (2006)

Lutz Schröder: The HASCASL prologue: Categorical syntax and semantics of the partial lambda-calculus. Theor. Comput. Sci. 353(1-3): 1-25 (2006)

Daniel Hausmann, Till Mossakowski, Lutz Schröder: A coalgebraic approach to the semantics of the ambient calculus. Theor. Comput. Sci. 366(1-2): 121-143 (2006)

Lutz Schröder: A Finite Model Construction for Coalgebraic Modal Logic. FoSSaCS 2006: 157-171

Udo Frese, Lutz Schröder: Closing a Million-Landmarks Loop. IROS 2006: 5032-5039

Lutz Schröder, Dirk Pattinson: PSPACE Bounds for Rank-1 Modal Logics. LICS 2006: 231-242

Sergey Goncharov, Lutz Schröder, Till Mossakowski: Completeness of Global Evaluation Logic. MFCS 2006: 447-458

Lutz Schröder, Till Mossakowski: Coalgebraic Modal Logic in CoCasl. WADT 2006: 127-141

Lutz Schröder, Till Mossakowski, Andrzej Tarlecki, Bartek Klin, Piotr Hoffman: Amalgamation in the semantics of CASL. Theor. Comput. Sci. 331(1): 215-247 (2005)

Daniel Hausmann, Till Mossakowski, Lutz Schröder: Towards a Coalgebraic Semantics of the Ambient Calculus. CALCO 2005: 232-246

Dennis Walter, Lutz Schröder, Till Mossakowski: Parametrized Exceptions. CALCO 2005: 424-438

Stefan Wölfl, Till Mossakowski, Lutz Schröder: Qualitative Constraint Calculi: Heterogeneous Verification of Composition Tables. Spatial Cognition: Specialization and Integration 2005

Daniel Hausmann, Till Mossakowski, Lutz Schröder: Iterative Circular Coinduction for CoCasl in Isabelle/HOL. FASE 2005: 341-356

Lutz Schröder: Expressivity of Coalgebraic Modal Logic: The Limits and Beyond. FoSSaCS 2005: 440-454

Lutz Schröder, Till Mossakowski: Monad-independent Dynamic Logic in HasCasl. J. Log. Comput. 14(4): 571-619 (2004)

Lutz Schröder, Till Mossakowski: Generic Exception Handling and the Java Monad. AMAST 2004: 443-459

Lutz Schröder: The Logic of the Partial lambda-Calculus with Equality. CSL 2004: 385-399

Christoph Lüth, Markus Roggenbach, Lutz Schröder: CCC - The Casl Consistency Checker. WADT 2004: 94-105

Lutz Schröder, Till Mossakowski, Christoph Lüth: Type Class Polymorphism in an Institutional Framework. WADT 2004: 234-251

Till Mossakowski, Markus Roggenbach, Lutz Schröder: CoCASL at Work -- Modelling Process Algebra. Electr. Notes Theor. Comput. Sci. 82(1): 206-220 (2003)

Lutz Schröder: Henkin Models of the Partial sigma-Calculus. CSL 2003: 498-512

Lutz Schröder, Till Mossakowski: Monad-Independent Hoare Logic in HASCASL. FASE 2003: 261-277

Lutz Schröder: Monads on Composition Graphs. Applied Categorical Structures 10(3): 221-236 (2002)

Lutz Schröder: Classifying categories for partial equational logic. Electr. Notes Theor. Comput. Sci. 69: 305-322 (2002)

Lutz Schröder, Paulo Mateus: Universal Aspects of Probabilistic Automata. Mathematical Structures in Computer Science 12(4): 481-512 (2002)

Lutz Schröder, Till Mossakowski: HASCASL: Towards Integrated Specification and Development of Functional Programs. AMAST 2002: 99-116

Till Mossakowski, Horst Reichel, Markus Roggenbach, Lutz Schröder: Algebraic-Coalgebraic Specification in Co Casl. WADT 2002: 376-392

Lutz Schröder, Till Mossakowski: Monad-Independent Dynamic Logic in Has Casl. WADT 2002: 425-441

Lutz Schröder, Horst Herrlich: Free Factorizations. Applied Categorical Structures 9(6): 571-593 (2001)

Lutz Schröder: Life without the Terminal Type. CSL 2001: 429-442

Lutz Schröder, Till Mossakowski, Andrzej Tarlecki, Bartek Klin, Piotr Hoffman: Semantics of Architectural Specifications in CASL. FASE 2001: 253-268

Lutz Schröder, Till Mossakowski, Andrzej Tarlecki: Amalgamation in CASL via Enriched Signatures. ICALP 2001: 993-1004

Bartek Klin, Piotr Hoffman, Andrzej Tarlecki, Lutz Schröder, Till Mossakowski: Checking Amalgamability Conditions for C ASL Architectural Specifications. MFCS 2001: 451-463

Markus Roggenbach, Lutz Schröder: Towards Trustworthy Specifications I: Consistency Checks. WADT 2001: 305-327

Lutz Schröder, Horst Herrlich: Free Adjunction of Morphisms. Applied Categorical Structures 8(4): 595-606 (2000)

Markus Roggenbach, Lutz Schröder, Till Mossakowski: Specifying Real Numbers in CASL. WADT 1999: 146-161