892 search results - page 27 / 179 » Strategies in sentential reasoning |
130
click to vote
SYNTHESE
2010
15 years 2 months ago
2010
There exists a considerable body of work on epistemic logics for resource-bounded reasoners. In this paper, we concentrate on a less studied aspect of resource-bounded reasoning, n...
117
click to vote
EMSOFT
2007
Springer
15 years 10 months ago
2007
Springer
E-FRP is declarative language for programming resourcebounded, event-driven systems. The original high-level semantics of E-FRP requires that each event handler execute atomically...
212
click to vote
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
ACD Term Rewriting (ACDTR) is term rewriting modulo associativity, commutativity, and a limited form of distributivity called conjunctive context. Previous work presented an implem...
152
click to vote
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
129
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...