Skip to main content

On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks

  • Conference paper
Computational Logic in Multi-Agent Systems (CLIMA 2013)

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

Included in the following conference series:

Abstract

Abstract Argumentation Frameworks (afs) provide a fruitful basis for exploring issues of defeasible reasoning. Their power largely derives from the abstract nature of the arguments within the framework, where arguments are atomic nodes in an undifferentiated relation of attack. This abstraction conceals different conceptions of argument, and concrete instantiations encounter difficulties as a result of conflating these conceptions. We distinguish three distinct senses of the term. We provide an approach to instantiating AF in which the nodes are restricted to literals and rules, encoding the underlying theory directly. Arguments, in each of the three senses, then emerge from this framework as distinctive structures of nodes and paths. Our framework retains the theoretical and computational benefits of an abstract af, while keeping notions distinct which are conflated in other approaches to instantiation.

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

Access this chapter

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. Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77(2), 321–358 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bondarenko, A., Dung, P.M., Kowalski, R.A., Toni, F.: An abstract, argumentation-theoretic approach to default reasoning. Artificial Intelligence 93, 63–101 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Caminada, M., Amgoud, L.: On the evaluation of argumentation formalisms. Artificial Intelligence 171(5-6), 286–310 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Wyner, A., Bench-Capon, T., Dunne, P.: Instantiating knowledge bases in abstract argumentation frameworks. In: Proceedings of the Uses of Computational Argumentation, AAAI Fall Symposium (2009)

    Google Scholar 

  5. Dunne, P.E., Bench-Capon, T.J.M.: Coherence in finite argument systems. Artificial Intelligence 141(1), 187–203 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. García, A.J., Simari, G.R.: Defeasible logic programming: An argumentative approach. Theory and Practice of Logic Programming 4(1), 95–137 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Besnard, P., Hunter, A.: Elements of Argumentation. MIT Press (2008)

    Google Scholar 

  8. Prakken, H.: An abstract framework for argumentation with structured arguments. Argument and Computation 1(2), 93–124 (2010)

    Article  Google Scholar 

  9. Brewka, G., Woltran, S.: Abstract dialectical frameworks. In: Proceedings of the Twelfth International Conference on the Principles of Knowledge Represetnation and Reasoning (KR 2010), pp. 102–211 (2010)

    Google Scholar 

  10. Caminada, M., Wu, Y.: On the limitations of abstract argumentation. In: Causmaecker, P.D., Maervoet, J., Messelis, T., Verbeeck, K., Vermeulen, T. (eds.) Proceedings of the 23rd Benelux Conference on Artificial Intelligence, Ghent, Belgium, pp. 59–66 (November 2011)

    Google Scholar 

  11. Wyner, A.Z., Bench-Capon, T.J.M., Atkinson, K.: Three senses of “Argument”. In: Casanovas, P., Sartor, G., Casellas, N., Rubino, R. (eds.) Computable Models of the Law. LNCS (LNAI), vol. 4884, pp. 146–161. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Reiter, R.: A logic for default reasoning. Artificial Intelligence 13(1-2), 81–132 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  13. Prakken, H., Sartor, G.: Argument-based extended logic programming with defeasible priorities. Journal of Applied Non-Classical Logics 7(1) (1997)

    Google Scholar 

  14. McCarthy, J.: Circumscription - a form of non-monotonic reasoning. Artificial Intelligence 13, 27–39 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  15. Bench-Capon, T.J.M.: Persuasion in practical argument using value-based argumentation frameworks. Journal of Logic and Computation 13(3), 429–448 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wyner, A., Bench-Capon, T., Dunne, P. (2013). On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks. In: Leite, J., Son, T.C., Torroni, P., van der Torre, L., Woltran, S. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2013. Lecture Notes in Computer Science(), vol 8143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40624-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40624-9_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40623-2

  • Online ISBN: 978-3-642-40624-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics