Extending Answer Sets for Logic Programming Agents
Extending Answer Sets for Logic Programming Agents
复制标题
扩展逻辑编程代理的答案集
DOI：
10.1023/b:amai.0000034524.89865.d2
复制
发表时间：
2004
影响因子：
1.2
通讯作者：
D. Vermeir
中科院分区：
文献类型：
--
作者：
Marina De Vos;D. Vermeir
我们提出了系统的逻辑编程代理（LPAS）模型的决策者之间的相互作用，而不断发展的结论。这样的系统由通过单向通信信道连接的多个代理组成。代理通过传递通过用它们自己的私有信息更新从连接的代理接收的信息而获得的回答集来彼此通信。我们引入了一个可信的答案集语义逻辑编程代理。作为一个应用程序，我们展示了如何广泛的游戏，完美的信息可以方便地表示为逻辑编程代理系统，每个代理体现了一个游戏玩家的推理，使游戏的均衡与语义一致的代理在LPAS。
We present systems of logic programming agents (LPAS) to model the interactions between decision-makers while evolving to a conclusion. Such a system consists of a number of agents connected by means of unidirectional communication channels. Agents communicate with each other by passing answer sets obtained by updating the information received from connected agents with their own private information. We introduce a credulous answer set semantics for logic programming agents. As an application, we show how extensive games with perfect information can be conveniently represented as logic programming agent systems, where each agent embodies the reasoning of a game player, such that the equilibria of the game correspond with the semantics agreed upon by the agents in the LPAS.