Declarative Representations of Multiagent Systems

This paper explores the specification and semantics of multiagent problem-solving systems, focusing on the representations that agents have of each other. It provides a declarative representation for such systems. Several procedural solutions to a well-known test-bed problem are considered, and the requirements they impose on different agents are identified. A study of these requirements yields a representational scheme based on temporal logic for specifying the acting, perceiving, communicating, and reasoning abilities of computational agents. A formal semantics is provided for this scheme. The resulting representation is highly declarative, and useful for describing systems of agents solving problems reactively. >

[1]  P. Hayes.  The frame problem and related problems in artificial intelligence , 1971 .

[2]  A. Lansky.  A REPRESENTATION OF PARALLEL ACTIVITY BASED ON EVENTS, STRUCTURE, AND CAUSALITY , 1987 .

[3]  Y. Shoham.  Reasoning About Change: Time and Causation from the Standpoint of Artificial Intelligence , 1987 .

[4]  Ben C. Moszkowski,et al.  Executing temporal logic programs , 1986, Seminar on Concurrency.

[5]  Randall Davis,et al.  Negotiation as a Metaphor for Distributed Problem Solving , 1988, Artif. Intell..

[6]  Ramanathan V. Guha,et al.  Building Large Knowledge-Based Systems: Representation and Inference in the Cyc Project , 1990 .

[7]  Edmund H. Durfee,et al.  Coherent Cooperation Among Communicating Problem Solvers , 1987, IEEE Transactions on Computers.

[8]  CoordinationExperimentsEdmund H. Durfee,et al.  MICE : A Flexible Testbed for Intelligent , 1989 .

[9]  Michael N. Huhns,et al.  Chapter 9 – DAI for Document Retrieval: The MINDS Project , 1987 .

[10]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[11]  Johan van Benthem,et al.  The Logic of Time , 1983 .

[12]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[13]  M. Benda,et al.  On Optimal Cooperation of Knowledge Sources , 1985 .

[14]  David Chapman,et al.  Pengi: An Implementation of a Theory of Activity , 1987, AAAI.

[15]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[16]  C. Raymond Perrault.  An application of default logic to speech act theory , 1987 .

[17]  Randall W. Hill,et al.  Representing and Using Organizational Knowledge in Distributed AI Systems , 1989, Distributed Artificial Intelligence.

[18]  N. Cocchiarella,et al.  Situations and Attitudes. , 1986 .

[19]  N. Nilsson,et al.  Readings in Artificial Intelligence , 1981 .

[20]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[21]  J. Austin.  How to do things with words , 1962 .

[22]  Martín Abadi,et al.  Temporal-logic theorem proving , 1987 .

[23]  Ramanathan V. Guha,et al.  Building large knowledge-based systems , 1989 .

[24]  斉藤 康己,et al.  Douglas B. Lenat and R. V. Guha : Building Large Knowledge-Based Systems, Representation and Inference in the Cyc Project, Addison-Wesley (1990). , 1990 .