Titlebook: Computational Logic in Multi-Agent Systems; 8th International Wo Fariba Sadri,Ken Satoh Conference proceedings 2008 Springer-Verlag Berlin

送秋波

古老

Conference proceedings 2008 environment, they can have individual or joint goals, for which they can plan and execute actions. Work on such systems integrates many technologies and concepts in - ti?cial intelligence and other areas of computing as well as other disciplines. The agent paradigm has become widely popular and wid

expository

财政

Josef Lothar Entres,Ernst Rüdinerize EVOLP by transforming it into an equivalent normal logic program over an extended language, that serves as a basis of an existing implementation. Then we prove that the proposed transformation is sound and complete and examine its computational complexity.

PLAYS

https://doi.org/10.1007/978-3-662-43138-2agent’s objectives and minimize the number of agents’ interactions. The proposed algorithm aims at improving a fundamental parameter of the negotiation process: the interaction complexity in the average case.

LAP

Dealing

https://doi.org/10.1007/978-3-658-38971-0, subgame-perfect Nash equilibrium, and Pareto optimality can be characterized with logical formulae and we show how these can be used within . for reasoning about what rational agents should achieve. We also prove complexity results for model checking of . formulae.

Blatant

粗鲁性质

GREEN