default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntti Kuusisto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c36]Veeti Ahvonen
, Damian Heiman, Antti Kuusisto:
Descriptive Complexity for Neural Networks via Boolean Networks. CSL 2024: 9:1-9:22- [c35]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Interpretable Classifiers for Tabular Data via Feature Selection and Discretization. DAO-XAI@ECAI 2024 - [i37]Veeti Ahvonen, Damian Heiman, Antti Kuusisto:
Graded modal logic and counting message passing automata. CoRR abs/2401.06519 (2024) - [i36]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Interpretable classifiers for tabular data via discretization and feature selection. CoRR abs/2402.05680 (2024) - [i35]Veeti Ahvonen, Damian Heiman, Antti Kuusisto, Carsten Lutz:
Logical Characterizations of Recurrent Graph Neural Networks with Reals and Floats. CoRR abs/2405.14606 (2024) - [i34]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Globally Interpretable Classifiers via Boolean Formulas with Dynamic Propositions. CoRR abs/2406.01114 (2024) - [i33]Reijo Jaakkola, Antti Kuusisto, Miikka Vilander:
Description Complexity of Unary Structures in First-Order Logic with Links to Entropy. CoRR abs/2406.02108 (2024) - 2023
- [j19]Antti Kuusisto, Raine Rönnholm:
The optimal way to play the most difficult repeated two-player coordination games. Discret. Appl. Math. 339: 36-52 (2023) - [c34]Reijo Jaakkola, Antti Kuusisto:
Complexity Classifications via Algebraic Logic. CSL 2023: 27:1-27:18 - [c33]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Short Boolean Formulas as Explanations in Practice. JELIA 2023: 90-105 - [c32]Veeti Ahvonen, Damian Heiman, Lauri Hella, Antti Kuusisto:
Descriptive Complexity for Distributed Computing with Circuits. MFCS 2023: 9:1-9:15 - [c31]Reijo Jaakkola, Antti Kuusisto, Miikka Vilander:
Relating Description Complexity to Entropy. STACS 2023: 38:1-38:18 - [i32]Reijo Jaakkola, Antti Kuusisto, Miikka Vilander:
A monotone connection between model class size and description length. CoRR abs/2301.13800 (2023) - [i31]Veeti Ahvonen, Damian Heiman, Lauri Hella, Antti Kuusisto:
Descriptive complexity for distributed computing with circuits. CoRR abs/2303.04735 (2023) - [i30]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Short Boolean Formulas as Explanations in Practice. CoRR abs/2307.06971 (2023) - [i29]Veeti Ahvonen, Damian Heiman, Antti Kuusisto:
Descriptive complexity for neural networks via Boolean networks. CoRR abs/2308.06277 (2023) - 2022
- [j18]Lauri Hella, Antti Kuusisto, Raine Rönnholm:
Bounded game-theoretic semantics for modal mu-calculus. Inf. Comput. 289(Part): 104882 (2022) - [j17]Emanuel Kieronski, Antti Kuusisto:
One-dimensional fragment over words and trees. J. Log. Comput. 32(5): 902-941 (2022) - [c30]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Explainability via Short Formulas: the Case of Propositional Logic with Implementation. HYDRA/RCRA@LPNMR 2022: 64-77 - [i28]Antti Kuusisto:
On expressive rule-based logics. CoRR abs/2202.01761 (2022) - [i27]Reijo Jaakkola, Antti Kuusisto:
First-order logic with self-reference. CoRR abs/2207.07397 (2022) - [i26]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Explainability via Short Formulas: the Case of Propositional Logic with Implementation. CoRR abs/2209.01403 (2022) - [i25]Reijo Jaakkola, Antti Kuusisto, Miikka Vilander:
Relating description complexity to entropy. CoRR abs/2209.12564 (2022) - 2021
- [j16]Valentin Goranko, Antti Kuusisto, Raine Rönnholm:
Game-theoretic semantics for ATL+ with applications to model checking. Inf. Comput. 276: 104554 (2021) - [c29]Antti Kuusisto, Raine Rönnholm:
The Optimal Way to Play the Most Difficult Repeated Coordination Games. GandALF 2021: 101-116 - [i24]Jonne Iso-Tuisku, Antti Kuusisto:
Description logics as polyadic modal logics. CoRR abs/2108.08838 (2021) - [i23]Emanuel Kieronski, Antti Kuusisto:
One-Dimensional Fragment over Words and Trees. CoRR abs/2110.02678 (2021) - 2020
- [j15]Antti Kuusisto, Fabian Reiter:
Emptiness problems for distributed automata. Inf. Comput. 272: 104503 (2020) - [j14]Valentin Goranko, Antti Kuusisto, Raine Rönnholm:
Rational coordination with no communication or conventions. J. Log. Comput. 30(6): 1183-1211 (2020) - [j13]Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. ACM Trans. Comput. Log. 21(1): 7:1-7:18 (2020) - [c28]Valentin Goranko, Antti Kuusisto, Raine Rönnholm:
Gradual Guaranteed Coordination in Repeated Win-Lose Coordination Games. ECAI 2020: 115-122 - [c27]Lauri Hella, Antti Kuusisto, Raine Rönnholm:
Bounded Game-Theoretic Semantics for Modal Mu-Calculus and Some Variants. GandALF 2020: 82-96 - [i22]Antti Kuusisto, Raine Rönnholm:
Optimal protocols for the most difficult repeated coordination games. CoRR abs/2004.07381 (2020) - [i21]Reijo Jaakkola, Antti Kuusisto:
Algebraic classifications for fragments of first-order logic and beyond. CoRR abs/2005.01184 (2020)
2010 – 2019
- 2019
- [j12]Cristina Feier, Antti Kuusisto, Carsten Lutz:
Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics. Log. Methods Comput. Sci. 15(2) (2019) - [j11]Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema:
Model checking and validity in propositional and modal inclusion logics. J. Log. Comput. 29(5): 605-630 (2019) - [j10]Valentin Goranko, Antti Kuusisto, Raine Rönnholm:
Alternating-time temporal logic ATL with finitely bounded semantics. Theor. Comput. Sci. 797: 129-155 (2019) - [i20]Antti Kuusisto:
On Games and Computation. CoRR abs/1910.14603 (2019) - 2018
- [j9]Valentin Goranko, Antti Kuusisto:
Logics for Propositional Determinacy and Independence. Rev. Symb. Log. 11(3): 470-506 (2018) - [j8]Valentin Goranko, Antti Kuusisto, Raine Rönnholm:
Game-Theoretic Semantics for Alternating-Time Temporal Logic. ACM Trans. Comput. Log. 19(3): 17:1-17:38 (2018) - [c26]Antti Kuusisto, Carsten Lutz:
Weighted model counting beyond two-variable logic. LICS 2018: 619-628 - [i19]Antti Kuusisto, Carsten Lutz:
Weighted model counting beyond two-variable logic. CoRR abs/1804.10185 (2018) - 2017
- [c25]Valentin Goranko, Antti Kuusisto, Raine Rönnholm:
Game-Theoretic Semantics for ATL+ with Applications to Model Checking. AAMAS 2017: 1277-1285 - [c24]Valentin Goranko, Antti Kuusisto, Raine Rönnholm:
Rational Coordination in Games with Enriched Representations. EUMAS/AT 2017: 323-338 - [c23]Cristina Feier, Antti Kuusisto, Carsten Lutz:
Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk). ICDT 2017: 1:1-1:17 - [c22]Valentin Goranko, Antti Kuusisto, Raine Rönnholm:
Rational Coordination with no Communication or Conventions. LORI 2017: 33-48 - [c21]Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema:
Model Checking and Validity in Propositional and Modal Inclusion Logics. MFCS 2017: 32:1-32:14 - [c20]Emanuel Kieronski, Antti Kuusisto:
One-Dimensional Logic over Trees. MFCS 2017: 64:1-64:13 - [c19]Valentin Goranko, Antti Kuusisto, Raine Rönnholm:
CTL with Finitely Bounded Semantics. TIME 2017: 14:1-14:19 - [c18]Antti Kuusisto, Fabian Reiter:
Emptiness Problems for Distributed Automata. GandALF 2017: 210-222 - [i18]Cristina Feier, Antti Kuusisto, Carsten Lutz:
Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics. CoRR abs/1701.02231 (2017) - [i17]Valentin Goranko, Antti Kuusisto, Raine Rönnholm:
Game-Theoretic Semantics for ATL+ with Applications to Model Checking. CoRR abs/1702.08405 (2017) - [i16]Antti Kuusisto:
First-order logic with incomplete information. CoRR abs/1703.03391 (2017) - [i15]Lauri Hella, Antti Kuusisto, Raine Rönnholm:
Bounded game-theoretic semantics for modal mu-calculus. CoRR abs/1706.00753 (2017) - [i14]Valentin Goranko, Antti Kuusisto, Raine Rönnholm:
Rational coordination with no communication or conventions. CoRR abs/1706.07412 (2017) - 2016
- [j7]Lauri Hella, Antti Kuusisto:
Existential second-order logic and modal logic with quantified accessibility relations. Inf. Comput. 247: 217-234 (2016) - [c17]Valentin Goranko, Antti Kuusisto, Raine Rönnholm:
Game-Theoretic Semantics for Alternating-Time Temporal Logic. AAMAS 2016: 671-679 - [c16]Cristina Feier, Antti Kuusisto, Carsten Lutz:
FO-Rewritability of Expressive Ontology-Mediated Queries. Description Logics 2016 - [c15]Antti Kuusisto:
On the Uniform One-dimensional Fragment. Description Logics 2016 - [c14]Juha Kontinen, Antti Kuusisto, Jonni Virtema:
Decidability of Predicate Logics with Team Semantics. MFCS 2016: 60:1-60:14 - [i13]Valentin Goranko, Antti Kuusisto, Raine Rönnholm:
Game-Theoretic Semantics for Alternating-Time Temporal Logic. CoRR abs/1602.07667 (2016) - [i12]Antti Kuusisto:
On the uniform one-dimensional fragment. CoRR abs/1604.01673 (2016) - [i11]Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema:
Model Checking and Validity in Propositional and Modal Inclusion Logics. CoRR abs/1609.06951 (2016) - [i10]Valentin Goranko, Antti Kuusisto:
Logics for Propositional Determinacy and Independence. CoRR abs/1609.07398 (2016) - 2015
- [j6]Antti Kuusisto:
Second-order propositional modal logic and monadic alternation hierarchies. Ann. Pure Appl. Log. 166(1): 1-28 (2015) - [j5]Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema:
Weak models of distributed computing, with connections to modal logic. Distributed Comput. 28(1): 31-53 (2015) - [j4]Antti Kuusisto:
A Double Team Semantics for Generalized Quantifiers. J. Log. Lang. Inf. 24(2): 149-191 (2015) - [c13]Emanuel Kieronski, Antti Kuusisto:
Uniform One-Dimensional Fragments with One Equivalence Relation. CSL 2015: 597-615 - [c12]Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Modal Inclusion Logic: Being Lax is Simpler than Being Strict. MFCS (1) 2015: 281-292 - [c11]Antti Kuusisto:
Team Semantics and Recursive Enumerability. SOFSEM (Student Research Forum Papers / Posters) 2015: 132-139 - [i9]Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. CoRR abs/1504.06409 (2015) - 2014
- [j3]Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema:
Complexity of two-variable dependence logic and IF-logic. Inf. Comput. 239: 237-253 (2014) - [c10]Lauri Hella, Antti Kuusisto:
One-dimensional Fragment of First-order Logic. Advances in Modal Logic 2014: 274-293 - [c9]Emanuel Kieronski, Antti Kuusisto:
Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality. MFCS (1) 2014: 365-376 - [c8]Antti Kuusisto:
Some Turing-Complete Extensions of First-Order Logic. GandALF 2014: 4-17 - [c7]Antti Kuusisto:
Infinite Networks, Halting and Local Algorithms. GandALF 2014: 147-160 - [i8]Lauri Hella, Antti Kuusisto:
One-dimensional fragment of first-order logic. CoRR abs/1404.4004 (2014) - [i7]Antti Kuusisto:
Team Semantics and Recursive Enumerability. CoRR abs/1408.4080 (2014) - [i6]Emanuel Kieronski, Antti Kuusisto:
Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality. CoRR abs/1409.0731 (2014) - [i5]Juha Kontinen, Antti Kuusisto, Jonni Virtema:
Decidable Fragments of Logics Based on Team Semantics. CoRR abs/1410.5037 (2014) - 2013
- [j2]Antti Kuusisto, Jeremy Meyers, Jonni Virtema:
Undecidable First-Order Theories of Affine Geometries. Log. Methods Comput. Sci. 9(4) (2013) - [j1]Antti Kuusisto:
Expressivity of Imperfect Information Logics without Identity. Stud Logica 101(2): 237-265 (2013) - [c6]Antti Kuusisto:
Modal Logic and Distributed Message Passing Automata. CSL 2013: 452-468 - [i4]Antti Kuusisto:
A Double Team Semantics for Generalized Quantifiers. CoRR abs/1310.3032 (2013) - 2012
- [c5]Antti Kuusisto, Jeremy Meyers, Jonni Virtema:
Undecidable First-Order Theories of Affine Geometries. CSL 2012: 470-484 - [c4]Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema:
Weak models of distributed computing, with connections to modal logic. PODC 2012: 185-194 - [i3]Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema:
Weak Models of Distributed Computing, with Connections to Modal Logic. CoRR abs/1205.2051 (2012) - [i2]Antti Kuusisto, Jeremy Meyers, Jonni Virtema:
Undecidable First-Order Theories of Affine Geometries. CoRR abs/1208.4930 (2012) - 2011
- [c3]Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema:
Complexity of Two-Variable Dependence Logic and IF-Logic. LICS 2011: 289-298 - [i1]Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema:
Complexity of two-variable Dependence Logic and IF-Logic. CoRR abs/1104.3148 (2011)
2000 – 2009
- 2009
- [c2]Lauri Hella, Antti Kuusisto:
Monadic Sigma11 and Modal Logic with Quantified Binary Relations. M4M 2009: 173-188 - 2008
- [c1]Antti Kuusisto:
A modal perspective on monadic second-order alternation hierarchies. Advances in Modal Logic 2008: 231-247
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-08 02:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
