Abstract
Amongst several fundamental aspects in multi-agent systems design, the definition of the agent interaction space is of the utmost importance. The specification of the agent interaction has several facets: syntax, semantics, and compliance verification.
In an open society, heterogenous agents can participate without showing any credentials. Accessing their internals or their knowledge bases is typically impossible, thus it is impossible to prove a priori that agents will indeed behave according to the society rules.
Within the SOCS (Societies Of ComputeeS) project, a language based on abductive semantics has been proposed as a mean to define interactions in open societies. The proposed language allows the designer to define open, extensible and not over-constrained protocols. Beside the definition language, a software tool has been developed with the purpose of verifying at execution time if the agents behave correctly with respect to the defined protocols.
This paper provides a tutorial overview of the theory and of the tools the SOCS project provided to design, define and test agent interaction protocols.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Priami, C., Quaglia, P. (eds.): GC 2004. LNCS (LNAI), vol. 3267. Springer, Heidelberg (2005)
Alberti, M., Chesani, F.: The computational behaviour of the SCIFF abductive proof procedure and the SOCS-SI system. Intelligenza Artificiale II(3), 45–51 (2005)
Alberti, M., Chesani, F., Ciampolini, A., Mello, P., Montali, M., Storari, S., Torroni, P.: Protocol specification and verification by using computational logic. In: Proceedings of Workshop dagli Oggetti agli Agenti (WOA 2005) (November 2005)
Alberti, M., Chesani, F., Gavanelli, M., Guerri, A., Lamma, E., Mello, P., Torroni, P.: Expressing interaction in combinatorial auction through social integrity constraints. Intelligenza Artificiale II(1), 22–29 (2005)
Alberti, M., Chesani, F., Gavanelli, M., Lamma, E.: The CHR-based implementation of a system for generation and confirmation of hypotheses. In: Wolf, A., Frühwirth, T., Meister, M. (eds.) 19th Workshop on (Constraint) Logic Programming, pp. 111–122. University of Ulm, Germany (2005)
Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Security protocols verification in abductive logic programming: a case study. In: Dikenelli, O., Gleizes, M.-P., Ricci, A. (eds.) ESAW 2005. LNCS (LNAI), vol. 3963. Springer, Heidelberg (2006)
Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Compliance verification of agent interaction: a logic-based tool. In: Trappl [56], pp. 570–575, Extended version to appear in Applied Artificial Intelligence
Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: A logic based approach to interaction design in open multi-agent systems. In: Proceedings of WETICE 2004, June 14–16, pp. 387–392. IEEE Press, Los Alamitos (2004)
Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: The SOCS computational logic approach for the specification and verification of agent societies. In: Priami, Quaglia [2], pp. 324–339
Alberti, M., Ciampolini, A., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: A social ACL semantics by deontic constraints. In: Mařík, V., Müller, J.P., Pěchouček, M. (eds.) CEEMAS 2003. LNCS (LNAI), vol. 2691, pp. 204–213. Springer, Heidelberg (2003)
Alberti, M., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Abduction with hypotheses confirmation. In: Giunchiglia, F. (ed.) IJCAI 2005, pp. 1545–1546 (2005)
Alberti, M., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: The SCIFF abductive proof-procedure. In: Bandini, S., Manzoni, S. (eds.) AI*IA 2005. LNCS (LNAI), vol. 3673, pp. 135–147. Springer, Heidelberg (2005)
Alberti, M., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: An Abductive Interpretation for Open Societies. In: Cappelli, A., Turini, F. (eds.) AI*IA 2003. LNCS (LNAI), vol. 2829, pp. 287–299. Springer, Heidelberg (2003)
Alberti, M., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Specification and verification of agent interactions using social integrity constraints. Electronic Notes in Theoretical Computer Science 85(2) (2003)
Alberti, M., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Modeling interactions using Social Integrity Constraints: A resource sharing case study. In: Leite, J., Omicini, A., Sterling, L., Torroni, P. (eds.) DALT 2003. LNCS (LNAI), vol. 2990, pp. 243–262. Springer, Heidelberg (2004)
Alberti, M., Lamma, E., Gavanelli, M., Mello, P., Sartor, G., Torroni, P.: Mapping deontic operators to abductive expectations. Computational and Mathematical Organization Theory (to appear)
ALFEBIITE: A Logical Framework for Ethical Behaviour between Infohabitants in the Information Trading Economy of the universal information ecosystem. IST- 1999-10298 (1999), Home Page, http://www.iis.ee.ic.ac.uk/~alfebiite/
Alferes, J., Pereira, L.M., Swift, T.: Abduction in well-founded semantics and generalized stable models via tabled dual programs. Theory and Practice of Logic Programming 4, 383–428 (2004)
Artikis, A., Pitt, J., Sergot, M.: Animated specifications of computational societies. In: Castelfranchi, Lewis Johnson [26], pp. 1053–1061
Barbuceanu, M., Fox, M.S.: Cool: A language for describing coordination in multi-agent systems. In: Lesser, V. (ed.) Proceedings of the First Intl. Conference on Multi-Agent Systems, pp. 17–25. AAAI Press/The MIT Press (1995)
Barruffi, R., Milano, M., Montanari, R.: Planning for security management. IEEE Intelligent Systems 16(1), 74–80 (2001)
Basin, D., Mödersheim, S., Viganò, L.: An on-the-fly model-checker for security protocol analysis. In: Snekkenes, E., Gollmann, D. (eds.) ESORICS 2003. LNCS, vol. 2808, pp. 253–270. Springer, Heidelberg (2003)
Bosi, F., Milano, M.: Enhancing CLP branch and bound techniques for scheduling problems. Software Practice & Experience 31(1), 17–42 (2001)
Bracciali, A., Demetriou, N., Endriss, U., Kakas, A., Lu, W., Mancarella, P., Sadri, F., Stathis, K., Toni, F., Terreni, G.: The KGP model of agency: Computational model and prototype implementation. In: Priami, Quaglia [2], pp. 340–367
Castelfranchi, C., Lewis Johnson, W. (eds.): Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2002), Bologna, Italy. ACM Press, New York (2002)
Davidsson, P.: Categories of artificial societies. In: Omicini, A., Petta, P., Tolksdorf, R. (eds.) ESAW 2001. LNCS (LNAI), vol. 2203, pp. 1–9. Springer, Heidelberg (2002)
Denecker, M., De Schreye, D.: SLDNFA: an abductive procedure for abductive logic programs. Journal of Logic Programming 34(2), 111–167 (1998)
Dignum, V., Meyer, J.J., Weigand, H.: Towards an organizational model for agent societies using contracts. In: Castelfranchi, Lewis Johnson [26], pp. 694–695
Dincbas, M., van Hentenryck, P., Simonis, H., Aggoun, A.: The constraint logic programming language CHIP. In: Proceedings of the 2nd International Conference on 5th Generation Computer Systems, Tokyo, Japan, pp. 693–702 (1988)
Endriss, U., Mancarella, P., Sadri, F., Terreni, G., Toni, F.: The CIFF proof procedure for abductive logic programming with constraints. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 31–43. Springer, Heidelberg (2004)
Endriss, U., Maudet, N., Sadri, F., Toni, F.: Protocol conformance for logic-based agents. In: Gottlob, G., Walsh, T. (eds.) IJCAI 2003. Morgan Kaufmann, San Francisco (2003)
FIPA: Foundation for Intelligent Physical Agents, http://www.fipa.org/
Fung, T.H., Kowalski, R.A.: The IFF proof procedure for abductive logic programming. Journal of Logic Programming 33(2), 151–165 (1997)
Guerri, A., Milano, M.: Exploring CP-IP based techniques for the bid evaluation in combinatorial auctions. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 863–867. Springer, Heidelberg (2003)
Java Agent DEvelopment framework, http://sharon.cselt.it/projects/jade/
Jaffar, J., Maher, M.J.: Constraint logic programming: a survey. Journal of Logic Programming 19-20, 503–582 (1994)
Jaffar, J., Maher, M.J., Marriott, K., Stuckey, P.J.: The semantics of constraint logic programs. Journal of Logic Programming 37(1-3), 1–46 (1998)
Jaffar, J., Michaylov, S., Stuckey, P.J., Yap, R.H.C.: The CLP(R) language and system. ACM Transactions on Programming Languages and Systems 14(3), 339–395 (1992)
Kakas, A.C., Kowalski, R.A., Toni, F.: The role of abduction in logic programming. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, pp. 235–324. Oxford University Press, Oxford (1998)
Kakas, A.C., Mancarella, P.: On the relation between Truth Maintenance and Abduction. In: Fukumura, T. (ed.) Proceedings of PRICAI 1990, pp. 438–443. Ohmsha Ltd. (1990)
Kakas, A.C., Michael, A., Mourlas, C.: ACLP: Abductive Constraint Logic Programming. Journal of Logic Programming 44(1-3), 129–177 (2000)
Kakas, A.C., van Nuffelen, B., Denecker, M.: A-System: Problem solving through abduction. In: Nebel, B. (ed.) IJCAI 2001, Seattle, Washington, USA, pp. 591–596. Morgan Kaufmann, San Francisco (2001)
Kowalski, R.A., Sadri, F.: From logic programming towards multi-agent systems. Annals of Mathematics and Artificial Intelligence 25(3/4), 391–419 (1999)
Kowalski, R.A., Toni, F., Wetzel, G.: Executing suspended logic programs. Fundamenta Informaticae 34, 203–224 (1998)
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)
Dal Palù, A., Dovier, A., Pontelli, E.: Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD). In: Barahona, P., Felty, A.P. (eds.) Proc. of Principles and Practice of Declarative Programming, pp. 230–241. ACM Press, New York (2005)
Rao, A., Georgeff, M.: An abstract architecture for rational agents. In: Rich, C., Swartout, W., Nebel, B. (eds.) Proceedings of KR 1992, pp. 439–449 (1992)
Sadri, F., Toni, F., Torroni, P.: An abductive logic programming architecture for negotiating agents. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS, vol. 2424, pp. 419–431. Springer, Heidelberg (2002)
Sandholm, T.: Algorithm for optimal winner determination in combinatorial auction. Artificial Intelligence 135(1-2), 1–54 (2002)
The SCIFF abductive proof procedure, http://lia.deis.unibo.it/Research/sciff/
Shanahan, M.: The event calculus explained. In: Veloso, M.M., Wooldridge, M.J. (eds.) Artificial Intelligence Today. LNCS, vol. 1600, pp. 409–430. Springer, Heidelberg (1999)
SICStus prolog user manual, release 3.11.0 (2003), http://www.sics.se/sicstus/
Sierra, C., Noriega, P.: Agent-mediated interaction. From auctions to negotiation and argumentation. In: d’Inverno, M., Luck, M., Fisher, M., Preist, C. (eds.) UKMAS Workshops 1996-2000. LNCS, vol. 2403, pp. 27–48. Springer, Heidelberg (2002)
Stathis, K., Kakas, A.C., Lu, W., Demetriou, N., Endriss, U., Bracciali, A.: PROSOCS: a platform for programming software agents in computational logic. In: Trappl [56], pp. 523–528. Extended version to appear in Applied Artificial Intelligence
Trappl, R. (ed.): Proceedings of the 17th European Meeting on Cybernetics and Systems Research, Symposium AT2AI-4, Vienna, Austria, April 13-16 (2004)
Venkatraman, M., Singh, M.P.: Verifying compliance with commitment protocols. Autonomous Agents and Multi-Agent Systems 2(3), 217–236 (1999)
Wooldridge, M.: Introduction to Multi-Agent Systems. John Wiley & Sons, Ltd., Chichester (2002)
Wright, G.H.: Deontic logic. Mind 60, 1–15 (1951)
Yolum, P., Singh, M.P.: Flexible protocol specification and execution: applying event calculus planning using commitments. In: Castelfranchi, Lewis Johnson [26], pp. 527–534
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chesani, F., Gavanelli, M., Alberti, M., Lamma, E., Mello, P., Torroni, P. (2006). Specification and Verification of Agent Interaction Using Abductive Reasoning. In: Toni, F., Torroni, P. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2005. Lecture Notes in Computer Science(), vol 3900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750734_14
Download citation
DOI: https://doi.org/10.1007/11750734_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33996-0
Online ISBN: 978-3-540-33997-7
eBook Packages: Computer ScienceComputer Science (R0)