Sciweavers

46 search results - page 6 / 10
» The Descriptive Complexity of Parity Games
Sort
View
VMCAI
2010
Springer
14 years 5 months ago
Improved Model Checking of Hierarchical Systems
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...
Benjamin Aminof, Orna Kupferman, Aniello Murano
DLOG
2009
13 years 5 months ago
A Combination of Boolean Games with Description Logics for Automated Multi-Attribute Negotiation
Abstract. Multi-attribute negotiation has been extensively studied from a gametheoretic viewpoint. In negotiation settings, utility functions are used to express agent preferences....
Thomas Lukasiewicz, Azzurra Ragone
JELIA
2004
Springer
14 years 1 months ago
Representation and Complexity in Boolean Games
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
Paul E. Dunne, Wiebe van der Hoek
GI
2009
Springer
13 years 5 months ago
Using Semantic UI Descriptions for Adaptive Mobile Games
: In recent years, mobile devices became more and more powerful, wireless Internet access is becoming standard. To support mobile applications adapting their User Interface to vari...
Pascal Bihler, Holger Mügge, Mark Schmatz, Ar...
LCC
1994
248views Algorithms» more  LCC 1994»
13 years 11 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin