Skip to main content

Interacting Answer Sets

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6214))

Abstract

We consider agent societies represented by logic programs. Four different types of social interactions among agents, cooperation, competition, norms, and subjection, are formulated as interactions between answer sets of different programs. Answer sets satisfying conditions of interactions represent solutions coordinated in a multiagent society. A unique feature of our framework is that answer set interactions are specified outside of individual programs. This enables us to freely change the social specifications among agents without the need of modifying individual programs and to separate beliefs of agents from social requirements over them. Social interactions among agents are encoded in a single logic program using constraints. Coordinated solutions are then computed using answer set programming.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baral, C.: Knowledge Representation, Reasoning, and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  2. 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)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. Ciampolini, A., Lamma, E., Mello, P., Toni, F., Torroni, P.: Cooperation and competition in ALIAS: a logic framework for agents that negotiate. Annals of Mathematics and Artificial Intelligence 37, 65–91 (2003)

    Google Scholar 

  5. Eiter, T., Gottlob, G.: Complexity results for disjunctive logic programming and application to nonmonotonic logics. In: Miller, D. (ed.) Proceedings of the 1993 International Symposium on Logic Programming, pp. 266–278. MIT Press, Cambridge (1993)

    Google Scholar 

  6. Foo, N., Meyer, T., Zhang, Y., Zhang, D.: Negotiating logic programs. In: Proceedings of the 6th Workshop on Nonmonotonic Reasoning, Action and Change (2005)

    Google Scholar 

  7. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991).

    Google Scholar 

  8. Kowalski, R.A.: Algorithm = Logic + Control. Communications of the ACM 22, 424–436 (1979)

    Google Scholar 

  9. Lifschitz, V., Turner, H.: Splitting a logic program. In: Hentenryck, P.V. (ed.) Proceedings of the 11th International Conference on Logic Programming, pp. 23–37. MIT Press, Cambridge (1994)

    Google Scholar 

  10. Meyer, T., Foo, N., Kwok, R., Zhang, D.: Logical foundation of negotiation: outcome, concession and adaptation. In: Proceedings of the 19th National Conference on Artificial Intelligence, pp. 293–298. MIT Press, Cambridge (2004)

    Google Scholar 

  11. Sakama, C., Inoue, K.: Combining answer sets of nonmonotonic logic programs. In: Toni, F., Torroni, P. (eds.) CLIMA 2005. LNCS (LNAI), vol. 3900, pp. 320–339. Springer, Heidelberg (2006)

    Google Scholar 

  12. Sakama, C., Inoue, K.: Constructing consensus logic programs. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol. 4407, pp. 26–42. Springer, Heidelberg (2007)

    Google Scholar 

  13. Sakama, C., Inoue, K.: Coordination in answer set programming. ACM Transactions on Computational Logic 9, Article No.9 (2008); Shorter version: Coordination between logical agents. In: Leite, J., Torroni, P. (eds.) CLIMA 2004. LNCS (LNAI), vol. 3487, pp. 161–177. Springer, Heidelberg (2005)

    Google Scholar 

  14. Singh, M.P.: An ontology for commitments in multiagent systems: toward a unification of normative concepts. Artificial Intelligence and Law 7, 97–113 (1999)

    Google Scholar 

  15. Weiss, G. (ed.): Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence. MIT Press, Cambridge (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakama, C., Son, T.C. (2010). Interacting Answer Sets. In: Dix, J., Fisher, M., Novák, P. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2009. Lecture Notes in Computer Science(), vol 6214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16867-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16867-3_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16866-6

  • Online ISBN: 978-3-642-16867-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics