Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Samson Abramsky and Dan Marsden. Comonadic semantics for hybrid logic. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 7:1-7:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{abramsky_et_al:LIPIcs.MFCS.2022.7, author = {Abramsky, Samson and Marsden, Dan}, title = {{Comonadic semantics for hybrid logic}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {7:1--7:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.7}, URN = {urn:nbn:de:0030-drops-168055}, doi = {10.4230/LIPIcs.MFCS.2022.7}, annote = {Keywords: comonads, model comparison games, semantic characterizations, hybrid logic, bounded fragment} }
Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Adam Ó Conghaile. Cohomology in Constraint Satisfaction and Structure Isomorphism. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 75:1-75:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{oconghaile:LIPIcs.MFCS.2022.75, author = {\'{O} Conghaile, Adam}, title = {{Cohomology in Constraint Satisfaction and Structure Isomorphism}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {75:1--75:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.75}, URN = {urn:nbn:de:0030-drops-168738}, doi = {10.4230/LIPIcs.MFCS.2022.75}, annote = {Keywords: constraint satisfaction problems, finite model theory, descriptive complexity, rank logic, Weisfeiler-Leman algorithm, cohomology} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Samson Abramsky and Luca Reggio. Arboreal Categories and Resources. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 115:1-115:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{abramsky_et_al:LIPIcs.ICALP.2021.115, author = {Abramsky, Samson and Reggio, Luca}, title = {{Arboreal Categories and Resources}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {115:1--115:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.115}, URN = {urn:nbn:de:0030-drops-141845}, doi = {10.4230/LIPIcs.ICALP.2021.115}, annote = {Keywords: factorisation system, embedding, comonad, coalgebra, open maps, bisimulation, game, resources, relational structures, finite model theory} }
Published in: LIPIcs, Volume 183, 29th EACSL Annual Conference on Computer Science Logic (CSL 2021)
Samson Abramsky and Rui Soares Barbosa. The Logic of Contextuality. In 29th EACSL Annual Conference on Computer Science Logic (CSL 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 183, pp. 5:1-5:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{abramsky_et_al:LIPIcs.CSL.2021.5, author = {Abramsky, Samson and Barbosa, Rui Soares}, title = {{The Logic of Contextuality}}, booktitle = {29th EACSL Annual Conference on Computer Science Logic (CSL 2021)}, pages = {5:1--5:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-175-7}, ISSN = {1868-8969}, year = {2021}, volume = {183}, editor = {Baier, Christel and Goubault-Larrecq, Jean}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2021.5}, URN = {urn:nbn:de:0030-drops-134394}, doi = {10.4230/LIPIcs.CSL.2021.5}, annote = {Keywords: partial Boolean algebras, contextuality, exclusivity principles, Kochen-Specker paradoxes, tensor product} }
Published in: LIPIcs, Volume 139, 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)
Marc de Visme and Glynn Winskel. Causal Unfoldings. In 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 139, pp. 9:1-9:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{devisme_et_al:LIPIcs.CALCO.2019.9, author = {de Visme, Marc and Winskel, Glynn}, title = {{Causal Unfoldings}}, booktitle = {8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)}, pages = {9:1--9:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-120-7}, ISSN = {1868-8969}, year = {2019}, volume = {139}, editor = {Roggenbach, Markus and Sokolova, Ana}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2019.9}, URN = {urn:nbn:de:0030-drops-114376}, doi = {10.4230/LIPIcs.CALCO.2019.9}, annote = {Keywords: Event Structures, Parallel Causes, Causal Unfolding, Probability} }
Published in: LIPIcs, Volume 139, 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)
Stefano Gogioso. A Diagrammatic Approach to Quantum Dynamics. In 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 139, pp. 19:1-19:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{gogioso:LIPIcs.CALCO.2019.19, author = {Gogioso, Stefano}, title = {{A Diagrammatic Approach to Quantum Dynamics}}, booktitle = {8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)}, pages = {19:1--19:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-120-7}, ISSN = {1868-8969}, year = {2019}, volume = {139}, editor = {Roggenbach, Markus and Sokolova, Ana}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2019.19}, URN = {urn:nbn:de:0030-drops-114472}, doi = {10.4230/LIPIcs.CALCO.2019.19}, annote = {Keywords: Quantum dynamics, String diagrams, Categorical algebra} }
Published in: LIPIcs, Volume 141, 10th International Conference on Interactive Theorem Proving (ITP 2019)
Minchao Wu and Rajeev Goré. Verified Decision Procedures for Modal Logics. In 10th International Conference on Interactive Theorem Proving (ITP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 141, pp. 31:1-31:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{wu_et_al:LIPIcs.ITP.2019.31, author = {Wu, Minchao and Gor\'{e}, Rajeev}, title = {{Verified Decision Procedures for Modal Logics}}, booktitle = {10th International Conference on Interactive Theorem Proving (ITP 2019)}, pages = {31:1--31:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-122-1}, ISSN = {1868-8969}, year = {2019}, volume = {141}, editor = {Harrison, John and O'Leary, John and Tolmach, Andrew}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2019.31}, URN = {urn:nbn:de:0030-drops-110866}, doi = {10.4230/LIPIcs.ITP.2019.31}, annote = {Keywords: Formal Methods, Interactive Theorem Proving, Modal Logic, Lean} }
Published in: LIPIcs, Volume 141, 10th International Conference on Interactive Theorem Proving (ITP 2019)
Akihisa Yamada and Jérémy Dubut. Complete Non-Orders and Fixed Points. In 10th International Conference on Interactive Theorem Proving (ITP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 141, pp. 30:1-30:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{yamada_et_al:LIPIcs.ITP.2019.30, author = {Yamada, Akihisa and Dubut, J\'{e}r\'{e}my}, title = {{Complete Non-Orders and Fixed Points}}, booktitle = {10th International Conference on Interactive Theorem Proving (ITP 2019)}, pages = {30:1--30:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-122-1}, ISSN = {1868-8969}, year = {2019}, volume = {141}, editor = {Harrison, John and O'Leary, John and Tolmach, Andrew}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2019.30}, URN = {urn:nbn:de:0030-drops-110852}, doi = {10.4230/LIPIcs.ITP.2019.30}, annote = {Keywords: Order Theory, Lattice Theory, Fixed-Points, Isabelle/HOL} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Pierre Clairambault and Andrzej S. Murawski. On the Expressivity of Linear Recursion Schemes. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 50:1-50:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{clairambault_et_al:LIPIcs.MFCS.2019.50, author = {Clairambault, Pierre and Murawski, Andrzej S.}, title = {{On the Expressivity of Linear Recursion Schemes}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {50:1--50:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.50}, URN = {urn:nbn:de:0030-drops-109945}, doi = {10.4230/LIPIcs.MFCS.2019.50}, annote = {Keywords: higher-order recursion schemes, linear logic, game semantics, geometry of interaction} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Manfred Droste and Paul Gastin. Aperiodic Weighted Automata and Weighted First-Order Logic. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 76:1-76:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{droste_et_al:LIPIcs.MFCS.2019.76, author = {Droste, Manfred and Gastin, Paul}, title = {{Aperiodic Weighted Automata and Weighted First-Order Logic}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {76:1--76:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.76}, URN = {urn:nbn:de:0030-drops-110203}, doi = {10.4230/LIPIcs.MFCS.2019.76}, annote = {Keywords: Weighted automata, weighted logic, aperiodic automata, first-order logic, unambiguous, finitely ambiguous, polynomially ambiguous} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Titouan Carette, Dominic Horsman, and Simon Perdrix. SZX-Calculus: Scalable Graphical Quantum Reasoning. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 55:1-55:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{carette_et_al:LIPIcs.MFCS.2019.55, author = {Carette, Titouan and Horsman, Dominic and Perdrix, Simon}, title = {{SZX-Calculus: Scalable Graphical Quantum Reasoning}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {55:1--55:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.55}, URN = {urn:nbn:de:0030-drops-109999}, doi = {10.4230/LIPIcs.MFCS.2019.55}, annote = {Keywords: Quantum computing, categorical quantum mechanics, completeness, scalability} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Paweł Parys. Parity Games: Zielonka’s Algorithm in Quasi-Polynomial Time. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 10:1-10:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{parys:LIPIcs.MFCS.2019.10, author = {Parys, Pawe{\l}}, title = {{Parity Games: Zielonka’s Algorithm in Quasi-Polynomial Time}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {10:1--10:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.10}, URN = {urn:nbn:de:0030-drops-109543}, doi = {10.4230/LIPIcs.MFCS.2019.10}, annote = {Keywords: Parity games, Zielonka’s algorithm, quasi-polynomial time} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Luís Caires, Jorge A. Pérez, Frank Pfenning, and Bernardo Toninho. Domain-Aware Session Types. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 39:1-39:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{caires_et_al:LIPIcs.CONCUR.2019.39, author = {Caires, Lu{\'\i}s and P\'{e}rez, Jorge A. and Pfenning, Frank and Toninho, Bernardo}, title = {{Domain-Aware Session Types}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {39:1--39:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Fokkink, Wan and van Glabbeek, Rob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.39}, URN = {urn:nbn:de:0030-drops-109417}, doi = {10.4230/LIPIcs.CONCUR.2019.39}, annote = {Keywords: Session Types, Linear Logic, Process Calculi, Hybrid Logic} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Michell Guzmán, Sophia Knight, Santiago Quintero, Sergio Ramírez, Camilo Rueda, and Frank Valencia. Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 29:1-29:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{guzman_et_al:LIPIcs.CONCUR.2019.29, author = {Guzm\'{a}n, Michell and Knight, Sophia and Quintero, Santiago and Ram{\'\i}rez, Sergio and Rueda, Camilo and Valencia, Frank}, title = {{Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {29:1--29:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Fokkink, Wan and van Glabbeek, Rob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.29}, URN = {urn:nbn:de:0030-drops-109314}, doi = {10.4230/LIPIcs.CONCUR.2019.29}, annote = {Keywords: Reasoning about Groups, Distributed Knowledge, Infinitely Many Agents, Reasoning about Space, Algebraic Modeling} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, and Fabio Zanasi. Bialgebraic Semantics for String Diagrams. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 37:1-37:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bonchi_et_al:LIPIcs.CONCUR.2019.37, author = {Bonchi, Filippo and Piedeleu, Robin and Sobocinski, Pawel and Zanasi, Fabio}, title = {{Bialgebraic Semantics for String Diagrams}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {37:1--37:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Fokkink, Wan and van Glabbeek, Rob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.37}, URN = {urn:nbn:de:0030-drops-109398}, doi = {10.4230/LIPIcs.CONCUR.2019.37}, annote = {Keywords: String Diagram, Structural Operational Semantics, Bialgebraic semantics} }
Feedback for Dagstuhl Publishing