Lauri Hella

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 32

Top Topics

Prime Implicates

Expressive Power

Top Venues

Advances in Modal Logic

Publications

Anuj Dawar, Lauri Hella
Quantifiers Closed Under Partial Polymorphisms. CSL (2024)
Veeti Ahvonen, Damian Heiman, Lauri Hella, Antti Kuusisto
Descriptive Complexity for Distributed Computing with Circuits. MFCS (2023)
Lauri Hella
The Expressive Power of CSP-Quantifiers. CSL (2023)
Lauri Hella, Juha Kontinen, Kerkko Luosto
Regular Representations of Uniform TC^0. CoRR (2023)
Anuj Dawar, Lauri Hella
Quantifiers closed under partial polymorphisms. CoRR (2023)
Veeti Ahvonen, Damian Heiman, Lauri Hella, Antti Kuusisto
Descriptive complexity for distributed computing with circuits. CoRR (2023)
Miika Hannula, Lauri Hella
Complexity thresholds in inclusion logic. Inf. Comput. 287 (2022)
Lauri Hella, Antti Kuusisto, Raine Rönnholm
Bounded game-theoretic semantics for modal mu-calculus. Inf. Comput. 289 (Part) (2022)
Lauri Hella, Miikka Vilander
Defining long words succinctly in FO and MSO. CoRR (2022)
Lauri Hella, Miikka Vilander
Defining Long Words Succinctly in FO and MSO. CiE (2022)
Fausto Barbero, Lauri Hella, Raine Rönnholm
Independence-friendly logic without Henkin quantification. Arch. Math. Log. 60 (5) (2021)
Antti Valmari, Lauri Hella
A Completeness Proof for A Regular Predicate Logic with Undefined Truth Value. CoRR (2021)
Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. ACM Trans. Comput. Log. 21 (1) (2020)
Lauri Hella, Antti Kuusisto, Raine Rönnholm
Bounded Game-Theoretic Semantics for Modal Mu-Calculus and Some Variants. GandALF (2020)
Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema
Model checking and validity in propositional and modal inclusion logics. J. Log. Comput. 29 (5) (2019)
Lauri Hella, Miikka Vilander
Formula size games for modal logic and μ-calculus. CoRR (2019)
Miika Hannula, Lauri Hella
Complexity Thresholds in Inclusion Logic. WoLLIC (2019)
Miika Hannula, Lauri Hella
Complexity Thresholds in Inclusion Logic. CoRR (2019)
Lauri Hella, Miikka Vilander
Formula size games for modal logic and μ-calculus. J. Log. Comput. 29 (8) (2019)
Johannes Ebbing, Lauri Hella, Peter Lohmann, Jonni Virtema
Boolean dependence logic and partially-ordered connectives. J. Comput. Syst. Sci. 88 (2017)
Lauri Hella, Antti Kuusisto, Raine Rönnholm
Bounded game-theoretic semantics for modal mu-calculus. CoRR (2017)
Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema
Model Checking and Validity in Propositional and Modal Inclusion Logics. MFCS (2017)
Fausto Barbero, Lauri Hella, Raine Rönnholm
Independence-Friendly Logic Without Henkin Quantification. WoLLIC (2017)
Lauri Hella, Miikka Vilander
The succinctness of first-order logic over modal logic via a formula size game. Advances in Modal Logic (2016)
Lauri Hella, Miikka Vilander
The Succinctness of First-order Logic over Modal Logic via a Formula Size Game. CoRR (2016)
Lauri Hella, Antti Kuusisto
Existential second-order logic and modal logic with quantified accessibility relations. Inf. Comput. 247 (2016)
Lauri Hella, Phokion G. Kolaitis
Dependence Logic vs. Constraint Satisfaction. CSL (2016)
Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema
Model Checking and Validity in Propositional and Modal Inclusion Logics. CoRR (2016)
Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. CoRR (2015)
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) (2015)
Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
Modal Inclusion Logic: Being Lax is Simpler than Being Strict. MFCS (1) (2015)
Lauri Hella, Johanna Stumpf
The expressive power of modal logic with inclusion atoms. GandALF (2015)
Lauri Hella, Antti Kuusisto
One-dimensional Fragment of First-order Logic. Advances in Modal Logic (2014)
Lauri Hella, Antti Kuusisto
One-dimensional fragment of first-order logic. CoRR (2014)
Johannes Ebbing, Lauri Hella, Peter Lohmann, Jonni Virtema
Boolean Dependence Logic and Partially-Ordered Connectives. CoRR (2014)
Lauri Hella, Kerkko Luosto, Katsuhiko Sano, Jonni Virtema
The Expressive Power of Modal Dependence Logic. Advances in Modal Logic (2014)
Lauri Hella, Kerkko Luosto, Katsuhiko Sano, Jonni Virtema
The Expressive Power of Modal Dependence Logic. CoRR (2014)
Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Müller, Jonni Virtema, Heribert Vollmer
Extended Modal Dependence Logic. WoLLIC (2013)
Pietro Galliani, Lauri Hella
Inclusion Logic and Fixed Point Logic CoRR (2013)
Pietro Galliani, Lauri Hella
Inclusion Logic and Fixed Point Logic. CSL (2013)
Lauri Hella, Tero Tulenheimo
On the existence of a modal-logical basis for monadic second-order logic. J. Log. Comput. 23 (1) (2013)
Johannes Ebbing, Lauri Hella, Peter Lohmann, Jonni Virtema
Boolean Dependence Logic and Partially-Ordered Connectives. WoLLIC (2013)
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 (2012)
Lauri Hella, Jouko A. Väänänen
The size of a formula as a measure of complexity CoRR (2012)
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)
Lauri Hella, Antti Kuusisto
and Modal Logic with Quantified Binary Relations. Electron. Notes Theor. Comput. Sci. 262 (2010)
Miguel Couceiro, Lauri Hella, Jari Kivelä
Term Definable Classes of Boolean Functions and Frame Definability in Modal Logic. Log. J. IGPL 16 (1) (2008)
Lauri Hella, Merlijn Sevenster, Tero Tulenheimo
Partially Ordered Connectives and Monadic Monotone Strict NP. J. Log. Lang. Inf. 17 (3) (2008)
Lauri Hella, Jose Maria Turull Torres
Computing queries with higher-order logics. Theor. Comput. Sci. 355 (2) (2006)
Lauri Hella, Jose Maria Turull Torres
Complete Problems for Higher Order Logics. CSL (2006)
Lauri Hella, Jose Maria Turull Torres
Expressibility of Higher Order Logics. Electron. Notes Theor. Comput. Sci. 84 (2003)
Lauri Hella
Quantifying over Quantifiers. Electron. Notes Theor. Comput. Sci. 84 (2003)
Kjell Lemström, Lauri Hella
Approximate pattern matching and transitive closure logics. Theor. Comput. Sci. 299 (1-3) (2003)
Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong
Logics with aggregate operators. J. ACM 48 (4) (2001)
Kjell Lemström, Lauri Hella
Approximate Pattern Matching is Expressible in Transitive Closure Logic. LICS (2000)
Lauri Hella, Juha Nurmonen
Vectorization hierarchies of some graph quantifiers. Arch. Math. Log. 39 (3) (2000)
Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong
Logics with Aggregate Operators. LICS (1999)
Lauri Hella, Leonid Libkin, Juha Nurmonen
Notions of Locality and Their Logical Characterizations over Finite Models. J. Symb. Log. 64 (4) (1999)
Lauri Hella, Henrik Imhof
Enhancing Fixed Point Logic with Cardinality Quantifiers. J. Log. Comput. 8 (1) (1998)
Anuj Dawar, Lauri Hella, Anil Seth
Ordering Finite Variable Types with Generalized Quantifiers. LICS (1998)
Anuj Dawar, Georg Gottlob, Lauri Hella
Capturing Relativized Complexity Classes without Order. Math. Log. Q. 44 (1998)
Lauri Hella, Jouko A. Väänänen, Dag Westerståhl
Definability of Polyadic Lifts of Generalized Quantifiers. J. Log. Lang. Inf. 6 (3) (1997)
Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto
How to Define a Linear Order on Finite Models. Ann. Pure Appl. Log. 87 (3) (1997)
Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto
Almost everywhere equivalence of logics in finite model theory. Bull. Symb. Log. 2 (4) (1996)
Lauri Hella
Logical Hierarchies in PTIME. Inf. Comput. 129 (1) (1996)
Lauri Hella, Kerkko Luosto, Jouko A. Väänänen
The Hierarchy Theorem for Generalized Quantifiers. J. Symb. Log. 61 (3) (1996)
Martin Grohe, Lauri Hella
A double arity hierarchy theorem for transitive closure logic. Arch. Math. Log. 35 (3) (1996)
Anuj Dawar, Lauri Hella
The expressive Power of Finitely Many Generalized Quantifiers. Inf. Comput. 123 (2) (1995)
Anuj Dawar, Lauri Hella, Phokion G. Kolaitis
Implicit Definability and Infinitary Logic in Finite Model Theory. ICALP (1995)
Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto
How to Define a Linear Order on Finite Models LICS (1994)
Anuj Dawar, Lauri Hella
The Expressive Power of Finitely Many Generalized Quantifiers LICS (1994)
Lauri Hella, Kerkko Luosto
) Is Not Finitely Generated. J. Symb. Log. 57 (2) (1992)
Lauri Hella
Logical Hierarchies in PTIME LICS (1992)
Lauri Hella, Michal Krynicki
Remarks on The Cartesian Closure. Math. Log. Q. 37 (33-35) (1991)
Lauri Hella
Definability Hierarchies of Generalized Quantifiers. Ann. Pure Appl. Log. 43 (3) (1989)