Abstract
It is recognised that institutions are potentially powerful means for making agent interactions effective and efficient, but institutions will only really be useful when, as in other safety-critical scenarios, it is possible to prove that particular properties do or do not hold for all possible encounters. In contrast to symbolic model-checking, answer set programming permits the statement of problems and queries in domain-specific terms as executable logic programs, thus eliminating the gap between specification and verification language. Furthermore, results are presented in the same terms. In this paper we describe the use of answer set programs as an institutional modelling technique. We demonstrate that our institutional model can be intuitively be mapped into an answer set program such that the ordered event traces of the former can be obtained as the answer sets of the latter, allowing for an easy way to query properties of models.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Artikis, A.: Executable Specification of Open Norm-Governed Computational Systems. PhD thesis, Department of Electrical & Electronic Engineering, Imperial College London (Sept. 2003)
Artikis, A., Sergot, M., Pitt, J.: An executable specification of an argumentation protocol. In: Proceedings of conference on artificial intelligence and law (icail), pp. 1–11. ACM Press, New York (2003)
Artikis, A., Sergot, M., Pitt, J.: Specifying electronic societies with the Causal Calculator. In: Giunchiglia, F., Odell, J.J., Weiss, G. (eds.) AOSE 2002. LNCS, vol. 2585, Springer, Heidelberg (2003)
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge Press, Cambridge (2003)
Baral, C., Gelfond, M.: Reasoning agents in dynamic domains. In: Logic-based artificial intelligence, pp. 257–279. Kluwer Academic Publishers, Dordrecht (2000)
Brain, M., Crick, T., De Vos, M., Fitch, J.: Toast: Applying answer set programming to superoptimisation. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, Springer, Heidelberg (2006)
Buccafurri, F., Caminiti, G.: A social semantics for multi-agent systems. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 317–329. Springer, Heidelberg (2005)
Buccafurri, F., Gottlob, G.: Multiagent compromises, joint fixpoints, and stable models. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2407, pp. 561–585. Springer, Heidelberg (2002)
Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8(2), 244–263 (1981)
Cliffe, O., De Vos, M., Padget, J.: Specifying and analysing agent-based social institutions using answer set programming. In: Boissier, O., Padget, J., Dignum, V., Lindemann, G., Matson, E., Ossowski, S., Sichman, J.S., Vázquez-Salceda, J. (eds.) Coordination, Organizations, Institutions, and Norms in Multi-Agent Systems. LNCS (LNAI), vol. 3913, pp. 99–113. Springer, Heidelberg (2006)
Cliffe, O., Padget, J.: Towards a framework for checking agent interraction within institutions. In: Model Checking and Artificial Intelligence Workshop (MoChArt 02), Lyon, France (2002)
Colombetti, M., Fornara, N., Verdicchio, M.: The role of institutions in multiagent systems. In: Proceedings of the Workshop on Knowledge based and reasoning agents, VIII Convegno AI*IA 2002, Siena, Italy (2002)
Colombetti, M., Verdicchio, M.: An analysis of agent speech acts as institutional actions. In: The First International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS ’02), pp. 1157–1164. ACM Press, New York (2002)
De Vos, M., Vermeir, D.: Choice Logic Programs and Nash Equilibria in Strategic Games. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 266–276. Springer, Heidelberg (1999)
De Vos, M., Vermeir, D.: Extending Answer Sets for Logic Programming Agents (Special Issue on Computational Logic in Multi-Agent Systems). Annals of Mathematics and Artifical Intelligence 42(1–3), 103–139 (2004)
Dignum, V.: A Model for Organizational Interaction Based on Agents, Founded in Logic. PhD thesis, Utrecht University (2004)
Dignum, V., Meyer, J.-J., Dignum, F., Weigand, H.: Formal Specification of Interaction in Agent Societies. In: Hinchey, M.G., Rash, J.L., Truszkowski, W.F., Rouff, C.A., Gordon-Spears, D.F. (eds.) FAABS 2002. LNCS (LNAI), vol. 2699, pp. 37–52. Springer, Heidelberg (2003)
North, D.C.: Institutions, Institutional Change and Economic Performance. Cambridge University Press, Cambridge (1991)
Eiter, T., Faber, W., Leone, N., Pfeifer, G.: The diagnosis frontend of the dlv system. AI Communications 12(1-2), 99–111 (1999)
Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: The DLVk planning system. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 541–544. Springer, Heidelberg (2002)
Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: The KR system dlv: Progress report, comparisons and benchmarks. In: Cohn, A.G., Schubert, L., Shapiro, S.C. (eds.) KR’98: Principles of Knowledge Representation and Reasoning, pp. 406–417. Morgan Kaufmann, San Francisco (1998)
Esteva, M., Padget, J., Sierra, C.: Formalizing a language for institutions and norms. In: Meyer, J.-J.C., Tambe, M. (eds.) ATAL 2001. LNCS (LNAI), vol. 2333, Springer, Heidelberg (2002)
Fornara, N., Colombetti, M.: Operational specification of a commitment-based agent communication language. In: AAMAS ’02: Proceedings of the first international joint conference on Autonomous agents and multiagent systems, pp. 536–542. ACM Press, New York (2002)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K.A. (eds.) Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August, pp. 1070–1080. MIT Press, Cambridge (1988)
Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic causal theories. Artificial Intelligence 153, 49–104 (2004)
Giunchiglia, E., Lierler, Y., Maratea, M.: SAT-Based Answer Set Programming. In: Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-04), pp. 61–66 (2004)
Gressmann, J., Janhunen, T., Mercer, R., Schaub, T., Thiele, S., Tichy, R.: Platypus: A Platform for Distributed Answer Set Solving. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 227–239. Springer, Heidelberg (2005)
Searle, J.R.: The Construction of Social Reality. The Penguin Press, London (1995)
Padget, J.: Modelling simple market structures in process algebras with locations. Artificial Intelligence and Simulation of Behaviour Journal 1(1), 87–108 (2001)
Kamara, L., Artikis, A., Neville, B., Pitt, J.: Simulating computational societies. In: Petta, P., Tolksdorf, R., Zambonelli, F. (eds.) ESAW 2002. LNCS (LNAI), vol. 2577, pp. 53–67. Springer, Heidelberg (2003)
Kowalski, R., Sergot, M.: A logic-based calculus of events. New Gen. Comput. 4(1), 67–95 (1986)
Kowalski, R.A., Sadri, F.: Reconciling the event calculus with the situation calculus. Journal of Logic Programming 31(1–3), 39–58 (1997)
Lifschitz, V.: Answer set programming and plan generation. Journal of Artificial Intelligence 138(1-2), 39–54 (2002)
Niemelä, I., Simons, P.: Smodels: An implementation of the stable model and well-founded semantics for normal LP. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 420–429. Springer, Heidelberg (1997)
Noriega, P.: Agent mediated auctions: The Fishmarket Metaphor. PhD thesis, Universitat Autonoma de Barcelona (1997)
Rodríguez, J.-A., Noriega, P., Sierra, C., Padget, J.: FM96.5 A Java-based Electronic Auction House. In: Proceedings of 2nd Conference on Practical Applications of Intelligent Agents and MultiAgent Technology (PAAM’97), London, UK, April, pp. 207–224 (1997)
Rodriguez-Aguilar, J.A.: On the Design and Construction of Agent-mediated Institutions. PhD thesis, Universitat Autonoma de Barcelona (2001)
Salceda, J.V.: The role of Norms and Electronic Institutions in Multi-Agent Systems applied to complex domains. PhD thesis, Technical University of Catalonia (2003)
Singh, M.P.: A social semantics for agent communication languages. In: Dignum, F.P.M., Greaves, M. (eds.) Issues in Agent Communication. LNCS, vol. 1916, pp. 31–45. Springer, Heidelberg (2000)
Soininen, T., Niemelä, I.: Developing a declarative rule language for applications in product configuration. In: Gupta, G. (ed.) PADL 1999. LNCS, vol. 1551, Springer, Heidelberg (1999)
Verdicchio, M., Colombetti, M.: A logical model of social commitment for agent communication. In: AAMAS ’03: Proceedings of the second international joint conference on Autonomous agents and multiagent systems, pp. 528–535. ACM Press, New York (2003)
Yolum, P., Singh, M.P.: Flexible protocol specification and execution: applying event calculus planning using commitments. In: AAMAS ’02: Proceedings of the first international joint conference on Autonomous agents and multiagent systems, pp. 527–534. ACM Press, New York (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Cliffe, O., De Vos, M., Padget, J. (2007). Answer Set Programming for Representing and Reasoning About Virtual Institutions. In: Inoue, K., Satoh, K., Toni, F. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2006. Lecture Notes in Computer Science(), vol 4371. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69619-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-69619-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69618-6
Online ISBN: 978-3-540-69619-3
eBook Packages: Computer ScienceComputer Science (R0)