30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 1-684, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Proceedings{manea_et_al:LIPIcs.CSL.2022, title = {{LIPIcs, Volume 216, CSL 2022, Complete Volume}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {1--684}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022}, URN = {urn:nbn:de:0030-drops-157199}, doi = {10.4230/LIPIcs.CSL.2022}, annote = {Keywords: LIPIcs, Volume 216, CSL 2022, Complete Volume} }
30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 0:i-0:xx, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{manea_et_al:LIPIcs.CSL.2022.0, author = {Manea, Florin and Simpson, Alex}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {0:i--0:xx}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.0}, URN = {urn:nbn:de:0030-drops-157202}, doi = {10.4230/LIPIcs.CSL.2022.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Udi Boker. Between Deterministic and Nondeterministic Quantitative Automata (Invited Talk). In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 1:1-1:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{boker:LIPIcs.CSL.2022.1, author = {Boker, Udi}, title = {{Between Deterministic and Nondeterministic Quantitative Automata}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {1:1--1:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.1}, URN = {urn:nbn:de:0030-drops-157218}, doi = {10.4230/LIPIcs.CSL.2022.1}, annote = {Keywords: Quantitative Automata, Measure of Nondeterminism, Determinism} }
Natasha Fernandes, Annabelle McIver, and Carroll Morgan. How to Develop an Intuition for Risk... and Other Invisible Phenomena (Invited Talk). In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 2:1-2:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fernandes_et_al:LIPIcs.CSL.2022.2, author = {Fernandes, Natasha and McIver, Annabelle and Morgan, Carroll}, title = {{How to Develop an Intuition for Risk... and Other Invisible Phenomena}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {2:1--2:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.2}, URN = {urn:nbn:de:0030-drops-157227}, doi = {10.4230/LIPIcs.CSL.2022.2}, annote = {Keywords: Geometry, Quantitative Information Flow, Proof, Explainability, Privacy} }
Antonio Abu Nassar and Shaull Almagor. Simulation by Rounds of Letter-To-Letter Transducers. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 3:1-3:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{abunassar_et_al:LIPIcs.CSL.2022.3, author = {Abu Nassar, Antonio and Almagor, Shaull}, title = {{Simulation by Rounds of Letter-To-Letter Transducers}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {3:1--3:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.3}, URN = {urn:nbn:de:0030-drops-157231}, doi = {10.4230/LIPIcs.CSL.2022.3}, annote = {Keywords: Transducers, Permutations, Parikh, Simulation, Equivalence} }
Beniamino Accattoli and Maico Leberle. Useful Open Call-By-Need. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 4:1-4:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{accattoli_et_al:LIPIcs.CSL.2022.4, author = {Accattoli, Beniamino and Leberle, Maico}, title = {{Useful Open Call-By-Need}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {4:1--4:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.4}, URN = {urn:nbn:de:0030-drops-157242}, doi = {10.4230/LIPIcs.CSL.2022.4}, annote = {Keywords: lambda calculus, call-by-need, operational semantics, sharing, cost models} }
Martin Baillon, Assia Mahboubi, and Pierre-Marie Pédrot. Gardening with the Pythia A Model of Continuity in a Dependent Setting. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 5:1-5:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{baillon_et_al:LIPIcs.CSL.2022.5, author = {Baillon, Martin and Mahboubi, Assia and P\'{e}drot, Pierre-Marie}, title = {{Gardening with the Pythia A Model of Continuity in a Dependent Setting}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {5:1--5:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.5}, URN = {urn:nbn:de:0030-drops-157256}, doi = {10.4230/LIPIcs.CSL.2022.5}, annote = {Keywords: Type theory, continuity, syntactic model} }
Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, and Jean-Marc Talbot. Weighted Automata and Expressions over Pre-Rational Monoids. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{baudru_et_al:LIPIcs.CSL.2022.6, author = {Baudru, Nicolas and Dando, Louis-Marie and Lhote, Nathan and Monmege, Benjamin and Reynier, Pierre-Alain and Talbot, Jean-Marc}, title = {{Weighted Automata and Expressions over Pre-Rational Monoids}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {6:1--6:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.6}, URN = {urn:nbn:de:0030-drops-157266}, doi = {10.4230/LIPIcs.CSL.2022.6}, annote = {Keywords: Weighted Automata and Expressions, Inverse Monoids, Two-Way Automata} }
Benjamin Bordais, Patricia Bouyer, and Stéphane Le Roux. Optimal Strategies in Concurrent Reachability Games. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bordais_et_al:LIPIcs.CSL.2022.7, author = {Bordais, Benjamin and Bouyer, Patricia and Le Roux, St\'{e}phane}, title = {{Optimal Strategies in Concurrent Reachability Games}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {7:1--7:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.7}, URN = {urn:nbn:de:0030-drops-157278}, doi = {10.4230/LIPIcs.CSL.2022.7}, annote = {Keywords: Concurrent reachability games, Game forms, Optimal strategies} }
Patricia Bouyer, Stéphane Le Roux, and Nathan Thomasset. Finite-Memory Strategies in Two-Player Infinite Games. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 8:1-8:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bouyer_et_al:LIPIcs.CSL.2022.8, author = {Bouyer, Patricia and Le Roux, St\'{e}phane and Thomasset, Nathan}, title = {{Finite-Memory Strategies in Two-Player Infinite Games}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {8:1--8:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.8}, URN = {urn:nbn:de:0030-drops-157285}, doi = {10.4230/LIPIcs.CSL.2022.8}, annote = {Keywords: Two-player win/lose games, Infinite trees, Finite-memory winning strategies, Well partial orders, Hausdorff difference hierarchy} }
Matthew de Brecht. Constructing the Space of Valuations of a Quasi-Polish Space as a Space of Ideals. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 9:1-9:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{debrecht:LIPIcs.CSL.2022.9, author = {de Brecht, Matthew}, title = {{Constructing the Space of Valuations of a Quasi-Polish Space as a Space of Ideals}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {9:1--9:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.9}, URN = {urn:nbn:de:0030-drops-157293}, doi = {10.4230/LIPIcs.CSL.2022.9}, annote = {Keywords: Quasi-Polish spaces, space of valuations, domain theory, measure theory} }
Léonard Brice, Jean-François Raskin, and Marie van den Bogaard. On the Complexity of SPEs in Parity Games. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 10:1-10:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{brice_et_al:LIPIcs.CSL.2022.10, author = {Brice, L\'{e}onard and Raskin, Jean-Fran\c{c}ois and van den Bogaard, Marie}, title = {{On the Complexity of SPEs in Parity Games}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {10:1--10:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.10}, URN = {urn:nbn:de:0030-drops-157306}, doi = {10.4230/LIPIcs.CSL.2022.10}, annote = {Keywords: Games on graphs, subgame-perfect equilibria, parity objectives} }
Guillaume Brunerie, Axel Ljungström, and Anders Mörtberg. Synthetic Integral Cohomology in Cubical Agda. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 11:1-11:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{brunerie_et_al:LIPIcs.CSL.2022.11, author = {Brunerie, Guillaume and Ljungstr\"{o}m, Axel and M\"{o}rtberg, Anders}, title = {{Synthetic Integral Cohomology in Cubical Agda}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {11:1--11:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.11}, URN = {urn:nbn:de:0030-drops-157310}, doi = {10.4230/LIPIcs.CSL.2022.11}, annote = {Keywords: Synthetic Homotopy Theory, Cohomology Theory, Cubical Agda} }
Antonio Casares. On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{casares:LIPIcs.CSL.2022.12, author = {Casares, Antonio}, title = {{On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.12}, URN = {urn:nbn:de:0030-drops-157322}, doi = {10.4230/LIPIcs.CSL.2022.12}, annote = {Keywords: Automata on Infinite Words, Games on Graphs, Arena-Independent Memory, Complexity} }
Davide Castelnovo and Marino Miculan. Fuzzy Algebraic Theories. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 13:1-13:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{castelnovo_et_al:LIPIcs.CSL.2022.13, author = {Castelnovo, Davide and Miculan, Marino}, title = {{Fuzzy Algebraic Theories}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {13:1--13:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.13}, URN = {urn:nbn:de:0030-drops-157332}, doi = {10.4230/LIPIcs.CSL.2022.13}, annote = {Keywords: categorical logic, fuzzy sets, algebraic reasoning, equational axiomatisations, monads, Eilenberg-Moore algebras} }
Liang-Ting Chen and Hsiang-Shang Ko. Realising Intensional S4 and GL Modalities. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chen_et_al:LIPIcs.CSL.2022.14, author = {Chen, Liang-Ting and Ko, Hsiang-Shang}, title = {{Realising Intensional S4 and GL Modalities}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {14:1--14:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.14}, URN = {urn:nbn:de:0030-drops-157341}, doi = {10.4230/LIPIcs.CSL.2022.14}, annote = {Keywords: provability, guarded recursion, realisability, modal types, metaprogramming} }
Carmen Constantin, Nuiok Dicaire, and Chris Heunen. Localisable Monads. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 15:1-15:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{constantin_et_al:LIPIcs.CSL.2022.15, author = {Constantin, Carmen and Dicaire, Nuiok and Heunen, Chris}, title = {{Localisable Monads}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {15:1--15:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.15}, URN = {urn:nbn:de:0030-drops-157353}, doi = {10.4230/LIPIcs.CSL.2022.15}, annote = {Keywords: Monad, Monoidal category, Presheaf, Central idempotent, Graded monad, Indexed monad, Formal monad, Strong monad, Commutative monad} }
Fredrik Dahlqvist and Renato Neves. An Internal Language for Categories Enriched over Generalised Metric Spaces. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 16:1-16:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dahlqvist_et_al:LIPIcs.CSL.2022.16, author = {Dahlqvist, Fredrik and Neves, Renato}, title = {{An Internal Language for Categories Enriched over Generalised Metric Spaces}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {16:1--16:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.16}, URN = {urn:nbn:de:0030-drops-157362}, doi = {10.4230/LIPIcs.CSL.2022.16}, annote = {Keywords: \lambda-calculus, enriched category theory, quantale, equational theory} }
Anuj Dawar and Abhisekh Sankaran. MSO Undecidability for Hereditary Classes of Unbounded Clique Width. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 17:1-17:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dawar_et_al:LIPIcs.CSL.2022.17, author = {Dawar, Anuj and Sankaran, Abhisekh}, title = {{MSO Undecidability for Hereditary Classes of Unbounded Clique Width}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {17:1--17:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.17}, URN = {urn:nbn:de:0030-drops-157373}, doi = {10.4230/LIPIcs.CSL.2022.17}, annote = {Keywords: clique width, Seese’s conjecture, antichain, MSO interpretation, grid} }
Andrej Dudenhefner. Constructive Many-One Reduction from the Halting Problem to Semi-Unification. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 18:1-18:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dudenhefner:LIPIcs.CSL.2022.18, author = {Dudenhefner, Andrej}, title = {{Constructive Many-One Reduction from the Halting Problem to Semi-Unification}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {18:1--18:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.18}, URN = {urn:nbn:de:0030-drops-157380}, doi = {10.4230/LIPIcs.CSL.2022.18}, annote = {Keywords: constructive mathematics, undecidability, mechanization, semi-unification} }
David Fernández-Duque and Yoàv Montacute. Dynamic Cantor Derivative Logic. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 19:1-19:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fernandezduque_et_al:LIPIcs.CSL.2022.19, author = {Fern\'{a}ndez-Duque, David and Montacute, Yo\`{a}v}, title = {{Dynamic Cantor Derivative Logic}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {19:1--19:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.19}, URN = {urn:nbn:de:0030-drops-157397}, doi = {10.4230/LIPIcs.CSL.2022.19}, annote = {Keywords: dynamic topological logic, Cantor derivative, temporal logic, modal logic} }
Bernd Finkbeiner, Manuel Gieseking, Jesko Hecking-Harbusch, and Ernst-Rüdiger Olderog. Global Winning Conditions in Synthesis of Distributed Systems with Causal Memory. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 20:1-20:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{finkbeiner_et_al:LIPIcs.CSL.2022.20, author = {Finkbeiner, Bernd and Gieseking, Manuel and Hecking-Harbusch, Jesko and Olderog, Ernst-R\"{u}diger}, title = {{Global Winning Conditions in Synthesis of Distributed Systems with Causal Memory}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {20:1--20:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.20}, URN = {urn:nbn:de:0030-drops-157400}, doi = {10.4230/LIPIcs.CSL.2022.20}, annote = {Keywords: Synthesis, distributed systems, reactive systems, Petri games, decidability} }
Dana Fisman, Hadar Frenkel, and Sandra Zilles. Inferring Symbolic Automata. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 21:1-21:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fisman_et_al:LIPIcs.CSL.2022.21, author = {Fisman, Dana and Frenkel, Hadar and Zilles, Sandra}, title = {{Inferring Symbolic Automata}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {21:1--21:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.21}, URN = {urn:nbn:de:0030-drops-157412}, doi = {10.4230/LIPIcs.CSL.2022.21}, annote = {Keywords: Symbolic Finite State Automata, Query Learning, Characteristic Sets} }
Jakub Gajarský, Maximilian Gorsky, and Stephan Kreutzer. Differential Games, Locality, and Model Checking for FO Logic of Graphs. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 22:1-22:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gajarsky_et_al:LIPIcs.CSL.2022.22, author = {Gajarsk\'{y}, Jakub and Gorsky, Maximilian and Kreutzer, Stephan}, title = {{Differential Games, Locality, and Model Checking for FO Logic of Graphs}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {22:1--22:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.22}, URN = {urn:nbn:de:0030-drops-157426}, doi = {10.4230/LIPIcs.CSL.2022.22}, annote = {Keywords: FO model checking, locality, Gaifman’s theorem, EF games} }
Emile Hazard and Denis Kuperberg. Cyclic Proofs for Transfinite Expressions. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 23:1-23:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{hazard_et_al:LIPIcs.CSL.2022.23, author = {Hazard, Emile and Kuperberg, Denis}, title = {{Cyclic Proofs for Transfinite Expressions}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {23:1--23:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.23}, URN = {urn:nbn:de:0030-drops-157433}, doi = {10.4230/LIPIcs.CSL.2022.23}, annote = {Keywords: transfinite expressions, transfinite automata, cyclic proofs} }
Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, and Jeffrey Shallit. Decidability for Sturmian Words. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 24:1-24:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{hieronymi_et_al:LIPIcs.CSL.2022.24, author = {Hieronymi, Philipp and Ma, Dun and Oei, Reed and Schaeffer, Luke and Schulz, Christian and Shallit, Jeffrey}, title = {{Decidability for Sturmian Words}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {24:1--24:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.24}, URN = {urn:nbn:de:0030-drops-157440}, doi = {10.4230/LIPIcs.CSL.2022.24}, annote = {Keywords: Decidability, Sturmian words, Ostrowski numeration systems, Automated theorem proving} }
Guilhem Jaber and Davide Sangiorgi. Games, Mobile Processes, and Functions. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 25:1-25:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{jaber_et_al:LIPIcs.CSL.2022.25, author = {Jaber, Guilhem and Sangiorgi, Davide}, title = {{Games, Mobile Processes, and Functions}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {25:1--25:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.25}, URN = {urn:nbn:de:0030-drops-157450}, doi = {10.4230/LIPIcs.CSL.2022.25}, annote = {Keywords: \lambda-calculus, \pi-calculus, game semantics} }
Paulin Jacobé de Naurois. Parallelism in Soft Linear Logic. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 26:1-26:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{jacobedenaurois:LIPIcs.CSL.2022.26, author = {Jacob\'{e} de Naurois, Paulin}, title = {{Parallelism in Soft Linear Logic}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {26:1--26:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.26}, URN = {urn:nbn:de:0030-drops-157468}, doi = {10.4230/LIPIcs.CSL.2022.26}, annote = {Keywords: Implicit Complexity, Typing, Linear Logic, Functional Programming} }
Delia Kesner and Andrés Viso. Encoding Tight Typing in a Unified Framework. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 27:1-27:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kesner_et_al:LIPIcs.CSL.2022.27, author = {Kesner, Delia and Viso, Andr\'{e}s}, title = {{Encoding Tight Typing in a Unified Framework}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {27:1--27:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.27}, URN = {urn:nbn:de:0030-drops-157479}, doi = {10.4230/LIPIcs.CSL.2022.27}, annote = {Keywords: Call-by-Push-Value, Call-by-Name, Call-by-Value, Intersection Types} }
András Kovács. Generalized Universe Hierarchies and First-Class Universe Levels. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 28:1-28:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kovacs:LIPIcs.CSL.2022.28, author = {Kov\'{a}cs, Andr\'{a}s}, title = {{Generalized Universe Hierarchies and First-Class Universe Levels}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {28:1--28:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.28}, URN = {urn:nbn:de:0030-drops-157485}, doi = {10.4230/LIPIcs.CSL.2022.28}, annote = {Keywords: type theory, universes} }
Clemens Kupke, Johannes Marti, and Yde Venema. Succinct Graph Representations of μ-Calculus Formulas. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 29:1-29:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kupke_et_al:LIPIcs.CSL.2022.29, author = {Kupke, Clemens and Marti, Johannes and Venema, Yde}, title = {{Succinct Graph Representations of \mu-Calculus Formulas}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {29:1--29:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.29}, URN = {urn:nbn:de:0030-drops-157491}, doi = {10.4230/LIPIcs.CSL.2022.29}, annote = {Keywords: modal mu-calculus, model checking, alternating tree automata, hierachical equation systems} }
Yoshiki Nakamura. Spatial Existential Positive Logics for Hyperedge Replacement Grammars. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 30:1-30:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{nakamura:LIPIcs.CSL.2022.30, author = {Nakamura, Yoshiki}, title = {{Spatial Existential Positive Logics for Hyperedge Replacement Grammars}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {30:1--30:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.30}, URN = {urn:nbn:de:0030-drops-157504}, doi = {10.4230/LIPIcs.CSL.2022.30}, annote = {Keywords: Existential positive logic, spatial logic, Kleene theorem} }
Jaroslav Nešetřil, Patrice Ossona de Mendez, and Sebastian Siebertz. Structural Properties of the First-Order Transduction Quasiorder. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 31:1-31:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{nesetril_et_al:LIPIcs.CSL.2022.31, author = {Ne\v{s}et\v{r}il, Jaroslav and Ossona de Mendez, Patrice and Siebertz, Sebastian}, title = {{Structural Properties of the First-Order Transduction Quasiorder}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {31:1--31:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.31}, URN = {urn:nbn:de:0030-drops-157514}, doi = {10.4230/LIPIcs.CSL.2022.31}, annote = {Keywords: Finite model theory, first-order transductions, structural graph theory} }
Lê Thành Dũng (Tito) Nguyễn and Lutz Straßburger. BV and Pomset Logic Are Not the Same. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 32:1-32:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{nguyen_et_al:LIPIcs.CSL.2022.32, author = {Nguy\~{ê}n, L\^{e} Th\`{a}nh D\~{u}ng (Tito) and Stra{\ss}burger, Lutz}, title = {{BV and Pomset Logic Are Not the Same}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {32:1--32:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.32}, URN = {urn:nbn:de:0030-drops-157521}, doi = {10.4230/LIPIcs.CSL.2022.32}, annote = {Keywords: proof nets, deep inference, pomset logic, system BV, cographs, dicographs, series-parallel orders} }
Guillermo A. Pérez and Ritam Raha. Revisiting Parameter Synthesis for One-Counter Automata. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 33:1-33:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{perez_et_al:LIPIcs.CSL.2022.33, author = {P\'{e}rez, Guillermo A. and Raha, Ritam}, title = {{Revisiting Parameter Synthesis for One-Counter Automata}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {33:1--33:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.33}, URN = {urn:nbn:de:0030-drops-157534}, doi = {10.4230/LIPIcs.CSL.2022.33}, annote = {Keywords: Parametric one-counter automata, Reachability, Software Verification} }
Nicole Schirrmacher, Sebastian Siebertz, and Alexandre Vigny. First-Order Logic with Connectivity Operators. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 34:1-34:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{schirrmacher_et_al:LIPIcs.CSL.2022.34, author = {Schirrmacher, Nicole and Siebertz, Sebastian and Vigny, Alexandre}, title = {{First-Order Logic with Connectivity Operators}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {34:1--34:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.34}, URN = {urn:nbn:de:0030-drops-157548}, doi = {10.4230/LIPIcs.CSL.2022.34}, annote = {Keywords: First-order logic, graph theory, connectivity} }
Haruka Tomita. Planar Realizability via Left and Right Applications. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 35:1-35:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{tomita:LIPIcs.CSL.2022.35, author = {Tomita, Haruka}, title = {{Planar Realizability via Left and Right Applications}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {35:1--35:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.35}, URN = {urn:nbn:de:0030-drops-157558}, doi = {10.4230/LIPIcs.CSL.2022.35}, annote = {Keywords: Realizability, combinatory algebra, monoidal bi-closed category, exponential modality, exchange modality} }
Jacobo Torán and Florian Wörz. Number of Variables for Graph Differentiation and the Resolution of GI Formulas. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 36:1-36:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{toran_et_al:LIPIcs.CSL.2022.36, author = {Tor\'{a}n, Jacobo and W\"{o}rz, Florian}, title = {{Number of Variables for Graph Differentiation and the Resolution of GI Formulas}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {36:1--36:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.36}, URN = {urn:nbn:de:0030-drops-157564}, doi = {10.4230/LIPIcs.CSL.2022.36}, annote = {Keywords: Proof Complexity, Resolution, Narrow Width, Graph Isomorphism, k-variable fragment first-order logic 𝔏\underlinek, Immerman’s Pebble Game, Symmetry Rule, SRC-1} }
Gonzague Yernaux and Wim Vanhoof. Anti-Unification of Unordered Goals. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 37:1-37:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{yernaux_et_al:LIPIcs.CSL.2022.37, author = {Yernaux, Gonzague and Vanhoof, Wim}, title = {{Anti-Unification of Unordered Goals}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {37:1--37:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.37}, URN = {urn:nbn:de:0030-drops-157574}, doi = {10.4230/LIPIcs.CSL.2022.37}, annote = {Keywords: Anti-unification, Logic programming, NP-completeness, Time complexity, Algorithms, Inductive logic programming} }
Feedback for Dagstuhl Publishing