5243 search results - page 338 / 1049 » Reasoning About Strategies |
156
click to vote
CEC
2005
IEEE
16 years 13 days ago
2005
IEEE
Abstract- Seeding the population of an evolutionary algorithm with solutions from previous runs has proved to be useful when learning control strategies for agents operating in a c...
164
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
We study the comparison of dynamic semantics (games, dealing with interactions) with static semantics (dealing with results of interactions), in the spirit of Timeless Games [2]. ...
197
click to vote
LOPSTR
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
197
click to vote
CADE
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
148
click to vote
KGC
1993
Springer
15 years 11 months ago
1993
Springer
We provide a logical speci cation of set predicates ndall and bagof of Prolog. The speci cation is given in proof theoretic terms, and pertains to any SLD resolution based language...