Lutz Straßburger
56
Documents
Affiliations actuelles
- 118511
Identifiants chercheurs
- lutz-strassburger
- 0000-0003-4661-6540
- Google Scholar : xSTwY3MAAAAJ
Publications
|
Intuitionistic S4 is decidableLICS 2023- 38th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2023, Boston, United States. pp.1-13, ⟨10.1109/LICS56636.2023.10175684⟩
Communication dans un congrès
hal-04267899v1
|
|
BV and Pomset Logic Are Not the SameCSL 2022 - 30th EACSL Annual Conference on Computer Science Logic, Feb 2022, Göttingen, Germany. ⟨10.4230/LIPIcs.CSL.2022.32⟩
Communication dans un congrès
hal-03909463v1
|
|
A Graphical Proof Theory of Logical TimeFSCD 2022 - 7th International Conference on Formal Structures for Computation and Deduction, Aug 2022, Haifa, Israel. ⟨10.4230/LIPIcs.FSCD.2022.22⟩
Communication dans un congrès
hal-03909486v1
|
|
Combinatorial Flows as Bicolored Atomic FlowsWoLLIC 2022 - 28th Workshop on Logic, Language, Information and Computation, Sep 2022, Iaşi, Romania. pp.141-157, ⟨10.1007/978-3-031-15298-6_9⟩
Communication dans un congrès
hal-03909530v1
|
|
Taming Bounded Depth with Nested SequentsAIML 2022 - Advances in Modal Logic, Aug 2022, Rennes, France
Communication dans un congrès
hal-03909534v1
|
|
Combinatorial Proofs for Constructive Modal LogicAiML 2022 - Advances in Modal Logic, Aug 2022, Rennes, France
Communication dans un congrès
hal-03909538v1
|
|
Normalization Without SyntaxFSCD 2022, Aug 2022, Haifa, Israel
Communication dans un congrès
hal-03654060v1
|
|
Game Semantics for Constructive Modal LogicTABLEAUX 2021 - 30th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Sep 2021, Birmingham, United Kingdom. pp.428-445, ⟨10.1007/978-3-030-86059-2_25⟩
Communication dans un congrès
hal-03369819v1
|
|
Demo Paper: Coqlex, an approach to generate verified lexersML 2021-ACM SIGPLAN Workshop on ML, Aug 2021, Online event, United States
Communication dans un congrès
hal-03470713v1
|
|
Combinatorial Proofs and Decomposition Theorems for First-order Logic2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2021, Rome, Italy. pp.1-13, ⟨10.1109/LICS52264.2021.9470579⟩
Communication dans un congrès
hal-03369764v1
|
|
Logic beyond formulas: a proof system on graphsLICS 2020 - 35th ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.38-52, ⟨10.1145/3373718.3394763⟩
Communication dans un congrès
hal-02560105v1
|
|
MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description)IJCAR 2020 - 10th International Joint Conference, Jul 2020, Paris, France. pp.398-407, ⟨10.1007/978-3-030-51054-1_25⟩
Communication dans un congrès
hal-02457240v3
|
|
Intuitionistic proofs without syntaxLICS 2019 - 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1-13, ⟨10.1109/LICS.2019.8785827⟩
Communication dans un congrès
hal-02386878v1
|
|
Towards a Combinatorial Proof TheoryTABLEAUX 2019 - 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Sep 2019, London, United Kingdom. pp.259-276, ⟨10.1007/978-3-030-29026-9_15⟩
Communication dans un congrès
hal-02390417v1
|
|
On Combinatorial Proofs for Logics of Relevance and EntailmentWoLLIC 2019 - 26th International Workshop on Logic, Language, Information, and Computation, Jul 2019, Utrecht, Netherlands. pp.1-16, ⟨10.1007/978-3-662-59533-6_1⟩
Communication dans un congrès
hal-02390426v1
|
|
On Combinatorial Proofs for Modal LogicTABLEAUX 2019 - 28t International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Sep 2019, London, United Kingdom. pp.223-240, ⟨10.1007/978-3-030-29026-9_13⟩
Communication dans un congrès
hal-02390400v1
|
|
Proof Nets for First-Order Additive Linear LogicFSCD 2019 - 4th International Conference on Formal Structures for Computation and Deduction, Jun 2019, Dortmund, Germany. pp.22:1-22:22, ⟨10.4230/LIPIcs.FSCD.2019.22⟩
Communication dans un congrès
hal-02386942v1
|
|
Proof theory for indexed nested sequentsTABLEAUX 2017 - Automated Reasoning with Analytic Tableaux and Related Methods, Sep 2017, Brasilia, Brazil. pp.81-97
Communication dans un congrès
hal-01635935v1
|
|
Combinatorial Flows and their Normalisation FSCD 2017 - 2nd International Conference on Formal Structures for Computation and Deduction, Sep 2017, Oxford, United Kingdom. pp.311 - 3117, ⟨10.4230/LIPIcs.FSCD.2017.31⟩
Communication dans un congrès
hal-01635931v1
|
|
On the Length of Medial-Switch-Mix DerivationsWoLLIC 2017 - Logic, Language, Information, and Computation, Jul 2017, London, United Kingdom
Communication dans un congrès
hal-01635933v1
|
Non-crossing Tree Realizations of Ordered Degree SequencesLACL 2016 - 9th International Conference Logical Aspects of Computational Linguistics - Celebrating 20 Years of LACL (1996–2016), Dec 2016, Nancy, France. ⟨10.1007/978-3-662-53826-5_13⟩
Communication dans un congrès
hal-01417567v1
|
|
|
Parametricity and Proving Free Theorems for Functional-Logic LanguagesPrinciples and Practice of Declarative Programming, PPDP 2014, Sep 2014, Canterbury, United Kingdom. ⟨10.1145/2643135.2643147⟩
Communication dans un congrès
hal-01092357v1
|
|
Cut Elimination in Nested Sequents for Intuitionistic Modal LogicsFoSSaCS 2013, Mar 2013, Rome, Italy. pp.209-224, ⟨10.1007/978-3-642-37075-5_14⟩
Communication dans un congrès
hal-00770678v1
|
|
Herbrand-Confluence for Cut Elimination in Classical First Order LogicCSL 2012, Sep 2012, Fontainebleau, France. ⟨10.4230/LIPIcs.CSL.2012.320⟩
Communication dans un congrès
hal-00759228v1
|
|
The Focused Calculus of Structures20th EACSL Annual Conference on Computer Science Logic, Sep 2011, Bergen, Norway. pp.159-173, ⟨10.4230/LIPIcs.CSL.2011.159⟩
Communication dans un congrès
hal-00772420v1
|
|
What is the Problem with Proof Nets for Classical Logic ?Computability in Europe 2010, Jun 2010, Ponta Delgada, Portugal
Communication dans un congrès
hal-00772608v1
|
|
Breaking Paths in Atomic Flows for Classical LogicProceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, Jul 2010, Edinburgh, United Kingdom. pp.284-293, ⟨10.1109/LICS.2010.12⟩
Communication dans un congrès
hal-00541076v1
|
|
A Characterisation of Medial as Rewriting RuleRTA 2007, Jun 2007, Paris, France
Communication dans un congrès
inria-00165997v1
|
|
Deep Inference for Hybrid LogicInternational Workshop on Hybrid Logic 2007 (HyLo 2007), Aug 2007, Dublin, Ireland
Communication dans un congrès
inria-00165998v1
|
|
What could a Boolean category be?Classical Logic and Computation 2006 (ICALP Workshop), Jul 2006, Venice, Italy
Communication dans un congrès
inria-00130504v1
|
|
From Deep Inference to Proof NetsStructures and Deduction 2005 (ICALP Workshop), Jul 2005, Lisbon, Portugal
Communication dans un congrès
inria-00130501v1
|
|
Constructing free Boolean categories20th Annual IEEE Symposium on Logic in Computer Science - LICS 2005, May 2005, Chicago/USA, United States. pp.209- 218, ⟨10.1109/LICS.2005.13⟩
Communication dans un congrès
hal-00012296v2
|
|
From Syntactic Proofs to Combinatorial ProofsInternational Joint Conference on Automated Reasoning, IJCAR 2018, Springer, pp.481-497, 2018, 978-3-319-94204-9
Chapitre d'ouvrage
hal-01942275v1
|
|
What is a logic, and what is a proof ?Jean-Yves Beziau. Logica Universalis, Birkhäuser, pp.135-145, 2005, 978-3-7643-7259-0
Chapitre d'ouvrage
inria-00130523v1
|
|
A System of Interaction and Structure III: The Complexity of BV and Pomset LogicLogical Methods in Computer Science, 2023, 9 (4), ⟨10.46298/LMCS-19(4:25)2023⟩
Article dans une revue
hal-03909547v2
|
|
Coqlex: Generating Formally Verified LexersThe Art, Science, and Engineering of Programming, 2023, 8 (1), ⟨10.22152/programming-journal.org/2024/8/3⟩
Article dans une revue
hal-03912170v2
|
|
An Analytic Propositional Proof System On GraphsLogical Methods in Computer Science, 2022, 18 (4), ⟨10.46298/LMCS-18(4:1)2022⟩
Article dans une revue
hal-03087392v2
|
|
A fully labelled proof system for intuitionistic modal logicsJournal of Logic and Computation, 2021, 31 (3), pp.998-1022. ⟨10.1093/logcom/exab020⟩
Article dans une revue
hal-02390454v3
|
|
Maehara-style modal nested calculiArchive for Mathematical Logic, 2019, 58 (3-4), pp.359-385. ⟨10.1007/s00153-018-0636-1⟩
Article dans une revue
hal-01942240v1
|
|
Deep inference and expansion trees for second-order multiplicative linear logicMathematical Structures in Computer Science, 2019, Special Issue 8 (A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller’s 60th birthday), 29, pp.1030-1060. ⟨10.1017/S0960129518000385⟩
Article dans une revue
hal-01942410v1
|
|
On the decision problem for MELLTheoretical Computer Science, 2019, 768, pp.91-98. ⟨10.1016/j.tcs.2019.02.022⟩
Article dans une revue
hal-02386746v1
|
The problem of proof identity, and why computer scientists should care about Hilbert's 24th problemPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2019, 377 (2140), pp.20180038. ⟨10.1098/rsta.2018.0038⟩
Article dans une revue
hal-02475417v1
|
|
On the Power of Substitution in the Calculus of StructuresACM Transactions on Computational Logic, 2015, 16 (3), ⟨10.1145/2701424⟩
Article dans une revue
hal-00925707v1
|
|
Herbrand-ConfluenceLogical Methods in Computer Science, 2013, 9 (4), pp.1-25. ⟨10.2168/LMCS-9(4:24)2013⟩
Article dans une revue
hal-00925641v1
|
|
|
Extension without CutAnnals of Pure and Applied Logic, 2012, 163 (12), pp.1995-2007. ⟨10.1016/j.apal.2012.07.004⟩
Article dans une revue
hal-00759215v1
|
From Deep Inference to Proof Nets via Cut EliminationJournal of Logic and Computation, 2011, 21 (4), pp.589-624. ⟨10.1093/logcom/exp047⟩
Article dans une revue
hal-00772603v1
|
|
On the Axiomatisation of Boolean Categories with and without Medial2006
Autre publication scientifique
inria-00130508v1
|
|
On the Decision Problem for MELL[Research Report] 9203, Inria Saclay Ile de France. 2018
Rapport
hal-01870148v1
|
|
Proof nets for first-order additive linear logic[Research Report] RR-9201, Inria. 2018
Rapport
hal-01867625v1
|
|
Maehara-style Modal Nested Calculi[Research Report] RR-9123, Inria Saclay. 2017
Rapport
hal-01644750v1
|
|
Non-crossing tree realizations of ordered degree sequences[Research Report] 2009, pp.15
Rapport
hal-00649591v1
|
|
Proof Nets and the Identity of Proofs[Research Report] RR-6013, INRIA. 2006
Rapport
inria-00107260v3
|
|
From Proof Nets to Combinatorial Proofs - A New Approach to Hilbert's 24th ProblemÉcole thématique. From Proof Nets to Combinatorial Proofs - A New Approach to Hilbert's 24th Problem, Utrecht / Virtual, Netherlands. 2021
Cours
hal-03316571v1
|
|
Introduction to Deep InferenceÉcole thématique. Introduction to Deep Inference, Riga, Latvia. 2019
Cours
hal-02390267v1
|
|
Justification logic for constructive modal logic *IMLA 2017 - 7th Workshop on Intuitionistic Modal Logic and Applications, Jul 2017, Toulouse, France. , 2017
Document associé à des manifestations scientifiques
hal-01614707v1
|
|
Towards a Theory of Proofs of Classical LogicLogic in Computer Science [cs.LO]. Université Paris-Diderot - Paris VII, 2011
HDR
tel-00772590v1
|