Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Veeti Ahvonen, Damian Heiman, Lauri Hella, and Antti Kuusisto. Descriptive Complexity for Distributed Computing with Circuits. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 9:1-9:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{ahvonen_et_al:LIPIcs.MFCS.2023.9, author = {Ahvonen, Veeti and Heiman, Damian and Hella, Lauri and Kuusisto, Antti}, title = {{Descriptive Complexity for Distributed Computing with Circuits}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {9:1--9:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.9}, URN = {urn:nbn:de:0030-drops-185433}, doi = {10.4230/LIPIcs.MFCS.2023.9}, annote = {Keywords: Descriptive complexity, distributed computing, logic, graph coloring} }
Published in: LIPIcs, Volume 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)
Reijo Jaakkola, Antti Kuusisto, and Miikka Vilander. Relating Description Complexity to Entropy. In 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 254, pp. 38:1-38:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{jaakkola_et_al:LIPIcs.STACS.2023.38, author = {Jaakkola, Reijo and Kuusisto, Antti and Vilander, Miikka}, title = {{Relating Description Complexity to Entropy}}, booktitle = {40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)}, pages = {38:1--38:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-266-2}, ISSN = {1868-8969}, year = {2023}, volume = {254}, editor = {Berenbrink, Petra and Bouyer, Patricia and Dawar, Anuj and Kant\'{e}, Mamadou Moustapha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.38}, URN = {urn:nbn:de:0030-drops-176903}, doi = {10.4230/LIPIcs.STACS.2023.38}, annote = {Keywords: finite model theory, entropy, formula size, randomness, formula size game} }
Published in: LIPIcs, Volume 252, 31st EACSL Annual Conference on Computer Science Logic (CSL 2023)
Reijo Jaakkola. Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability. In 31st EACSL Annual Conference on Computer Science Logic (CSL 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 252, pp. 26:1-26:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 252, 31st EACSL Annual Conference on Computer Science Logic (CSL 2023)
Reijo Jaakkola and Antti Kuusisto. Complexity Classifications via Algebraic Logic. In 31st EACSL Annual Conference on Computer Science Logic (CSL 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 252, pp. 27:1-27:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Bartosz Bednarczyk and Reijo Jaakkola. Towards a Model Theory of Ordered Logics: Expressivity and Interpolation. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 15:1-15:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bednarczyk_et_al:LIPIcs.MFCS.2022.15, author = {Bednarczyk, Bartosz and Jaakkola, Reijo}, title = {{Towards a Model Theory of Ordered Logics: Expressivity and Interpolation}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {15:1--15: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.15}, URN = {urn:nbn:de:0030-drops-168132}, doi = {10.4230/LIPIcs.MFCS.2022.15}, annote = {Keywords: ordered fragments, fluted fragment, guarded fragment, model theory, Craig Interpolation Property, expressive power, model checking} }
Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Reijo Jaakkola. Ordered Fragments of First-Order Logic. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 62:1-62:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{jaakkola:LIPIcs.MFCS.2021.62, author = {Jaakkola, Reijo}, title = {{Ordered Fragments of First-Order Logic}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {62:1--62:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-201-3}, ISSN = {1868-8969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.62}, URN = {urn:nbn:de:0030-drops-145025}, doi = {10.4230/LIPIcs.MFCS.2021.62}, annote = {Keywords: ordered logic, fluted logic, complexity, decidability} }
Published in: LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Lauri Hella, Antti Kuusisto, Arne Meier, and Jonni Virtema. Model Checking and Validity in Propositional and Modal Inclusion Logics. In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 83, pp. 32:1-32:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{hella_et_al:LIPIcs.MFCS.2017.32, author = {Hella, Lauri and Kuusisto, Antti and Meier, Arne and Virtema, Jonni}, title = {{Model Checking and Validity in Propositional and Modal Inclusion Logics}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {32:1--32:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-046-0}, ISSN = {1868-8969}, year = {2017}, volume = {83}, editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.32}, URN = {urn:nbn:de:0030-drops-81007}, doi = {10.4230/LIPIcs.MFCS.2017.32}, annote = {Keywords: Inclusion Logic, Model Checking, Complexity} }
Published in: LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Emanuel Kieronski and Antti Kuusisto. One-Dimensional Logic over Trees. In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 83, pp. 64:1-64:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{kieronski_et_al:LIPIcs.MFCS.2017.64, author = {Kieronski, Emanuel and Kuusisto, Antti}, title = {{One-Dimensional Logic over Trees}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {64:1--64:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-046-0}, ISSN = {1868-8969}, year = {2017}, volume = {83}, editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.64}, URN = {urn:nbn:de:0030-drops-80658}, doi = {10.4230/LIPIcs.MFCS.2017.64}, annote = {Keywords: satisfiability, expressivity, trees, fragments of first-order logic} }
Published in: LIPIcs, Volume 90, 24th International Symposium on Temporal Representation and Reasoning (TIME 2017)
Valentin Goranko, Antti Kuusisto, and Raine Rönnholm. CTL with Finitely Bounded Semantics. In 24th International Symposium on Temporal Representation and Reasoning (TIME 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 90, pp. 14:1-14:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{goranko_et_al:LIPIcs.TIME.2017.14, author = {Goranko, Valentin and Kuusisto, Antti and R\"{o}nnholm, Raine}, title = {{CTL with Finitely Bounded Semantics}}, booktitle = {24th International Symposium on Temporal Representation and Reasoning (TIME 2017)}, pages = {14:1--14:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-052-1}, ISSN = {1868-8969}, year = {2017}, volume = {90}, editor = {Schewe, Sven and Schneider, Thomas and Wijsen, Jef}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2017.14}, URN = {urn:nbn:de:0030-drops-79325}, doi = {10.4230/LIPIcs.TIME.2017.14}, annote = {Keywords: CTL, finitely bounded semantics, tableaux, decidability} }
Published in: LIPIcs, Volume 68, 20th International Conference on Database Theory (ICDT 2017)
Cristina Feier, Antti Kuusisto, and Carsten Lutz. Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk). In 20th International Conference on Database Theory (ICDT 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 68, pp. 1:1-1:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{feier_et_al:LIPIcs.ICDT.2017.1, author = {Feier, Cristina and Kuusisto, Antti and Lutz, Carsten}, title = {{Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics}}, booktitle = {20th International Conference on Database Theory (ICDT 2017)}, pages = {1:1--1:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-024-8}, ISSN = {1868-8969}, year = {2017}, volume = {68}, editor = {Benedikt, Michael and Orsi, Giorgio}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.1}, URN = {urn:nbn:de:0030-drops-70636}, doi = {10.4230/LIPIcs.ICDT.2017.1}, annote = {Keywords: FO-Rewritability, MDDLog, MMSNP, DL, ontology mediated queries} }
Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Juha Kontinen, Antti Kuusisto, and Jonni Virtema. Decidability of Predicate Logics with Team Semantics. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 60:1-60:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kontinen_et_al:LIPIcs.MFCS.2016.60, author = {Kontinen, Juha and Kuusisto, Antti and Virtema, Jonni}, title = {{Decidability of Predicate Logics with Team Semantics}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {60:1--60:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.60}, URN = {urn:nbn:de:0030-drops-64726}, doi = {10.4230/LIPIcs.MFCS.2016.60}, annote = {Keywords: team semantics, dependence logic, complexity, two-variable logic} }
Published in: LIPIcs, Volume 41, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015)
Emanuel Kierónski and Antti Kuusisto. Uniform One-Dimensional Fragments with One Equivalence Relation. In 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 41, pp. 597-615, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{kieronski_et_al:LIPIcs.CSL.2015.597, author = {Kier\'{o}nski, Emanuel and Kuusisto, Antti}, title = {{Uniform One-Dimensional Fragments with One Equivalence Relation}}, booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)}, pages = {597--615}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-90-3}, ISSN = {1868-8969}, year = {2015}, volume = {41}, editor = {Kreutzer, Stephan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.597}, URN = {urn:nbn:de:0030-drops-54418}, doi = {10.4230/LIPIcs.CSL.2015.597}, annote = {Keywords: two-variable logic, uniform one-dimensional fragments, complexity, expressivity, equivalence relations} }
Published in: LIPIcs, Volume 23, Computer Science Logic 2013 (CSL 2013)
Antti Kuusisto. Modal Logic and Distributed Message Passing Automata. In Computer Science Logic 2013 (CSL 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 23, pp. 452-468, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{kuusisto:LIPIcs.CSL.2013.452, author = {Kuusisto, Antti}, title = {{Modal Logic and Distributed Message Passing Automata}}, booktitle = {Computer Science Logic 2013 (CSL 2013)}, pages = {452--468}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-60-6}, ISSN = {1868-8969}, year = {2013}, volume = {23}, editor = {Ronchi Della Rocca, Simona}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2013.452}, URN = {urn:nbn:de:0030-drops-42132}, doi = {10.4230/LIPIcs.CSL.2013.452}, annote = {Keywords: Modal logic, message passing automata, descriptive characterizations, distributed computing} }
Published in: LIPIcs, Volume 16, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL (2012)
Antti Kuusisto, Jeremy Meyers, and Jonni Virtema. Undecidable First-Order Theories of Affine Geometries. In Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 16, pp. 470-484, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)
@InProceedings{kuusisto_et_al:LIPIcs.CSL.2012.470, author = {Kuusisto, Antti and Meyers, Jeremy and Virtema, Jonni}, title = {{Undecidable First-Order Theories of Affine Geometries}}, booktitle = {Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL}, pages = {470--484}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-42-2}, ISSN = {1868-8969}, year = {2012}, volume = {16}, editor = {C\'{e}gielski, Patrick and Durand, Arnaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.470}, URN = {urn:nbn:de:0030-drops-36910}, doi = {10.4230/LIPIcs.CSL.2012.470}, annote = {Keywords: Tarski’s geometry, undecidability, spatial logic, classical logic} }
Feedback for Dagstuhl Publishing