Extending answer sets for logic programming agents

Reference:

De Vos, M. and Vermeir, D., 2004. Extending answer sets for logic programming agents. Annals of Mathematics and Artificial Intelligence, 42 (1-3), pp. 103-139.

Related documents:

Preview

PDF (Author's accepted version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader Download (256kB) | Preview

Official URL:

http://dx.doi.org/10.1023/B:AMAI.0000034524.89865.d2

Abstract

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.

Export

Actions (login required)