@Proceedings{klin_et_al:LIPIcs.CSL.2023,
title = {{LIPIcs, Volume 252, CSL 2023, Complete Volume}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {1--718},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023},
URN = {urn:nbn:de:0030-drops-174603},
doi = {10.4230/LIPIcs.CSL.2023},
annote = {Keywords: LIPIcs, Volume 252, CSL 2023, Complete Volume}
}
@InProceedings{klin_et_al:LIPIcs.CSL.2023.0,
author = {Klin, Bartek and Pimentel, Elaine},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {0:i--0:xviii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.0},
URN = {urn:nbn:de:0030-drops-174614},
doi = {10.4230/LIPIcs.CSL.2023.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{faggian:LIPIcs.CSL.2023.1,
author = {Faggian, Claudia},
title = {{Asymptotic Rewriting}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {1:1--1:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.1},
URN = {urn:nbn:de:0030-drops-174621},
doi = {10.4230/LIPIcs.CSL.2023.1},
annote = {Keywords: rewriting, probabilistic rewriting, confluence, strategies, asymptotic normalization, lambda calculus}
}
@InProceedings{gierasimczuk:LIPIcs.CSL.2023.2,
author = {Gierasimczuk, Nina},
title = {{Inductive Inference and Epistemic Modal Logic}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {2:1--2:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.2},
URN = {urn:nbn:de:0030-drops-174634},
doi = {10.4230/LIPIcs.CSL.2023.2},
annote = {Keywords: modal logic, dynamic epistemic logic, inductive inference, topological semantics, computational learning theory, finite identifiability, identifiability in the limit}
}
@InProceedings{miller_et_al:LIPIcs.CSL.2023.3,
author = {Miller, Dale and Wu, Jui-Hsuan},
title = {{A Positive Perspective on Term Representation}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {3:1--3:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.3},
URN = {urn:nbn:de:0030-drops-174648},
doi = {10.4230/LIPIcs.CSL.2023.3},
annote = {Keywords: term representation, sharing, focused proof systems}
}
@InProceedings{sangiorgi:LIPIcs.CSL.2023.4,
author = {Sangiorgi, Davide},
title = {{Enhanced Induction in Behavioural Relations}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {4:1--4:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.4},
URN = {urn:nbn:de:0030-drops-174658},
doi = {10.4230/LIPIcs.CSL.2023.4},
annote = {Keywords: coinduction, induction, semantics, behavioural relations}
}
@InProceedings{afshari_et_al:LIPIcs.CSL.2023.5,
author = {Afshari, Bahareh and Leigh, Graham E. and Men\'{e}ndez Turata, Guillermo},
title = {{A Cyclic Proof System for Full Computation Tree Logic}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {5:1--5:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.5},
URN = {urn:nbn:de:0030-drops-174664},
doi = {10.4230/LIPIcs.CSL.2023.5},
annote = {Keywords: Full computation tree logic, Hypersequent calculus, Cyclic proofs}
}
@InProceedings{alvarezpicallo_et_al:LIPIcs.CSL.2023.6,
author = {Alvarez-Picallo, Mario and Ghica, Dan and Sprunger, David and Zanasi, Fabio},
title = {{Functorial String Diagrams for Reverse-Mode Automatic Differentiation}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {6:1--6:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.6},
URN = {urn:nbn:de:0030-drops-174674},
doi = {10.4230/LIPIcs.CSL.2023.6},
annote = {Keywords: string diagrams, automatic differentiation, hierarchical hypergraphs}
}
@InProceedings{baldan_et_al:LIPIcs.CSL.2023.7,
author = {Baldan, Paolo and Eggert, Richard and K\"{o}nig, Barbara and Padoan, Tommaso},
title = {{A Lattice-Theoretical View of Strategy Iteration}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {7:1--7:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.7},
URN = {urn:nbn:de:0030-drops-174680},
doi = {10.4230/LIPIcs.CSL.2023.7},
annote = {Keywords: games, strategy iteration, fixpoints, energy games, behavioural metrics}
}
@InProceedings{barenbaum_et_al:LIPIcs.CSL.2023.8,
author = {Barenbaum, Pablo and Bonelli, Eduardo},
title = {{Reductions in Higher-Order Rewriting and Their Equivalence}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {8:1--8:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.8},
URN = {urn:nbn:de:0030-drops-174694},
doi = {10.4230/LIPIcs.CSL.2023.8},
annote = {Keywords: Term Rewriting, Higher-Order Rewriting, Proof terms, Equivalence of Computations}
}
@InProceedings{barenbaum_et_al:LIPIcs.CSL.2023.9,
author = {Barenbaum, Pablo and Freund, Teodoro},
title = {{Proofs and Refutations for Intuitionistic and Second-Order Logic}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {9:1--9:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.9},
URN = {urn:nbn:de:0030-drops-174707},
doi = {10.4230/LIPIcs.CSL.2023.9},
annote = {Keywords: lambda-calculus, propositions-as-types, classical logic, proof normalization}
}
@InProceedings{barrett_et_al:LIPIcs.CSL.2023.10,
author = {Barrett, Chris and Heijltjes, Willem and McCusker, Guy},
title = {{The Functional Machine Calculus II: Semantics}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {10:1--10:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.10},
URN = {urn:nbn:de:0030-drops-174716},
doi = {10.4230/LIPIcs.CSL.2023.10},
annote = {Keywords: lambda-calculus, computational effects, denotational semantics, strong normalization}
}
@InProceedings{bazhenov_et_al:LIPIcs.CSL.2023.11,
author = {Bazhenov, Nikolay and Kaloci\'{n}ski, Dariusz},
title = {{Degree Spectra, and Relative Acceptability of Notations}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {11:1--11:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.11},
URN = {urn:nbn:de:0030-drops-174725},
doi = {10.4230/LIPIcs.CSL.2023.11},
annote = {Keywords: Computable structure theory, Degree spectra, \omega-type order, C.e. degrees, \Delta₂ degrees, Acceptable notation, Successor, Learnability}
}
@InProceedings{beohar_et_al:LIPIcs.CSL.2023.12,
author = {Beohar, Harsh and Gurke, Sebastian and K\"{o}nig, Barbara and Messing, Karla},
title = {{Hennessy-Milner Theorems via Galois Connections}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {12:1--12:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.12},
URN = {urn:nbn:de:0030-drops-174735},
doi = {10.4230/LIPIcs.CSL.2023.12},
annote = {Keywords: behavioural equivalences and metrics, modal logics, Galois connections}
}
@InProceedings{chardonnet_et_al:LIPIcs.CSL.2023.13,
author = {Chardonnet, Kostia and Saurin, Alexis and Valiron, Beno\^{i}t},
title = {{A Curry-Howard Correspondence for Linear, Reversible Computation}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {13:1--13:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.13},
URN = {urn:nbn:de:0030-drops-174747},
doi = {10.4230/LIPIcs.CSL.2023.13},
annote = {Keywords: Reversible Computation, Linear Logic, Curry-Howard}
}
@InProceedings{cirstea_et_al:LIPIcs.CSL.2023.14,
author = {C\^{i}rstea, Corina and Kupke, Clemens},
title = {{Measure-Theoretic Semantics for Quantitative Parity Automata}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {14:1--14:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.14},
URN = {urn:nbn:de:0030-drops-174755},
doi = {10.4230/LIPIcs.CSL.2023.14},
annote = {Keywords: parity automaton, coalgebra, measure theory}
}
@InProceedings{cohen_et_al:LIPIcs.CSL.2023.15,
author = {Cohen, Liron and Rahli, Vincent},
title = {{Realizing Continuity Using Stateful Computations}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {15:1--15:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.15},
URN = {urn:nbn:de:0030-drops-174761},
doi = {10.4230/LIPIcs.CSL.2023.15},
annote = {Keywords: Continuity, Stateful computations, Intuitionism, Extensional Type Theory, Constructive Type Theory, Realizability, Theorem proving, Agda}
}
@InProceedings{curzi_et_al:LIPIcs.CSL.2023.16,
author = {Curzi, Gianluca and Das, Anupam},
title = {{Non-Uniform Complexity via Non-Wellfounded Proofs}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {16:1--16:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.16},
URN = {urn:nbn:de:0030-drops-174770},
doi = {10.4230/LIPIcs.CSL.2023.16},
annote = {Keywords: Cyclic proofs, non-wellfounded proof-theory, non-uniform complexity, polynomial time, safe recursion, implicit complexity}
}
@InProceedings{dallago_et_al:LIPIcs.CSL.2023.17,
author = {Dal Lago, Ugo and Gavazzo, Francesco and Ghyselen, Alexis},
title = {{Open Higher-Order Logic}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {17:1--17:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.17},
URN = {urn:nbn:de:0030-drops-174785},
doi = {10.4230/LIPIcs.CSL.2023.17},
annote = {Keywords: Formal Verification, Relational Logic, First-Order Properties}
}
@InProceedings{delacroix_et_al:LIPIcs.CSL.2023.18,
author = {de Lacroix, C\'{e}dric and Santocanale, Luigi},
title = {{Frobenius Structures in Star-Autonomous Categories}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {18:1--18:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.18},
URN = {urn:nbn:de:0030-drops-174798},
doi = {10.4230/LIPIcs.CSL.2023.18},
annote = {Keywords: Quantale, Frobenius quantale, Girard quantale, associative algebra, star-autonomous category, nuclear object, adjoint}
}
@InProceedings{felicissimo_et_al:LIPIcs.CSL.2023.19,
author = {Felicissimo, Thiago and Blanqui, Fr\'{e}d\'{e}ric and Barnawal, Ashish Kumar},
title = {{Translating Proofs from an Impredicative Type System to a Predicative One}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {19:1--19:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.19},
URN = {urn:nbn:de:0030-drops-174801},
doi = {10.4230/LIPIcs.CSL.2023.19},
annote = {Keywords: Type Theory, Impredicativity, Predicativity, Proof Translation, Universe Polymorphism, Unification Modulo Max, Agda, Dedukti}
}
@InProceedings{fisman_et_al:LIPIcs.CSL.2023.20,
author = {Fisman, Dana and Grogin, Joshua and Weiss, Gera},
title = {{A Normalized Edit Distance on Infinite Words}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {20:1--20:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.20},
URN = {urn:nbn:de:0030-drops-174818},
doi = {10.4230/LIPIcs.CSL.2023.20},
annote = {Keywords: Edit Distance, Infinite Words, Robustness}
}
@InProceedings{forster_et_al:LIPIcs.CSL.2023.21,
author = {Forster, Yannick and Jahn, Felix},
title = {{Constructive and Synthetic Reducibility Degrees: Post’s Problem for Many-One and Truth-Table Reducibility in Coq}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {21:1--21:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.21},
URN = {urn:nbn:de:0030-drops-174820},
doi = {10.4230/LIPIcs.CSL.2023.21},
annote = {Keywords: type theory, computability theory, constructive mathematics, Coq}
}
@InProceedings{forster_et_al:LIPIcs.CSL.2023.22,
author = {Forster, Jonas and Goncharov, Sergey and Hofmann, Dirk and Nora, Pedro and Schr\"{o}der, Lutz and Wild, Paul},
title = {{Quantitative Hennessy-Milner Theorems via Notions of Density}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {22:1--22:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.22},
URN = {urn:nbn:de:0030-drops-174836},
doi = {10.4230/LIPIcs.CSL.2023.22},
annote = {Keywords: Behavioural distances, coalgebra, characteristic modal logics, density, Hennessy-Milner theorems, quantale-enriched categories, Stone-Weierstra{\ss} theorems}
}
@InProceedings{grange:LIPIcs.CSL.2023.23,
author = {Grange, Julien},
title = {{Order-Invariance in the Two-Variable Fragment of First-Order Logic}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {23:1--23:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.23},
URN = {urn:nbn:de:0030-drops-174846},
doi = {10.4230/LIPIcs.CSL.2023.23},
annote = {Keywords: Finite model theory, Two-variable logic, Order-invariance}
}
@InProceedings{hazard_et_al:LIPIcs.CSL.2023.24,
author = {Hazard, Emile and Kuperberg, Denis},
title = {{Explorable Automata}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {24:1--24:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.24},
URN = {urn:nbn:de:0030-drops-174852},
doi = {10.4230/LIPIcs.CSL.2023.24},
annote = {Keywords: Nondeterminism, automata, complexity}
}
@InProceedings{hella:LIPIcs.CSL.2023.25,
author = {Hella, Lauri},
title = {{The Expressive Power of CSP-Quantifiers}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {25:1--25:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.25},
URN = {urn:nbn:de:0030-drops-174867},
doi = {10.4230/LIPIcs.CSL.2023.25},
annote = {Keywords: generalized quantifiers, constraint satisfaction problems, pebble games, finite variable logics, descriptive complexity theory}
}
@InProceedings{jaakkola:LIPIcs.CSL.2023.26,
author = {Jaakkola, Reijo},
title = {{Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {26:1--26:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.26},
URN = {urn:nbn:de:0030-drops-174875},
doi = {10.4230/LIPIcs.CSL.2023.26},
annote = {Keywords: Polyadic modal logics, Boolean modal logics, Model checking, Satisfiability}
}
@InProceedings{jaakkola_et_al:LIPIcs.CSL.2023.27,
author = {Jaakkola, Reijo and Kuusisto, Antti},
title = {{Complexity Classifications via Algebraic Logic}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {27:1--27:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.27},
URN = {urn:nbn:de:0030-drops-174880},
doi = {10.4230/LIPIcs.CSL.2023.27},
annote = {Keywords: Decidability, complexity, algebraic logic, fragments of first-order logic}
}
@InProceedings{jacobs_et_al:LIPIcs.CSL.2023.28,
author = {Jacobs, Bart and Stein, Dario},
title = {{Counting and Matching}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {28:1--28:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.28},
URN = {urn:nbn:de:0030-drops-174892},
doi = {10.4230/LIPIcs.CSL.2023.28},
annote = {Keywords: List, Multiset, Partition, Crossing}
}
@InProceedings{kara_et_al:LIPIcs.CSL.2023.29,
author = {Kara, Ahmet and Nikolic, Milos and Olteanu, Dan and Zhang, Haozhe},
title = {{Evaluation Trade-Offs for Acyclic Conjunctive Queries}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {29:1--29:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.29},
URN = {urn:nbn:de:0030-drops-174907},
doi = {10.4230/LIPIcs.CSL.2023.29},
annote = {Keywords: acyclic queries, query evaluation, enumeration delay}
}
@InProceedings{kirst_et_al:LIPIcs.CSL.2023.30,
author = {Kirst, Dominik and Peters, Benjamin},
title = {{G\"{o}del’s Theorem Without Tears - Essential Incompleteness in Synthetic Computability}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {30:1--30:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.30},
URN = {urn:nbn:de:0030-drops-174911},
doi = {10.4230/LIPIcs.CSL.2023.30},
annote = {Keywords: incompleteness, undecidability, synthetic computability theory}
}
@InProceedings{pago:LIPIcs.CSL.2023.31,
author = {Pago, Benedikt},
title = {{Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {31:1--31:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.31},
URN = {urn:nbn:de:0030-drops-174923},
doi = {10.4230/LIPIcs.CSL.2023.31},
annote = {Keywords: finite model theory, proof complexity, graph isomorphism}
}
@InProceedings{pratthartmann_et_al:LIPIcs.CSL.2023.32,
author = {Pratt-Hartmann, Ian and Tendera, Lidia},
title = {{Adding Transitivity and Counting to the Fluted Fragment}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {32:1--32:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.32},
URN = {urn:nbn:de:0030-drops-174933},
doi = {10.4230/LIPIcs.CSL.2023.32},
annote = {Keywords: fluted logic, transitivity, counting, satisfiability, decidability, complexity}
}
@InProceedings{staniszewski:LIPIcs.CSL.2023.33,
author = {Staniszewski, Konrad},
title = {{Parity Games of Bounded Tree-Depth}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {33:1--33:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.33},
URN = {urn:nbn:de:0030-drops-174942},
doi = {10.4230/LIPIcs.CSL.2023.33},
annote = {Keywords: Parity Games, Circuits, Tree-Depth, Clique-Width}
}
@InProceedings{tanaka:LIPIcs.CSL.2023.34,
author = {Tanaka, Hiromi},
title = {{Tower-Complete Problems in Contraction-Free Substructural Logics}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {34:1--34:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.34},
URN = {urn:nbn:de:0030-drops-174954},
doi = {10.4230/LIPIcs.CSL.2023.34},
annote = {Keywords: substructural logic, linear logic, full Lambek calculus, BCK-logic, computational complexity, provability, deducibility}
}
@InProceedings{tschirbs_et_al:LIPIcs.CSL.2023.35,
author = {Tschirbs, Felix and Vortmeier, Nils and Zeume, Thomas},
title = {{Dynamic Complexity of Regular Languages: Big Changes, Small Work}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {35:1--35:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.35},
URN = {urn:nbn:de:0030-drops-174963},
doi = {10.4230/LIPIcs.CSL.2023.35},
annote = {Keywords: dynamic descriptive complexity, regular languages, batch changes, work}
}
@InProceedings{vilmart:LIPIcs.CSL.2023.36,
author = {Vilmart, Renaud},
title = {{Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {36:1--36:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.36},
URN = {urn:nbn:de:0030-drops-174974},
doi = {10.4230/LIPIcs.CSL.2023.36},
annote = {Keywords: Quantum Computation, Verification, Sum-Over-Paths, Rewrite Strategy, Toffoli-Hadamard, Completeness}
}
@InProceedings{wilson_et_al:LIPIcs.CSL.2023.37,
author = {Wilson, Paul and Ghica, Dan and Zanasi, Fabio},
title = {{String Diagrams for Non-Strict Monoidal Categories}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {37:1--37:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.37},
URN = {urn:nbn:de:0030-drops-174981},
doi = {10.4230/LIPIcs.CSL.2023.37},
annote = {Keywords: String Diagrams, Strictness, Coherence}
}
@InProceedings{wimann:LIPIcs.CSL.2023.38,
author = {Wi{\ss}mann, Thorsten},
title = {{Supported Sets - A New Foundation for Nominal Sets and Automata}},
booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)},
pages = {38:1--38:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-264-8},
ISSN = {1868-8969},
year = {2023},
volume = {252},
editor = {Klin, Bartek and Pimentel, Elaine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.38},
URN = {urn:nbn:de:0030-drops-174992},
doi = {10.4230/LIPIcs.CSL.2023.38},
annote = {Keywords: Nominal Sets, Monads, LFP-Category, Supported Sets, Coalgebra}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing