Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, and Sasha Rubin. Quantifying Bounds in Strategy Logic. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 23:1-23:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{fijalkow_et_al:LIPIcs.CSL.2018.23, author = {Fijalkow, Nathana\"{e}l and Maubert, Bastien and Murano, Aniello and Rubin, Sasha}, title = {{Quantifying Bounds in Strategy Logic}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {23:1--23:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.23}, URN = {urn:nbn:de:0030-drops-96901}, doi = {10.4230/LIPIcs.CSL.2018.23}, annote = {Keywords: Prompt LTL, Strategy Logic, Model checking, Automata with counters} }
Published in: LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)
Tobias Ganzow and Sasha Rubin. Order-Invariant MSO is Stronger than Counting MSO in the Finite. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 313-324, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{ganzow_et_al:LIPIcs.STACS.2008.1353, author = {Ganzow, Tobias and Rubin, Sasha}, title = {{Order-Invariant MSO is Stronger than Counting MSO in the Finite}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {313--324}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1353}, URN = {urn:nbn:de:0030-drops-13535}, doi = {10.4230/LIPIcs.STACS.2008.1353}, annote = {Keywords: MSO, Counting MSO, order-invariance, expressiveness, Ehrenfeucht-Fraiss\'{e} game} }
Published in: LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)
Lukasz Kaiser, Sasha Rubin, and Vince Bárány. Cardinality and counting quantifiers on omega-automatic structures. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 385-396, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{kaiser_et_al:LIPIcs.STACS.2008.1360, author = {Kaiser, Lukasz and Rubin, Sasha and B\'{a}r\'{a}ny, Vince}, title = {{Cardinality and counting quantifiers on omega-automatic structures}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {385--396}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1360}, URN = {urn:nbn:de:0030-drops-13602}, doi = {10.4230/LIPIcs.STACS.2008.1360}, annote = {Keywords: \$omega\$-automatic presentations, \$omega\$-semigroups, \$omega\$-automata} }
Feedback for Dagstuhl Publishing