523 search results - page 97 / 105 » Decidability of string graphs |
AI
2002
Springer
14 years 9 months ago
2002
Springer
Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two imp...
FUIN
2010
14 years 8 months ago
2010
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
MFCS
2010
Springer
14 years 7 months ago
2010
Springer
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
FORMATS
2010
Springer
14 years 7 months ago
2010
Springer
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...
CISC
2009
Springer
14 years 7 months ago
2009
Springer
The anticipation game framework is an extension of attack graphs based on game theory. It is used to anticipate and analyze intruder and administrator concurrent interactions with ...