Antti Kuusisto

Papers

Some of the links give the preprint of the (at least accepted) paper.

Description Complexity of Unary Structures in First-Order Logic with Links to Entropy. Preprint. With Reijo Jaakkola and Miikka Vilander. CSL 2025.
Relating description complexity to entropy. Preprint. With Reijo Jaakkola and Miikka Vilander. Journal of Computer and System Sciences, 2025.
Coordination games and rationality. A book to appear via Cambridge University Press in 2025. With Valentin Goranko and Raine Rönnholm.
Descriptive Complexity for Distributed Computing with Circuits. With Veeti Ahvonen, Damian Heiman, and Lauri Hella, to appear in Journal of Logic and Computation, 2025.
Logical characterizations of recurrent graph neural networks with reals and floats. Preprint. With Veeti Ahvonen, Damian Heiman and Carsten Lutz. To appear in NeurIPS 2024.
Interpretable classifiers for tabular data via feature selection and discretization. Preprint. With Reijo Jaakkola, Tomi Janhunen, Masood F. Rankooh, and Miikka Vilander. To appear in DAO-XAI 2024.
Descriptive Complexity for Neural Networks via Boolean Networks. With Veeti Ahvonen and Damian Heiman, CSL 2024.
Descriptive Complexity for Distributed Computing with Circuits. With Veeti Ahvonen, Damian Heiman, and Lauri Hella, MFCS 2023.
The optimal way to play the most difficult repeated two-player coordination games. With Raine Ronnholm, Discrete Applied Mathematics, 2023.
Short Boolean Formulas as Explanations in Practice. with Reijo Jaakkola, Tomi Janhunen, Masood F. Rankooh and Miikka Vilander, JELIA 2023.
Complexity classifications via algebraic logic. With Reijo Jaakkola, CSL 2023.
Bounded game-theoretic semantics for modal mu-calculus. With Lauri Hella, Antti Kuusisto, Raine Rönnholm, Information and Computation, 2022.
One-dimensional fragment over words and trees. With Emanuel Kieronski. J. Log. Comput., 2022.
Explainability via Short Formulas: the Case of Propositional Logic with Implementation. With Reijo Jaakkola, Tomi Janhunen, Masood Feyzbakhsh Rankooh, Miikka Vilander. RCRA 2022.
Game-theoretic semantics for ATL+ with applications to model checking. With Valentin Goranko and Raine Ronnholm. information and Computation, 2021.
The Optimal Way to Play the Most Difficult Repeated Coordination Games. With Raine Ronnholm. International Symposium on Games, Automata, Logics, and Formal Verification, 2021.
Gradual Guaranteed Coordination in Repeated Win-Lose Coordination Games. With Valentin Goranko and Raine Rönnholm. European Conference on Artificial Intelligence (ECAI) 2020
Bounded Game-Theoretic Semantics for Modal Mu-Calculus and Some Variants. With Lauri Hella and Raine Ronnholm. International Symposium on Games, Automata, Logics, and Formal Verification (GandALF) 2020.
Emptiness problems for distributed automata. With Fabian Reiter. information and Computation, 2020
Rational coordination with no communication or conventions. With Valentin Goranko and Raine Ronnholm. Journal of logic and computation, 2020.
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. With Lauri Hella, Arne Meier, Heribert Vollmer ACM Transactions in Computational Logic, 2020
Alternating-time temporal logic ATL with finitely bounded semantics. With Valentin Goranko and Raine Ronnholm. Theoretical computer science, 2019
Model checking and validity in propositional and modal inclusion logics. With Lauri Hella, Arne Meier, Jonni Virtema Journal of logic and computation, 2019
Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics. With Cristina Feier and Carsten Lutz. Logical methods in computer science, 2019
Model counting beyond two-variable logic. With Carsten Lutz, LICS 2018
Logics for propositional determinacy and independence. With Valentin Goranko, Review of Symbolic Logic, 2018
Game-theoretic semantics for alternating-time temporal logic. With Valentin Goranko and Raine Ronnholm, ACM Transactions in Computational Logic, 2018.
One-dimensional logic over trees. With Emanuel Kieronski, Mathematical Foundations of CS (MFCS) 2017.
Rewritability in monadic disjunctive datalog, MMSNP, and expressive description logics. With Cristina Feier and Carsten Lutz, ICDT 2017.
Game-theoretic semantics for ATL+ with applications to model checking. With Valentin Goranko and Raine Ronnholm, Proceedings of the 2017 International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2017.
Model checking and validity in propositional and modal inclusion logics. With Lauri Hella, Arne Meier and Jonni Virtema, Mathematical Foundations of CS (MFCS) 2017.
Rational communication with no coordination or conventions. With Valentin Goranko and Raine Ronnholm, Logic and Rational Interaction (LORI) 2017.
Emptiness Problems for Distributed Automata. With Fabian Reiter, to appear in International Symposium on Games, Automata, Logics and Formal Verification 2017.
CTL with finitely bounded semantics. With Valentin Goranko and Raine Ronnholm, to appear in TIME 2017.
Game-theoretic semantics for alternating-time temporal logic. With Valentin Goranko and Raine Ronnholm, Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2016.
On the uniform one-dimensional fragment. Proc. of Description Logics (DL) 2016.
Decidability of Predicate Logics with Team Semantics. With Juha Kontinen and Jonni Virtema, Mathematical Foundations of Computer Science (MFCS) 2016.
Existential second-order logic and modal logic with quantified accessibility relations. Information and Computation, 2016.
Complexity and expressivity of uniform one-dimensional fragments with one equivalence relation. With Emanuel Kieronski. CSL 2015.
Modal inclusion logic: being lax is simpler than being strict. With Lauri Hella, Heribert Vollmer and Arne Meier. MFCS 2015.
Second-order propositional modal logic and monadic alternation hierarchies. Annals of Pure and Applied Logic, 2015.
A double team semantics for generalized quantifiers. Journal of Logic, Language and Information, 2015.
Team Semantics and Recursive Enumerability. SOFSEM 2015, proceedings vol. II.
Weak models of distributed computing, with connections to modal logic. With Lauri Hella, Matti Jarvisalo, Juhana Laurinharju, Tuomo Lempiainen, Kerkko Luosto, Jukka Suomela and Jonni Virtema. Journal version, Distributed Computing, 2015. Two sets of slides on this topic below.
Complexity of two-variable dependence logic and IF-logic With Juha Kontinen, Peter Lohmann and Jonni Virtema. Journal version, Information and Computation, 2014.
Some Turing-Complete Extensions of First-Order Logic. GandALF 2014.
Infinite networks, halting and local algorithms. GandALF 2014.
Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality. With Emanuel Kieronski, MFCS 2014.
One dimensional fragment of first-order logic , With Lauri Hella, AiML 2014.
Undecidable first-order theories of affine geometries. With Jeremy Meyers and Jonni Virtema. Journal version, LMCS, 2013.
A set of slides on this topic below. See also the CSL 2012 version of this article below.
Modal logic and distributed message passing automata. CSL 2013.
Expressivity of imperfect information logics without identity. Studia Logica, 2013
Undecidable first-order theories of affine geometries. With Jeremy Meyers and Jonni Virtema, CSL 2012.
Weak models of distributed computing, with connections to modal logic. With Lauri Hella, Matti Jarvisalo, Juhana Laurinharju, Tuomo Lempiainen, Kerkko Luosto, Jukka Suomela and Jonni Virtema. PODC 2012.
Complexity of two-variable dependence logic and IF-logic. With Juha Kontinen, Peter Lohmann and Jonni Virtema. LICS 2011.
Logics of imperfect information without identity Dependence and Independence in Logic, ESSLLI 2010.
Monadic Sigma-1-1 and modal logic with quantified binary relations. With Lauri Hella. Electronic Notes in Theoretical Computer Science, 2010.
A modal perspective on monadic second-order alternation hierarchies. AiML 2008.
A set of slides on this topic below.
Deduction systems for multimodal logics with operations on modalities

A selected subset of more important presentations:

[19/07/2024]: Descriptive complexity for distributed computing and neural networks, Simons Institute, University of California, Berkeley, United States. slides
[23/05/2024]: Human-interpretable AI via new logic-based methods, Productivity Leap (Digia), Tampere.
[14/05/2024]: Descriptive complexity for distributed computing with circuits. Seminar at Inst. Theoretische Informatik, Leibniz University, Hanover, Germany.
[05/04/2024]: Short Boolean formulas as explanations. Solita talks, Solita Tampere. slides
[22/02/2024]: Descriptive complexity for neural networks via Boolean networks. CSL 2024, Napoli, Italy.
[04/01/2024]: Logic as a basis for understanding information. Finnish Math Days, Aalto-yliopisto, Finland
[18/12/2023]: Short Boolean Formulas as Explanations (introductory talk), Solita, Tampere.
[28/11/2023]: Descriptive Complexity for Distributed Computing with Circuits. Mini-Symposium: “Logic and Problem Solving”, TU Wien, Austria.
[27/11/2023]: Explaining with Short Boolean Formulas in Practice. Joint talk with Tomi Janhunen. Mini-Symposium: “Logic and Problem Solving”, TU Wien, Austria. slides
[8/11/2023]: Short Boolean Formulas as Explanations in Practice, AI Day 2023, Aalto University, Finland.
[29/08/2023]: Descriptive complexity for distributed computing with circuits, MFCS 2023, Bordeaux, France.
[08/03/2023]: Relating description complexity to entropy, STACS 2023, Hamburg, Germany. slides
[05/09/2022] Explainability via Short Formulas: the Case of Propositional Logic with Implementation, RCRA 2022, Genova, Italy.
[03/06/2022] Results on Explainability. SLDM seminar, Tampere.
[15/11/2021] Research and teaching career outline. MTT-urapaneeli, a session organized by LUUPPI Ry to students about careers. Tampere University.
[11/11/2021] Is there a number one formal logic? Matematiikanfilosofiaa Suomessa (philosophy of mathematics in Finland) meeting.
[01/09/2020]: Gradual Guaranteed Coordination in Repeated Win-Lose Coordination Games, European Conference on Artificial Intelligence (ECAI) 2020. slides
[28/01/2020]: A Turing-complete extension of first-order logic Seminar on Semantics, Paris Diderot, France. '
[20/11/2019]: A Turing-complete extension of first-order logic Circularity in Syntax and Semantics (CISS) 2019, Gothenburg, Sweden.
[07/08/2019]: Turing-complete logic via game-theoretic semantics CLMPST 2019, Prague, Czech Republic.
[5/12/2018]: Computational logics - a theoretical perspective, Keynote talk, QCM-BioChem days INRIA, Nancy, France.
[11/06/2018]: Weighted model counting beyond two-variable logic. LICS 2018, Oxford, UK.
[22/04/2016]: On the uniform one-dimensional fragment. Description Logics DL' 2016, Capetown, South Africa.
[07/03/2016]: Turing-complete extensions of first-order logic. Millican Colloquium, University of North Texas.
[05/08/2015]: Propositional logics of dependence and relativised knowledge. CLMPST, Helsinki.
[20/02/2015]: Computability, natural language and canonical logics. CLLAM Seminar, Stockholm University, Sweden.
[17/12/2014]: Uniform one-dimensional fragment of first-order logic. University of Tampere, Finland.
[26/11/2014]: Uniform one-dimensional fragment of first-order logic. Stockholm University, Sweden.
[12/09/2014]: Infinite networks, halting and local algorithms. GandALF 2014, Verona, Italy.
[11/09/2014]: Some Turing-complete extensions of first-order logic. GandALF 2014, Verona, Italy.
[28/08/2014]: Complexity and expressivity of uniform one-dimensional fragment with equality, MFCS 2014, Budapest, Hungary.
[25/08/2014]: Some Turing-complete extensions of first-order logic, Scandinavian logic symposium, Tampere, Finland.
[08/08/2014]: One-dimensional fragment of first-order logic, AiML 2014, Groningen, the Netherlands.
[03/07/2014]: Descriptive complexity theory of distributed computing, INRIA/IRISA, University of Rennes 1, Rennes, France.
[11/06/2014]: Complexity of uniform one-dimensional fragment with equality, Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Poland.
[21/05/2014]: Generalized operators, team semantics and game-theoretic semantics, University of Helsinki, Finland.
[03/03/2014]: Generalized atoms and quantifiers, Academy Deplog Colloquium, Amsterdam, Netherlands.
[17/10/2013]: Descriptive Complexity Theory of Distributed Computing, Opole University, Poland.
[03/09/2013]: Modal logic and distributed message passing automata, CSL 2013, Torino. slides
[19/04/2013]: Strong systems of modal logic, with connections to distributed computing, FMT research seminar, University of Helsinki.
[31/01/2013]: Second-Order Logic and Definability, invited talk at the 85th Workshop on General Algebra (AAA85), Luxembourg.
[21/09/2012]: Distributed computing and modal logic, Finite Model Theory research seminar, University of Tampere.
[03/09/2012]: Undecidable first-order theories of affine geometries, CSL 2012, Fontainebleau, France.
[17/07/2012]: Weak Models of distributed computing, with connections to modal logic, PODC 2012, Madeira. slides here
[12/07/2012]: Weak Models of distributed computing, with connections to modal logic, HIIT seminar, Helsinki.
[26/06/2012]: Undecidable first-order theories of affine geometries, LICS 2012, Dubrovnik, Croatia.
[04/01/2012]: Some undecidable systems of formal geometry, Finnish Math Days 2012.
[07/10/2011]: On formal theories of geometry, FMT Research Seminar, University of Helsinki.
[17/08/2010]: Logics of imperfect information without identity, Workshop on Dependence and Independence in Logic, ESSLLI 2010, Copenhagen.
[26/05/2010]: Modal logics and definability, TISE Seminar.
[07/05/2010]: On fragments of IF logic, Finite Model Theory Research Seminar, University of Tampere.
[12/11/2009]: Monadic Sigma-1-1 and modal logic with quantified binary relations, M4M-6 2009, Copenhagen.
[07/10/2009]: Monadic Sigma-1-1 and modal logic with quantified binary relations, poster, 'LogICCC meets China' Day, Southwest University, Chongqing, China.
[03/09/2009]: Modal logic with quantified binary relations, Finite Model Theory Research Seminar, University of Tampere.
[17/04/2009]: \Sigma^1_1(FO^2), Finite Model Theory Research Seminar, University of Tampere.
[20/02/2009]: Similarity relations and modalisation, the First LogCon Workshop of LINT, February 2009, Tampere, Finland.
[08/01/2009]: SOPML, Meeting of MALJA, University of Helsinki.
[14/11/2008]: On modal fragments of SO, Finite Model Theory Research Seminar, University of Tampere.
[09/09/2008]: A Modal perspective on MSO alternation hierarchies, AiML 2008, 9-12 September 2008, LORIA, Nancy, France.
[23/05/2008]: SOPML alternation hierarchy, Finite Model Theory Research Seminar, University of Helsinki.
[25/01/2008]: Second-order propositional modal logic, Finite Model Theory Research Seminar, University of Helsinki.

Antti Kuusisto

Papers

A selected subset of more important presentations:

Teaching

Other work