基于并发约束规划演算的多Agent分布式信息代数结构
Algebraic Structures from Concurrent Constraint Programming Calculi for Distributed Information in Multi-Agent Systems
摘要:
空间约束系统是并发系统中用于空间和认知信息推理的语义结构。我们发展了scs理论来推理潜在无限群的分布信息。我们的特点的概念,一组代理商的分布式信息的下确界的一组联合保持功能,代表在该组中的代理商的空间。我们提供了另一种表征这一概念的最大家庭的联合保持功能,满足某些基本性质。对于完全分配格,我们建立了一个组的分布信息是最大的信息低于所有可能的组合的信息在空间中的代理在组中,得出一个给定的信息。我们证明了这些特征和条件下,信息可以通过一个无限群也可以通过一个有限群得到的组合性结果。最后,我们提供了一个应用数学形态学的膨胀,其基本操作之一,定义一个SCS上的幂集格。我们表明,分布式信息表示在这样的scs一个特定的膨胀。
英文摘要:
Spatial constraint systems (scs) are semantic structures for reasoning about spatial and epistemic information in concurrent systems. We develop the theory of scs to reason about the distributed information of potentially infinite groups. We characterize the notion of distributed information of a group of agents as the infimum of the set of join-preserving functions that represent the spaces of the agents in the group. We provide an alternative characterization of this notion as the greatest family of join-preserving functions that satisfy certain basic properties. For completely distributive lattices, we establish that distributed information of a group is the greatest information below all possible combinations of information in the spaces of the agents in the group that derive a given piece of information. We show compositionality results for these characterizations and conditions under which information that can be obtained by an infinite group can also be obtained by a finite group. Finally, we provide an application on mathematical morphology where dilations, one of its fundamental operations, define an scs on a powerset lattice. We show that distributed information represents a particular dilation in such scs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。