5198 search results - page 683 / 1040 » A Logic of Agent Programs |
211
click to vote
MFCS
1991
Springer
15 years 10 months ago
1991
Springer
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
169
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
A rational agent adopts (or changes) its goals when new information (beliefs) becomes available or its desires (e.g., tasks it is supposed to carry out) change. In conventional ap...
319
click to vote
POPL
2003
ACM
16 years 7 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
174
click to vote
KESAMSTA
2007
Springer
16 years 29 days ago
2007
Springer
Queueing Theory deals with problems where some restricted resource should be shared between competitive flow of requests. In this paper we use Queueing Theory methods to perform a...
197
click to vote
TGC
2007
Springer
16 years 29 days ago
2007
Springer
In computing systems, trust is an expectation on the dynamic behavior of an agent; static analysis is a collection of techniques for establishing static bounds on the dynamic behav...