Skip to main content
SpringerLink
Log in

Self-Stabilizing Distributed Algorithms for Defeat Status Computation in Argumentation

  • Conference paper
  • First Online:
Multi-Agent Systems and Applications II (ACAI 2001)

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

Included in the following conference series:

  • 667 Accesses

Abstract

Argumentation is receiving an increasing attention as a technique for practical and uncertain reasoning underlying the realization of intelligent autonomous agents. In line with the evolution of agent architectures towards distribution, we propose a distributed approach to argumentation, where independent processes construct arguments and revise their defeat status by exploiting local information only. We present and compare two distributed self-stabilizing algorithms for defeat status computation, one specifically tailored to rebutting defeat, and the other able to handle any form of defeat. The property of self-stabilization is enforced to ensure a globally correct behavior of the system.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. E. Agre and D. Chapman. Pengi: An implementation of a theory of activity. In Proceedings of AAAI-87, pages 268–272, Seattle, WA, 1987.

    Google Scholar 

  2. P. Baroni and D. Fogli. Modeling robot cognitive activity through active mental entities. Robotics and Autonomous Systems, 30(4):325–349, 2000.

    Article  Google Scholar 

  3. P. Baroni and M. Giacomin. A distributed self-stabilizing algorithm for argumentation. In Proceedings of the 2001 International Parallel and Distributed Processing Symposium (IPDPS2001), San Francisco, CA, 2001. IEEE Press.

    Google Scholar 

  4. P. Baroni, M. Giacomin, and G. Guida. Extending abstract argumentation systems theory. Artificial Intelligence, 120(2):251–270, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. P. Bonasso, D. Kortenkamp, D. P. Miller, and M. Slack. Experiences with an architecture for intelligent, reactive agents. In M. Wooldridge, J. P. Müller, and M. Tambe, editors, Intelligent Agents II (LNAI 1037), pages 187–202. Springer-Verlag: Heidelberg, Germany, 1996.

    Google Scholar 

  6. A. H. Bond and L. Grasser. Readings in Distributed Artificial Intelligence. Morgan Kaufmann, San Mateo, 1988.

    Google Scholar 

  7. R. A. Brooks. A robust layered control system for a mobile robot. IEEE Journal of Robotics and Automation, 2(1):14–23, 1986.

    Google Scholar 

  8. S. Dolev. Self-Stabilization. MIT Press, Cambridge, MA, 2000.

    MATH  Google Scholar 

  9. P. M. Dung. On the acceptability of arguments and its fundamental role in non-monotonic reasoning, logic programming, and n-person games. Artificial Intelligence, 77(2):321–357, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  10. E. Gat. Integrating planning and reacting in a heterogeneous asynchronous architecture for controlling real-world mobile robots. In Proceedings of AAAI-92, pages 809–815, San Jose, CA, 1992.

    Google Scholar 

  11. S. Ghosh and M. H. Karaata. A self-stabilizing algorithm for coloring planar graphs. Distributed Computing, 7(1):55–59, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  12. M. H. Karaata and F. Al-Anzi. A dynamic self-stabilizing algorithm for finding strongly connected components. In Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing (PODC99), page 276, Atlanta, GA, 1999.

    Google Scholar 

  13. M. Minsky. The Society of Mind. Simon and Schuster, New York, 1986.

    Google Scholar 

  14. Open Systems Laboratory. The actor foundry: a java-based actor programming environment. Available for download at http://osl.cs.uiuc.edu/foundry/index.html.

  15. S. Parsons, C. Sierra, and N. Jennings. Agents that reason and negotiate by arguing. Journal of Logic and Computation, 8(3):261–292, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  16. J. L. Pollock. How to reason defeasibly. Artificial Intelligence, 57(1):1–42, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  17. J. L. Pollock. Cognitive Carpentry: A Blueprint for How to Build a Person. The MIT Press, Cambridge, Massachusetts, 1995.

    Google Scholar 

  18. H. Prakken and G. A. W. Vreeswijk. Logics for defeasible argumentation. In D. Gabbay, editor, Handbook of Philosophical Logic. Kluwer Academic Publishers, Dordrecht, second edition. To appear.

    Google Scholar 

  19. G. A. W. Vreeswijk. Abstract argumentation systems. Artificial Intelligence, 90(1–2):225–279, 1997.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Elettronica per l’Automazione, Università di Brescia, Via Branze 38, I-25123, Brescia, Italy

    Massimiliano Giacomin

Authors
  1. Massimiliano Giacomin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Electrical Engineering, Department of Cybernetics, Czech Technical University, 166 27, Prague 6, Czech Republic

    Vladimír Mařík , Olga Štěpánková  & Hana Krautwurmová ,  & 

  2. Rockwell Automation Research Center Prague, Americka 22, 120 00, Prague 2, Czech Republic

    Vladimír Mařík

  3. Department of Electronics and Computer Science, University of Southampton, Highfield, Southampton, SO17 1BJ, UK

    Michael Luck

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giacomin, M. (2002). Self-Stabilizing Distributed Algorithms for Defeat Status Computation in Argumentation. In: Mařík, V., Štěpánková, O., Krautwurmová, H., Luck, M. (eds) Multi-Agent Systems and Applications II. ACAI 2001. Lecture Notes in Computer Science(), vol 2322. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45982-0_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-45982-0_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43377-4

  • Online ISBN: 978-3-540-45982-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation