lored to program update or belief revision tasks, such as, for instance, Dynamic Logic Programming (DLP) (Alferes et al. 2000). The resulting system should work in a cyclic fashion: (i) social models of the SOLP collection are computed, (ii) by exploiting DLP, the SOLP programs within the collection are possibly updated according to the intended evolution of agent beliefs and intentions, **(iii) the cycle**
restarts. Starting from the basic approach proposed in Section 7 **(Example 16), another interesting issue to investigate is the capability of the language, in the general**
case, of representing cooperative approaches to solving combinatorial optimization problems, possibly by introducing some suitable extensions.

Finally, we plan to enhance the language of SOLP by adding both classical negation and rule-head disjunction. We expect the former to be easy to **implement,**
while the integration of latter requires some preliminary study, as the introduction of disjunction in logic programming always results in a growth of the language expressivity towards higher levels in the computational complexity hierarchy.

## References

Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., and Torroni, P.

2004. The SOCS Computational Logic Approach to the Specification and Verification of Agent Societies. In *Global Computing*. LNCS. Springer, 314–339.

Alferes, J. J., Leite, J. A., Pereira, L. M., Przymusinska, H., and Przymusinski, T. C. 2000. Dynamic Updates of Non-monotonic Knowledge Bases. *J. Log. Program. 45,* 1-3, 43–70.

Alferes, J. J., Leite, J. A., Pereira, L. M., Przymusinska, H., and Przymusinski, T. C. 2002. A Language for Multi-dimensional Updates. Electr. Notes Theor. Comput.

Sci. 70, 5.

Baral, C. 2003. *Knowledge Representation, Reasoning and Declarative Problem Solving*.

Cambridge University Press.

Bracciali, A., Mancarella, P., Stathis, K., and Toni, F. 2004. On modelling multiagent systems declaratively. In *DALT*, J. Leite, A. Omicini, P. Torroni, and P. Yolum, Eds. Lecture Notes in Computer Science, vol. 3476. Springer, 53–68.

Br´ezillon, P. 1999. Context in problem solving: A survey. The Knowledge Engineering Review 14, 1, 1–34.

Buccafurri, F. and Caminiti, G. 2005. A Social Semantics for Multi-Agent Systems.

In *Proc. of 8th International Conference, LPNMR 2005, Diamante, Italy*, C. Baral, G. Greco, N. Leone, and G. Terracina, Eds. LNAI, vol. 3662. Springer-Verlag, Berlin Heidelberg, 317–329.

Buccafurri, F. and Gottlob, G. 2002. Multiagent Compromises, Joint Fixpoints, and Stable Models. LNCS and LNAI, vol. 2407. Springer.

Buvac, S. and Mason, I. ˇ 1993. Propositional logic of context. In *Proc. of the Eleventh* National Conference on Artificial Intelligence, R. Fikes and W. Lehnert, Eds. American Association for Artificial Intelligence, AAAI Press, Menlo Park, California, 412–419.

Cohen, P. R. and Levesque, H. 1990. Rational interaction as the basis for communication. In *Intentions in Communication*. MIT Press.

Cost, R. S., Finin, T., and Labrou, Y. 2001. Coordinating Agents Using ACL Conversations. In *Coordination of Internet Agents: Models, Technologies, and Applications*.

183–196.