A fully abstract model for the exchange of information in multi-agent systems.

DOI10.1016/S0304-3975(02)00078-6zbMath1038.68019OpenAlexW2113112300MaRDI QIDQ1401189

Rogier M. van Eijk, Frank S. de Boer, Wiebe van der Hoek, John-Jules Ch. Meyer

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00078-6

zbMATH Keywords

Constraint programmingAgent communication languagesExchange of informationFailure semanticsFull abstractness

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items (2)

Semantic models of a timed distributed dataspace architecture ⋮ Process algebra and constraint programming for modeling interactions in MAS

Uses Software

• KQML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A guide to completeness and complexity for modal logics of knowledge and belief
• On dynamically generated ontology translators in agent communication
• A process algebra for synchronous concurrent constraint programming
• Process algebra for synchronous communication
• A Theory of Communicating Sequential Processes
• Readies and Failures in the Algebra of Communicating Processes
• Communicating sequential processes

This page was built for publication: A fully abstract model for the exchange of information in multi-agent systems.