Stop the war!
Остановите войну!
for scientists:
default search action
Lutz Schröder
Person information
- affiliation: University of Erlangen-Nuremberg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j48]Daniel Hausmann, Lutz Schröder:
Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi. Log. Methods Comput. Sci. 20(3) (2024) - [j47]Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
A point-free perspective on lax extensions and predicate liftings. Math. Struct. Comput. Sci. 34(2): 98-127 (2024) - [c124]Jonas Forster, Lutz Schröder, Paul Wild, Harsh Beohar, Sebastian Gurke, Karla Messing:
Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras. CMCS 2024: 114-134 - [c123]Simon Prucker, Lutz Schröder:
Nominal Tree Automata with Name Allocation. CONCUR 2024: 35:1-35:17 - [c122]Sergey Goncharov, Alessio Santamaria, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Logical Predicates in Higher-Order Mathematical Operational Semantics. FoSSaCS (2) 2024: 47-69 - [c121]Nathan Dykes, Stephanie Evert, Philipp Heinrich, Merlin Humml, Lutz Schröder:
Finding Argument Fragments on Social Media with Corpus Queries and LLMs. RATIO 2024: 163-181 - [c120]Harsh Beohar, Sebastian Gurke, Barbara König, Karla Messing, Jonas Forster, Lutz Schröder, Paul Wild:
Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach. STACS 2024: 10:1-10:19 - [c119]Daniel Hausmann, Merlin Humml, Simon Prucker, Lutz Schröder, Aaron Strahlberger:
Generic Model Checking for Modal Fixpoint Logics in COOL-MC. VMCAI (1) 2024: 171-185 - [i66]Sergey Goncharov, Alessio Santamaria, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Logical Predicates in Higher-Order Mathematical Operational Semantics. CoRR abs/2401.05872 (2024) - [i65]Simon Prucker, Lutz Schröder:
Nominal Tree Automata With Name Allocation. CoRR abs/2405.14272 (2024) - [i64]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Higher-Order Mathematical Operational Semantics. CoRR abs/2405.16708 (2024) - 2023
- [j46]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Towards a Higher-Order Mathematical Operational Semantics. Proc. ACM Program. Lang. 7(POPL): 632-658 (2023) - [c118]Merlin Humml, Lutz Schröder:
Common Knowledge of Abstract Groups. AAAI 2023: 6434-6441 - [c117]Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description). CADE 2023: 234-247 - [c116]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Higher-Order Mathematical Operational Semantics (Early Ideas). CALCO 2023: 24:1-24:3 - [c115]Jonas Forster, Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
Quantitative Hennessy-Milner Theorems via Notions of Density. CSL 2023: 22:1-22:20 - [c114]Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
Kantorovich Functors and Characteristic Logics for Behavioural Distances. FoSSaCS 2023: 46-67 - [c113]Henning Urbat, Stelios Tsampas, Sergey Goncharov, Stefan Milius, Lutz Schröder:
Weak Similarity in Higher-Order Mathematical Operational Semantics. LICS 2023: 1-13 - [i63]Henning Urbat, Stelios Tsampas, Sergey Goncharov, Stefan Milius, Lutz Schröder:
Weak Similarity in Higher-Order Mathematical Operational Semantics. CoRR abs/2302.08200 (2023) - [i62]Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
COOL 2 - A Generic Reasoner for Modal Fixpoint Logics. CoRR abs/2305.11015 (2023) - [i61]Merlin Humml, Lutz Schröder, Dirk Pattinson:
The Alternating-Time μ-Calculus With Disjunctive Explicit Strategies. CoRR abs/2305.18795 (2023) - [i60]Jonas Forster, Lutz Schröder, Paul Wild:
Quantitative Graded Semantics and Spectra of Behavioural Metrics. CoRR abs/2306.01487 (2023) - [i59]Jonas Forster, Lutz Schröder, Paul Wild, Harsh Beohar, Sebastian Gurke, Barbara König, Karla Messing:
Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras. CoRR abs/2307.14826 (2023) - [i58]Harsh Beohar, Sebastian Gurke, Barbara König, Karla Messing, Jonas Forster, Lutz Schröder, Paul Wild:
Expressive Quantale-valued Logics for Coalgebras: an Adjunction-based Approach. CoRR abs/2310.05711 (2023) - [i57]Daniel Hausmann, Merlin Humml, Simon Prucker, Lutz Schröder, Aaron Strahlberger:
Generic Model Checking for Modal Fixpoint Logics in COOL-MC. CoRR abs/2311.01315 (2023) - 2022
- [j45]Paul Wild, Lutz Schröder:
Characteristic Logics for Behavioural Hemimetrics via Fuzzy Lax Extensions. Log. Methods Comput. Sci. 18(2) (2022) - [j44]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence. Log. Methods Comput. Sci. 18(4) (2022) - [j43]Clemens Kupke, Dirk Pattinson, Lutz Schröder:
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics. ACM Trans. Comput. Log. 23(2): 11:1-11:34 (2022) - [c112]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Stateful Structural Operational Semantics. FSCD 2022: 30:1-30:19 - [c111]Chase Ford, Stefan Milius, Lutz Schröder, Harsh Beohar, Barbara König:
Graded Monads and Behavioural Equivalence Games. LICS 2022: 61:1-61:13 - [e2]Patricia Bouyer, Lutz Schröder:
Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings. Lecture Notes in Computer Science 13242, Springer 2022, ISBN 978-3-030-99252-1 [contents] - [i56]Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
Quantalic Behavioural Distances. CoRR abs/2202.07069 (2022) - [i55]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Stateful Structural Operational Semantics. CoRR abs/2202.10866 (2022) - [i54]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence. CoRR abs/2203.11175 (2022) - [i53]Harsh Beohar, Chase Ford, Barbara König, Stefan Milius, Lutz Schröder:
Graded Monads and Behavioural Equivalence Games. CoRR abs/2203.15467 (2022) - [i52]Fatemeh Seifan, Lutz Schröder, Dirk Pattinson:
Uniform Interpolation in Coalgebraic Modal Logic. CoRR abs/2205.00448 (2022) - [i51]Jonas Forster, Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
Quantitative Hennessy-Milner Theorems via Notions of Density. CoRR abs/2207.09187 (2022) - [i50]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Towards a Higher-Order Mathematical Operational Semantics. CoRR abs/2210.13387 (2022) - [i49]Merlin Humml, Lutz Schröder:
Common Knowledge of Abstract Groups. CoRR abs/2211.16284 (2022) - [i48]Daniel Hausmann, Lutz Schröder:
Coalgebraic Satisfiability Checking for Arithmetic μ-Calculi. CoRR abs/2212.11055 (2022) - 2021
- [j42]Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius, Lutz Schröder:
From generic partition refinement to weighted tree automata minimization. Formal Aspects Comput. 33(4-5): 695-727 (2021) - [j41]Natalie Dykes, Stefan Evert, Merlin Göttlinger, Philipp Heinrich, Lutz Schröder:
Argument parsing via corpus queries. it Inf. Technol. 63(1): 31-44 (2021) - [j40]Jirí Adámek, Chase Ford, Stefan Milius, Lutz Schröder:
Finitary monads on the category of posets. Math. Struct. Comput. Sci. 31(7): 799-821 (2021) - [j39]Sergey Goncharov, Christoph Rauch, Lutz Schröder:
A metalanguage for guarded iteration. Theor. Comput. Sci. 880: 111-137 (2021) - [c110]Chase Ford, Stefan Milius, Lutz Schröder:
Monads on Categories of Relational Structures. CALCO 2021: 14:1-14:17 - [c109]Henning Urbat, Daniel Hausmann, Stefan Milius, Lutz Schröder:
Nominal Büchi Automata with Name Allocation. CONCUR 2021: 4:1-4:16 - [c108]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Explaining Behavioural Inequivalence Generically in Quasilinear Time. CONCUR 2021: 32:1-32:18 - [c107]Merlin Göttlinger, Lutz Schröder, Dirk Pattinson:
The Alternating-Time μ-Calculus with Disjunctive Explicit Strategies. CSL 2021: 26:1-26:22 - [c106]Paul Wild, Lutz Schröder:
A Quantified Coalgebraic van Benthem Theorem. FoSSaCS 2021: 551-571 - [c105]Chase Ford, Stefan Milius, Lutz Schröder:
Behavioural Preorders via Graded Monads. LICS 2021: 1-13 - [c104]Daniel Hausmann, Stefan Milius, Lutz Schröder:
A Linear-Time Nominal μ-Calculus with Name Allocation. MFCS 2021: 58:1-58:18 - [c103]Daniel Hausmann, Lutz Schröder:
Quasipolynomial Computation of Nested Fixpoints. TACAS (1) 2021: 38-56 - [i47]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Explaining Behavioural Inequivalence Generically in Quasilinear Time. CoRR abs/2105.00669 (2021) - [i46]Henning Urbat, Daniel Hausmann, Stefan Milius, Lutz Schröder:
Nominal Büchi Automata with Name Allocation. CoRR abs/2107.03213 (2021) - [i45]Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
A Point-free Perspective on Lax extensions and Predicate liftings. CoRR abs/2112.12681 (2021) - 2020
- [j38]Natalie Dykes, Stefan Evert, Merlin Göttlinger, Philipp Heinrich, Lutz Schröder:
Reconstructing Arguments from Noisy Text. Datenbank-Spektrum 20(2): 123-129 (2020) - [j37]Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Efficient and Modular Coalgebraic Partition Refinement. Log. Methods Comput. Sci. 16(1) (2020) - [c102]Jonas Forster, Lutz Schröder:
Non-Iterative Modal Logics Are Coalgebraic. AiML 2020: 229-248 - [c101]Daniel Hausmann, Lutz Schröder:
NP Reasoning in the Monotone μ-Calculus. IJCAR (1) 2020: 482-499 - [c100]Barbara König, Christina Mika-Michalski, Lutz Schröder:
Explaining Non-bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas. CMCS 2020: 133-154 - [c99]Paul Wild, Lutz Schröder:
Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions. CONCUR 2020: 27:1-27:23 - [c98]Henning Urbat, Lutz Schröder:
Automata Learning: An Algebraic Approach. LICS 2020: 900-914 - [i44]Daniel Hausmann, Lutz Schröder:
NP Reasoning in the Monotone $μ$-Calculus. CoRR abs/2002.05075 (2020) - [i43]Barbara König, Christina Mika-Michalski, Lutz Schröder:
Explaining Non-Bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas. CoRR abs/2002.11459 (2020) - [i42]Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius, Lutz Schröder:
From Generic Partition Refinement to Weighted Tree Automata Minimization. CoRR abs/2004.01250 (2020) - [i41]Jonas Forster, Lutz Schröder:
Non-iterative Modal Logics are Coalgebraic. CoRR abs/2006.05396 (2020) - [i40]Paul Wild, Lutz Schröder:
Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions. CoRR abs/2007.01033 (2020) - [i39]Clemens Kupke, Dirk Pattinson, Lutz Schröder:
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics. CoRR abs/2009.00971 (2020) - [i38]Daniel Hausmann, Stefan Milius, Lutz Schröder:
Harnessing LTL With Freeze Quantification. CoRR abs/2010.10912 (2020) - [i37]Chase Ford, Stefan Milius, Lutz Schröder:
Behavioural Preorders via Graded Monads. CoRR abs/2011.14339 (2020)
2010 – 2019
- 2019
- [j36]Stefan Evert, Philipp Heinrich, Klaus Henselmann, Ulrich Rabenstein, Elisabeth Scherr, Martin Schmitt, Lutz Schröder:
Combining Machine Learning and Semantic Features in the Classification of Corporate Disclosures. J. Log. Lang. Inf. 28(2): 309-330 (2019) - [j35]Sergey Goncharov, Lutz Schröder, Christoph Rauch, Maciej Piróg:
Guarded and Unguarded Iteration for Generalized Processes. Log. Methods Comput. Sci. 15(3) (2019) - [c97]Daniel Hausmann, Lutz Schröder:
Game-Based Local Model Checking for the Coalgebraic mu-Calculus. CONCUR 2019: 35:1-35:16 - [c96]Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum. CONCUR 2019: 36:1-36:16 - [c95]Hans-Peter Deifel, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Generic Partition Refinement and Weighted Tree Automata. FM 2019: 280-297 - [c94]Daniel Hausmann, Lutz Schröder:
Optimal Satisfiability Checking for Arithmetic \mu -Calculi. FoSSaCS 2019: 277-294 - [c93]Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König:
A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic. IJCAI 2019: 1900-1906 - [i36]Daniel Hausmann, Lutz Schröder:
Optimal Satisfiability Checking for Arithmetic μ-Calculi. CoRR abs/1901.04893 (2019) - [i35]Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König:
A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic. CoRR abs/1906.00784 (2019) - [i34]Daniel Hausmann, Lutz Schröder:
Computing Nested Fixpoints in Quasipolynomial Time. CoRR abs/1907.07020 (2019) - [i33]Henning Urbat, Lutz Schröder:
Automata Learning: An Algebraic Approach. CoRR abs/1911.00874 (2019) - 2018
- [j34]Stefan Kraus, Marc Rosenbauer, Lutz Schröder, Thomas Bürkle, Klaus-Peter Adlassnig, Dennis Toddenroth:
A detailed analysis of the Arden Syntax expression grammar. J. Biomed. Informatics 83: 196-203 (2018) - [j33]Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder:
Model Theory and Proof Theory of Coalgebraic Predicate Logic. Log. Methods Comput. Sci. 14(1) (2018) - [j32]Sergey Goncharov, Lutz Schröder, Christoph Rauch, Julian Jakob:
Unguarded Recursion on Coinductive Resumptions. Log. Methods Comput. Sci. 14(3) (2018) - [j31]Lutz Schröder, Yde Venema:
Completeness of Flat Coalgebraic Fixpoint Logics. ACM Trans. Comput. Log. 19(1): 4:1-4:34 (2018) - [c92]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages. CMCS 2018: 56-77 - [c91]Sergey Goncharov, Lutz Schröder:
Guarded Traced Categories. FoSSaCS 2018: 313-330 - [c90]Sergey Goncharov, Christoph Rauch, Lutz Schröder:
A Metalanguage for Guarded Iteration. ICTAC 2018: 191-210 - [c89]Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König:
A van Benthem Theorem for Fuzzy Modal Logic. LICS 2018: 909-918 - [c88]Daniel Hausmann, Lutz Schröder, Hans-Peter Deifel:
Permutation Games for the Weakly Aconjunctive \mu μ -Calculus. TACAS (2) 2018: 361-378 - [i32]Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König:
A van Benthem Theorem for Fuzzy Modal Logic. CoRR abs/1802.00478 (2018) - [i31]Sergey Goncharov, Lutz Schröder:
Guarded Traced Categories. CoRR abs/1802.08756 (2018) - [i30]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages. CoRR abs/1805.07211 (2018) - [i29]Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Efficient and Modular Coalgebraic Partition Refinement. CoRR abs/1806.05654 (2018) - [i28]Sergey Goncharov, Christoph Rauch, Lutz Schröder:
A Metalanguage for Guarded Iteration. CoRR abs/1807.11256 (2018) - [i27]Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König:
A van Benthem Theorem for Quantitative Probabilistic Modal Logic. CoRR abs/1810.04722 (2018) - [i26]Hans-Peter Deifel, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
CoPaR: An Efficient Generic Partition Refiner. CoRR abs/1811.08850 (2018) - [i25]Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Graded Monads for the Linear Time - Branching Time Spectrum. CoRR abs/1812.01317 (2018) - [i24]Merlin Göttlinger, Lutz Schröder:
Trichotomic Argumentation Representation. CoRR abs/1812.06745 (2018) - 2017
- [j30]Víctor Gutiérrez-Basulto, Jean Christoph Jung, Carsten Lutz, Lutz Schröder:
Probabilistic Description Logics for Subjective Uncertainty. J. Artif. Intell. Res. 58: 1-66 (2017) - [j29]Lutz Schröder, Dirk Pattinson, Tadeusz Litak:
A Van Benthem/Rosen theorem for coalgebraic predicate logic. J. Log. Comput. 27(3): 749-773 (2017) - [c87]Fatemeh Seifan, Lutz Schröder, Dirk Pattinson:
Uniform Interpolation in Coalgebraic Modal Logic. CALCO 2017: 21:1-21:16 - [c86]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Efficient Coalgebraic Partition Refinement. CONCUR 2017: 32:1-32:16 - [c85]Hans-Peter Deifel, Merlin Göttlinger, Stefan Milius, Lutz Schröder, Christian Dietrich, Daniel Lohmann:
Automatic verification of application-tailored OSEK kernels. FMCAD 2017: 196-203 - [c84]Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann:
Nominal Automata with Name Binding. FoSSaCS 2017: 124-142 - [c83]Sergey Goncharov, Lutz Schröder, Christoph Rauch, Maciej Piróg:
Unifying Guarded and Unguarded Iteration. FoSSaCS 2017: 517-533 - [c82]Paul Wild, Lutz Schröder:
A Characterization Theorem for a Modal Description Logic. IJCAI 2017: 1304-1310 - [c81]Daniel Gorín, Malte Meyn, Alexander Naumann, Miriam Polzer, Ulrich Rabenstein, Lutz Schröder:
Ontological Modelling of a Psychiatric Clinical Practice Guideline. KI 2017: 300-308 - [i23]Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder:
Model Theory and Proof Theory of CPL. CoRR abs/1701.03773 (2017) - [i22]Paul Wild, Lutz Schröder:
A Characterization Theorem for a Modal Description Logic. CoRR abs/1705.06214 (2017) - [i21]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
A Coalgebraic Paige-Tarjan Algorithm. CoRR abs/1705.08362 (2017) - [i20]Daniel Hausmann, Lutz Schröder, Hans-Peter Deifel:
Permutation Games for the Weakly Aconjunctive mu-Calculus. CoRR abs/1710.08996 (2017) - [i19]Sergey Goncharov, Lutz Schröder, Christoph Rauch, Maciej Piróg:
Guarded and Unguarded Iteration for Generalized Processes. CoRR abs/1712.09574 (2017) - 2016
- [j28]Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Regular Behaviours with Names - On Rational Fixpoints of Endofunctors on Nominal Sets. Appl. Categorical Struct. 24(5): 663-701 (2016) - [c80]Daniel Hausmann, Lutz Schröder, Christoph Egger:
Global Caching for the Alternation-free μ-Calculus. CONCUR 2016: 34:1-34:15 - [c79]Dirk Pattinson, Lutz Schröder:
Program Equivalence is Coinductive. LICS 2016: 337-346 - [c78]Christoph Rauch, Sergey Goncharov, Lutz Schröder:
Generic Hoare Logic for Order-Enriched Effects with Exceptions. WADT 2016: 208-222 - [i18]Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann:
Nominal Automata with Name Binding. CoRR abs/1603.01455 (2016) - [i17]Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Regular Behaviours with Names. CoRR abs/1607.07828 (2016) - [i16]Daniel Hausmann, Lutz Schröder, Christoph Egger:
Global Caching for the Alternation-free μ-Calculus. CoRR abs/1609.06379 (2016) - 2015
- [j27]