Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, and Moshe Y. Vardi. 07441 Abstracts Collection – Algorithmic-Logical Theory of Infinite Structures. In Algorithmic-Logical Theory of Infinite Structures. Dagstuhl Seminar Proceedings, Volume 7441, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{downey_et_al:DagSemProc.07441.1, author = {Downey, Rod and Khoussainov, Bakhadyr and Kuske, Dietrich and Lohrey, Markus and Vardi, Moshe Y.}, title = {{07441 Abstracts Collection – Algorithmic-Logical Theory of Infinite Structures}}, booktitle = {Algorithmic-Logical Theory of Infinite Structures}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7441}, editor = {Rod Downey and Bakhadyr Khoussainov and Dietrich Kuske and Markus Lohrey and Moshe Y. Vardi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07441.1}, URN = {urn:nbn:de:0030-drops-14122}, doi = {10.4230/DagSemProc.07441.1}, annote = {Keywords: Theories of infinite structures , computable model theory and automatic structures , model checking infinite systems} }
Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, and Moshe Y. Vardi. 07441 Summary – Algorithmic-Logical Theory of Infinite Structures. In Algorithmic-Logical Theory of Infinite Structures. Dagstuhl Seminar Proceedings, Volume 7441, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{downey_et_al:DagSemProc.07441.2, author = {Downey, Rod and Khoussainov, Bakhadyr and Kuske, Dietrich and Lohrey, Markus and Vardi, Moshe Y.}, title = {{07441 Summary – Algorithmic-Logical Theory of Infinite Structures}}, booktitle = {Algorithmic-Logical Theory of Infinite Structures}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7441}, editor = {Rod Downey and Bakhadyr Khoussainov and Dietrich Kuske and Markus Lohrey and Moshe Y. Vardi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07441.2}, URN = {urn:nbn:de:0030-drops-14111}, doi = {10.4230/DagSemProc.07441.2}, annote = {Keywords: Theories of infinite structures , computable model theory and automatic structures , model checking infinite systems} }
Markus Lohrey. Application of verification techniques to inverse monoids. In Algorithmic-Logical Theory of Infinite Structures. Dagstuhl Seminar Proceedings, Volume 7441, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{lohrey:DagSemProc.07441.3, author = {Lohrey, Markus}, title = {{Application of verification techniques to inverse monoids}}, booktitle = {Algorithmic-Logical Theory of Infinite Structures}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7441}, editor = {Rod Downey and Bakhadyr Khoussainov and Dietrich Kuske and Markus Lohrey and Moshe Y. Vardi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07441.3}, URN = {urn:nbn:de:0030-drops-14109}, doi = {10.4230/DagSemProc.07441.3}, annote = {Keywords: Inverse monoids, word problems, Cayley-graphs, complexity} }
Dietrich Kuske. Compatibility of Shelah and Stupp's and of Muchnik's iteration with fragments of monadic second order logic. In Algorithmic-Logical Theory of Infinite Structures. Dagstuhl Seminar Proceedings, Volume 7441, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{kuske:DagSemProc.07441.4, author = {Kuske, Dietrich}, title = {{Compatibility of Shelah and Stupp's and of Muchnik's iteration with fragments of monadic second order logic}}, booktitle = {Algorithmic-Logical Theory of Infinite Structures}, pages = {1--14}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7441}, editor = {Rod Downey and Bakhadyr Khoussainov and Dietrich Kuske and Markus Lohrey and Moshe Y. Vardi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07441.4}, URN = {urn:nbn:de:0030-drops-14078}, doi = {10.4230/DagSemProc.07441.4}, annote = {Keywords: Logic in computer science, Rabin's tree theorem} }
Stefan Göller, Markus Lohrey, and Carsten Lutz. PDL with Intersection and Converse is 2EXP-complete. In Algorithmic-Logical Theory of Infinite Structures. Dagstuhl Seminar Proceedings, Volume 7441, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{goller_et_al:DagSemProc.07441.5, author = {G\"{o}ller, Stefan and Lohrey, Markus and Lutz, Carsten}, title = {{PDL with Intersection and Converse is 2EXP-complete}}, booktitle = {Algorithmic-Logical Theory of Infinite Structures}, pages = {1--17}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7441}, editor = {Rod Downey and Bakhadyr Khoussainov and Dietrich Kuske and Markus Lohrey and Moshe Y. Vardi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07441.5}, URN = {urn:nbn:de:0030-drops-14093}, doi = {10.4230/DagSemProc.07441.5}, annote = {Keywords: Satisfiability, Propositional Dynamic Logic, Computational Complexity} }
Thierry Cachat. Tree Automata Make Ordinal Theory Easy. In Algorithmic-Logical Theory of Infinite Structures. Dagstuhl Seminar Proceedings, Volume 7441, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{cachat:DagSemProc.07441.6, author = {Cachat, Thierry}, title = {{Tree Automata Make Ordinal Theory Easy}}, booktitle = {Algorithmic-Logical Theory of Infinite Structures}, pages = {1--11}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7441}, editor = {Rod Downey and Bakhadyr Khoussainov and Dietrich Kuske and Markus Lohrey and Moshe Y. Vardi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07441.6}, URN = {urn:nbn:de:0030-drops-14082}, doi = {10.4230/DagSemProc.07441.6}, annote = {Keywords: Ordinals, First Order theory, Monadic Second Order Theory, tree automata} }