LOGCOM
1998
13 years 4 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
LOGCOM
1998
13 years 4 months ago
1998
The Situation Calculus is a logic of time and change in which there is a distinguished initial situation ¡£¢ and all other situations arise from the different sequences of acti...
LOGCOM
1998
13 years 4 months ago
1998
The need for negotiation in multi-agent systems stems from the requirement for agents to solve the problems posed by their interdependence upon one another. Negotiation provides a...
LOGCOM
1998
13 years 4 months ago
1998
LOGCOM
1998
13 years 4 months ago
1998
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...
LOGCOM
1998
13 years 4 months ago
1998
Sound and complete modal propositional logic C is presented, in which 2P has the interpretation “ P is true in all states”. The interpretation is already known as the Carnapia...
LOGCOM
1998
13 years 4 months ago
1998
Perhaps the most successful agent architectures, and certainly the best known, are those based on the Belief-Desire-Intention (BDI) framework. Despite the wealth of research that ...