activity
20082019
most citedModal Independence Logic

18 citations · 67 across the 14 of their papers we have counts for

collaborators

18 papers

cs.SE2019

Comparing Static and Dynamic Weighted Software Coupling Metrics

Henning Schnoor, Wilhelm Hasselbring

Coupling metrics are an established way to measure software architecture quality with respect to modularity. Static coupling metrics are obtained from the source or compiled code o…

cs.CC2016★ 2 cited

Complexity Dichotomies for Unweighted Scoring Rules

Edith Hemaspaandra, Henning Schnoor

Scoring systems are an extremely important class of election systems. We study the complexity of manipulation, constructive control by deleting voters (CCDV), and bribery for scori…

cs.LO2014

The Relative Succinctness and Expressiveness of Modal Logics Can Be Arbitrarily Complex

Henning Schnoor

We study the relative succinctness and expressiveness of modal logics, and prove that these relationships can be as complex as any countable partial order. For this, we use two uni…

cs.LO2014

A Van Benthem Theorem for Modal Team Semantics

Juha Kontinen, Julian-Steffen Müller, Henning Schnoor +1

The famous van Benthem theorem states that modal logic corresponds exactly to the fragment of first-order logic that is invariant under bisimulation. In this article we prove an ex…

cs.GT2014★ 14 cited

A Control Dichotomy for Pure Scoring Rules

Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor

Scoring systems are an extremely important class of election systems. A length- (so-called) scoring vector applies only to -candidate elections. To handle general elections,…

cs.CR2014★ 1 cited

On Defendability of Security Properties

Wojciech Jamroga, Matthijs Melissen, Henning Schnoor

We study the security of interaction protocols when incentives of participants are taken into account. We begin by formally defining correctness of a protocol, given a notion of ra…