5243 search results - page 239 / 1049 » Reasoning About Strategies |
230
click to vote
KR
2010
Springer
15 years 8 months ago
2010
Springer
Existing action calculi provide rich, declarative formalisms for reasoning about actions. BDI-based programming languages like AgentSpeak, on the other hand, are procedural and ge...
186
click to vote
CADE
2004
Springer
16 years 7 months ago
2004
Springer
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
185
click to vote
CADE
1998
Springer
15 years 11 months ago
1998
Springer
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
166
click to vote
AAAI
1990
15 years 7 months ago
1990
In this paper we present a purely semantic view on non-monotonic reasoning. We follow the direction pointed in [16] and claim that any non-monotonic logic can be viewed as a resul...
205
click to vote
LICS
2012
IEEE
13 years 9 months ago
2012
IEEE
Abstract—A bicategory of concurrent games, where nondeterministic strategies are formalized as certain maps of event structures, was introduced recently. This paper studies an ex...