Trepo - Selaus tekijän mukaan "Kuusisto, Antti"

Viitteet 1-20 / 33

    • Bounded game-theoretic semantics for modal mu-calculus 

      Hella, Lauri; Kuusisto, Antti; Rönnholm, Raine (2022)
      article
      <p>We introduce a new game-theoretic semantics (GTS) for the modal mu-calculus. Our so-called bounded GTS replaces parity games with alternative evaluation games where only finite paths arise; infinite paths are not ...

    • Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality 

      Kieronski, Emanuel; Kuusisto, Antti (Tampereen yliopisto, 2014)
      book
      Uniform one-dimensional fragment UF is a formalism obtained from first-order logic by limiting quantification to applications of blocks of existential (universal) quantifiers such that at most one variable remains free in ...

    • Complexity Classifications via Algebraic Logic 

      Jaakkola, Reijo; Kuusisto, Antti
      Leibniz International Proceedings in Informatics, LIPIcs (01.02.2023)
      conference
      <p>Complexity and decidability of logics is an active research area involving a wide range of different logical systems. We introduce an algebraic approach to complexity classifications of computational logics. Our ...

    • Cooperation and contract models in complex project networks 

      Kuusisto, Antti (2018)
      Diplomityö
      This thesis examined cooperation and contract models in complex project networks. The motivation to conduct this research originated from challenging projects that had included struggles with contractor cooperation and ...

    • CTL with Finitely Bounded Semantics 

      Valentin, Goranko; Kuusisto, Antti; Rönnholm, Raine; Schewe, Sven; Schneider, Thomas; Wijsen, Jef
      Leibniz International Proceedings in Informatics (LIPIcs) : 90 (Schloss Dagstuhl, 2017)
      conferenceObject

    • Deduction Systems for Multimodal Logics with Operations on Modalities 

      Kuusisto, Antti (Tampereen yliopisto, 2007)
      book
      This article is a brief, user friendly discourse on extensions of multi- modal logics with operations on modalities. Such logics are considered from a general point of view with the emphasis on the theory of deduc- tion ...

    • Defining a Double Team Semantics for Generalized Quantifiers 

      Kuusisto, Antti (Tampereen yliopisto, 2012)
      book
      In this brief technical report we sketch a semantics for fi rst-order logic with generalized quantifiers based on double teams. We also define the notion of a generalized atom. Such atoms can be used in order to define ...

    • Defining a Double Team Semantics for Generalized Quantifiers (Extended Version) 

      Kuusisto, Antti (Tampereen yliopisto, 2013)
      book
      In this brief technical report we sketch a semantics for first-order logic with generalized quantifi ers based on double teams. We also defi ne the notion of a generalized atom. Such atoms can be used in order to defi ne ...

    • Description Complexity of Unary Structures in First-Order Logic with Links to Entropy 

      Jaakkola, Reijo; Kuusisto, Antti; Vilander, Miikka
      Leibniz International Proceedings in Informatics, LIPIcs (03.02.2025)
      conference
      The description complexity of a model is the length of the shortest formula that defines the model. We study the description complexity of unary structures in first-order logic FO, also drawing links to semantic complexity ...

    • Descriptive Complexity for Distributed Computing with Circuits 

      Ahvonen, Veeti; Heiman, Damian; Hella, Lauri; Kuusisto, Antti
      Leibniz International Proceedings in Informatics, LIPIcs (08 / 2023)
      conference
      <p>We consider distributed algorithms in the realistic scenario where distributed message passing is operated by circuits. We show that within this setting, modal substitution calculus MSC precisely captures the ...

    • Descriptive complexity for distributed computing with circuits 

      Ahvonen, Veeti; Heiman, Damian; Hella, Lauri; Kuusisto, Antti (2025)
      article
      We investigate distributed computing with identifiers in the realistic scenario where the local computations in a distributed message passing setting are operated by Boolean circuits. We call this framework the message ...

    • Descriptive Complexity for Neural Networks via Boolean Networks 

      Ahvonen, Veeti; Heiman, Damian; Kuusisto, Antti
      Leibniz International Proceedings in Informatics (LIPIcs) (27.02.2024)
      conference
      We investigate the descriptive complexity of a class of neural networks with unrestricted topologies and piecewise polynomial activation functions. We consider the general scenario where the running time is unlimited and ...

    • Explainability via Short Formulas: the Case of Propositional Logic with Implementation 

      Jaakkola, Reijo; Janhunen, Tomi; Kuusisto, Antti; Feyzbakhsh Rankooh, Masood; Vilander, Miikka
      CEUR workshop proceedings (05.09.2022)
      conference
      We conceptualize explainability in terms of logic and formula size, giving a number of related definitions of explainability in a very general setting. Our main interest is the so-called special explanation problem which ...

    • Game-Theoretic Semantics for Alternating-Time Temporal Logic 

      Goranko, Valentin; Kuusisto, Antti; Rönnholm, Raine (2018)
      article

    • Gradual guaranteed coordination in repeatedwin-lose coordination games 

      Goranko, Valentin; Kuusisto, Antti; Rönnholm, Raine
      Frontiers in Artificial Intelligence and Applications (24.08.2020)
      conference
      <p>We investigate repeated win-lose coordination games and analyse when and how rational players can guarantee eventual coordination in such games. Our study involves both the setting with a protocol shared in advance ...

    • Infinite networks, halting and local algorithms (Draft) 

      Kuusisto, Antti (2013)
      book
      The immediate past has witnessed an increasing amount of interest in local algorithms, i.e., constant time distributed graph algorithms. In the recent survey of local algorithms (Suomela, ACM Computing Surveys, 2013), it ...

    • Interpretable classifiers for tabular data via feature selection and discretization 

      Jaakkola, Reijo; Janhunen, Tomi; Kuusisto, Antti; Feyzbakhsh Rankooh, Masood; Vilander, Miikka
      CEUR Workshop Proceedings (2024)
      conference
      <p>We introduce a method for computing immediately human interpretable yet accurate classifiers from tabular data. The classifiers obtained are short Boolean formulas, computed via first discretizing the original ...

    • Logical Characterizations of Recurrent Graph Neural Networks with Reals and Floats 

      Ahvonen, Veeti; Heiman, Damian; Kuusisto, Antti; Lutz, Carsten
      Advances in neural information processing systems (10.12.2024)
      conference
      In pioneering work from 2019, Barceló and coauthors identified logics that precisely match the expressive power of constant iteration-depth graph neural networks (GNNs) relative to properties definable in first-order logic. ...

    • Logics of Imperfect Information without Identity 

      Kuusisto, Antti (2011)
      book
      We investigate the expressive power of sentences of the family of independence friendly (IF) logics in the equality-free setting. Various natural equality-free fragments of logics in this family translate into the version ...

    • Modal Fragments of Second-Order Logic 

      Kuusisto, Antti
      Acta Electronica Universitatis Tamperensis : 1119 (Tampere University Press, 2011)
      Väitöskirja
      Formaalin logiikan tutkimuskohteina ovat erilaiset muodolliset systeemit eli logiikat, joiden avulla voidaan mm. mekanisoida monenlaisia päättelyprosesseja. Eräs modernin formaalin logiikan keskeisistä tutkimusaiheista on ...