"Jaakkola, Reijo" - Selaus tekijän mukaan TUNICRIS-julkaisut

Viitteet 1-8 / 8

    • Complexity Classifications via Algebraic Logic 

      Jaakkola, Reijo; Kuusisto, Antti; Klin, Bartek; Pimentel, Elaine (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 01.02.2023)
      conferenceObject
      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 base system ...

    • Complexity of Polyadic Boolean Modal Logics : Model Checking and Satisfiability 

      Jaakkola, Reijo; Klin, Bartek; Pimentel, Elaine (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 01.02.2023)
      conferenceObject
      We study the computational complexity of model checking and satisfiability problems of polyadic modal logics extended with permutations and Boolean operators on accessibility relations. First, we show that the combined ...

    • 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 (CEUR Workshop Proceedings, 05.09.2022)
      conferenceObject
      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 ...

    • Ordered Fragments of First-Order Logic 

      Jaakkola, Reijo; Bonchi, Filippo; Puglisi, Simon J. (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 01.08.2021)
      conferenceObject
      Using a recently introduced algebraic framework for classifying fragments of first-order logic, we study the complexity of the satisfiability problem for several ordered fragments of first-order logic, which are obtained ...

    • Relating Description Complexity to Entropy 

      Jaakkola, Reijo; Kuusisto, Antti; Vilander, Miikka; Berenbrink, Petra; Bouyer, Patricia; Dawar, Anuj; Kante, Mamadou Moustapha (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 01.03.2023)
      conferenceObject
      We demonstrate some novel links between entropy and description complexity, a notion referring to the minimal formula length for specifying given properties. Let MLU be the logic obtained by extending propositional logic ...

    • Short Boolean Formulas as Explanations in Practice 

      Jaakkola, Reijo; Janhunen, Tomi; Kuusisto, Antti; Feyzbakhsh Rankooh, Masood; Vilander, Miikka; Gaggl, Sarah; Martinez, Maria Vanina; Ortiz, Magdalena (Springer, 24.09.2023)
      conferenceObject
      We investigate explainability via short Boolean formulas in the data model based on unary relations. As an explanation of length k, we take a Boolean formula of length k that minimizes the error with respect to the target ...

    • Towards a Model Theory of Ordered Logics : Expressivity and Interpolation 

      Bednarczyk, Bartosz; Jaakkola, Reijo; Szeider, Stefan; Ganian, Robert; Silva, Alexandra (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 08 / 2022)
      conferenceObject
      We consider the family of guarded and unguarded ordered logics, that constitute a recently rediscovered family of decidable fragments of first-order logic (FO), in which the order of quantification of variables coincides ...

    • Uniform Guarded Fragments 

      Jaakkola, Reijo; Bouyer, Patricia; Schröder, Lutz (Springer, 2022)
      conferenceObject
      In this paper we prove that the uniform one-dimensional guarded fragment, which is a natural polyadic generalization of guarded two-variable logic, has the Craig interpolation property. We will also prove that the ...