Schnoor, Henning
- A Control Dichotomy for Pure Scoring Rules
2014/04/17 by Edith Hemaspaandra, Lane A. Hemaspaandra, Hemaspaandra, Edith +3 · 3 citations
Computer Science · Economics, Econometrics and Finance · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Computer Science and Game Theory (cs.GT) #F.2.2 #FOS: Computer and information sciences #Formal Methods in Verification #Game Theory and Voting Systems #I.2.11 #Multiagent Systems (cs.MA) #cs.CC #cs.GT #cs.MA
- Generalized Modal Satisfiability
2008/04/17 by Edith Hemaspaandra, Henning Schnoor, Hemaspaandra, Edith +3 · 1 citation
Computer Science · #AI-based Problem Solving and Planning #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #cs.CC #cs.LO
- The Tractability of Model-Checking for LTL: The Good, the Bad, and the\n Ugly Fragments
2008/05/05 by Michael Bauland, Martin Mundhenk, Bauland, Michael +9 · 1 citation
Computer Science · #Computational Complexity (cs.CC) #F.4.1 #FOS: Computer and information sciences #Formal Methods in Verification #I.2.4 #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems
- Comparing Static and Dynamic Weighted Software Coupling Metrics
2019/09/27 by Schnoor, Henning, Hasselbring, Wilhelm · 1 citation
#FOS: Computer and information sciences #Software Engineering (cs.SE)
- A Van Benthem Theorem for Modal Team Semantics
2014/10/24 by Kontinen, Juha, Müller, Julian-Steffen, Schnoor, Henning +1 · 1 citation
#FOS: Computer and information sciences #Logic in Computer Science (cs.LO)