Sciweavers

892 search results - page 27 / 179
» Strategies in sentential reasoning
Sort
View
SYNTHESE
2010
130views more  SYNTHESE 2010»
13 years 6 months ago
Belief ascription under bounded resources
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...
Natasha Alechina, Brian Logan
EMSOFT
2007
Springer
14 years 2 months ago
E-FRP with priorities
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...
Roumen Kaiabachev, Walid Taha, Angela Yun Zhu
ICLP
2009
Springer
14 years 9 months ago
Demand-Driven Normalisation for ACD Term Rewriting
ACD Term Rewriting (ACDTR) is term rewriting modulo associativity, commutativity, and a limited form of distributivity called conjunctive context. Previous work presented an implem...
Leslie De Koninck, Gregory J. Duck, Peter J. Stuck...
LICS
2009
IEEE
14 years 3 months ago
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
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...
Oliver Friedmann
CONCUR
2007
Springer
14 years 2 months ago
Strategy Logic
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...
Krishnendu Chatterjee, Thomas A. Henzinger, Nir Pi...