Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Lauri Hella"'
Autor:
Lauri Hella, Johanna Stumpf
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 193, Iss Proc. GandALF 2015, Pp 129-143 (2015)
Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete characterisation for
Externí odkaz:
https://doaj.org/article/092fb78038d7426583230bb1fc18b650
Publikováno v:
Logic, Language, Information, and Computation ISBN: 9783662553855
WoLLIC
WoLLIC
We analyze the expressive resources of $$\mathrm {IF}$$ IF logic that do not stem from Henkin (partially-ordered) quantification. When one restricts attention to regular $$\mathrm {IF}$$ IF sentences, this amounts to the study of the fragment of $$\m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::26d4729b681b5fdf29ca3bd31acd9554
https://doi.org/10.1007/s00153-021-00781-8
https://doi.org/10.1007/s00153-021-00781-8
Publikováno v:
ACM Transactions on Computational Logic. 21:1-18
We investigate the computational complexity of the satisfiability problem of modal inclusion logic. We distinguish two variants of the problem: one for the strict and another one for the lax semantics. Both problems turn out to be EXPTIME-complete on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::805b7204402976fd16b9225297b8423c
https://doi.org/10.1145/3356043
https://doi.org/10.1145/3356043
Publikováno v:
Leibniz International Proceedings in Informatics, LIPIcs 83 (2017)
Article
Article
Propositional and modal inclusion logic are formalisms that belong to the family of logics based on team semantics. This article investigates the model checking and validity problems of these logics. We identify complexity bounds for both problems, c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3b9118b45152cdf3ce1c7d1c4de3388
https://doi.org/10.1093/logcom/exz008
https://doi.org/10.1093/logcom/exz008
Publikováno v:
GandALF
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 needed even when the considered trans
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b16a15e77cfd1903e1d9ad058b96a88d
Publikováno v:
Journal of Computer and System Sciences. 88:103-125
We introduce a new variant of dependence logic ( D ) called Boolean dependence logic ( BD ). In BD dependence atoms are of the type = ( x 1 , … , x n , α ) , where α is a Boolean variable. Intuitively, with Boolean dependence atoms one can expres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a2a06dac4652dc409b6130c535a23e2
https://doi.org/10.1016/j.jcss.2017.03.009
https://doi.org/10.1016/j.jcss.2017.03.009
Autor:
Lauri Hella, Miika Hannula
Publikováno v:
Logic, Language, Information, and Computation ISBN: 9783662595329
WoLLIC
WoLLIC
Inclusion logic differs from many other logics of dependence and independence in that it can only describe polynomial-time properties. In this article we examine more closely connections between syntactic fragments of inclusion logic and different co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d9e37c5f56c0110ec0f4ac2620ed2ac
https://doi.org/10.1007/978-3-662-59533-6_19
https://doi.org/10.1007/978-3-662-59533-6_19
Autor:
Miikka Vilander, Lauri Hella
We propose a new version of formula size game for modal logic. The game characterizes the equivalence of pointed Kripke-models up to formulas of given numbers of modal operators and binary connectives. Our game is similar to the well-known Adler-Imme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::272935a7ca86fef975e7121957dae606
https://trepo.tuni.fi/handle/10024/127195
https://trepo.tuni.fi/handle/10024/127195
Autor:
Lauri Hella, Antti Kuusisto
Publikováno v:
Information and Computation. 247:217-234
This article investigates the role of arity of second-order quantifiers in existential second-order logic, also known as Σ 1 1 . We identify fragments L of Σ 1 1 where second-order quantification of relations of arity k 1 is (nontrivially) vacuous
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76d07dd57ea0c455069f2147a172aaa9
https://doi.org/10.1016/j.ic.2016.01.003
https://doi.org/10.1016/j.ic.2016.01.003
Autor:
Lauri Hella, Vilander, M.
Publikováno v:
Scopus-Elsevier
We propose a new version of formula size game for modal logic. The game characterizes the equivalence of pointed Kripke-models up to formulas of given numbers of modal operators and binary connectives. Our game is similar to the well-known Adler-Imme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d47e17e16d9fe5650154fff677629888