Skip to main content

Argumentation Frameworks with Necessities

  • Conference paper
Scalable Uncertainty Management (SUM 2011)

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

Included in the following conference series:

Abstract

In this paper, we introduce argumentation frameworks with necessities (AFNs), an extension of Dung’s argumentation frameworks (AFs) taking into account a necessity relation as a kind of support relation between arguments (an argument is necessary for another). We redefine the acceptability semantics for these extended frameworks and we show how the necessity relation allows a direct and easy correspondence between a fragment of logic programs (LPs) and AFNs. We introduce then a further generalization of AFNs that extends the necessity relation to deal with sets of arguments. We give a natural adaptation of the acceptability semantics to this new context and show that the generalized frameworks allow to encode arbitrary logic programs.

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. Amgoud, L., Besnard, P.: Bridging the gap between abstract argumentation systems and logic. In: Godo, L., Pugliese, A. (eds.) SUM 2009. LNCS, vol. 5785, pp. 12–27. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

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

    Book  Google Scholar 

  3. Boella, G., Gabbay, D.M., Van Der Torre, L., Villata, S.: Support in Abstract Argumentation. In: COMMA 2010, pp. 40–51. IOS Press, Amsterdam (2010)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Bourguet, J., Amgoud, L., Thomapoulos, R.: Towards a unified model of preference-based argumentation. In: Link, S., Prade, H. (eds.) FoIKS 2010. LNCS, vol. 5956, pp. 326–344. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Brewka, G., Woltran, S.: Abstract Dialectical Frameworks. In: International Conference on the Principles of Knowledge Representation and Reasoning (KR 2010), pp. 102–111 (2010)

    Google Scholar 

  7. Cayrol, C., Lagasquie-Schiex, M.C.: On the acceptability of arguments in bipolar argumentation frameworks. In: Godo, L. (ed.) ECSQARU 2005. LNCS (LNAI), vol. 3571, pp. 378–389. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Cayrol, C., Lagasquie-Schiex, M.-C.: Coalitions of arguments: A tool for handling bipolar argumentation frameworks. Int. J. Intell. Syst. 25(1), 83–109 (2010)

    Article  MATH  Google Scholar 

  9. Coste-Marquis, S., Devred, C., Marquis, P.: Constrained Argumentation Frameworks. In: International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), pp. 112–122. AAAI Press, Lake District (2006)

    Google Scholar 

  10. 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–357 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. Egly, U., Gaggl, S.A., Woltran, S.: Answer-set programming encodings for argumentation frameworks. Argument and Computation 1(2), 147–177 (2010)

    Article  MATH  Google Scholar 

  12. Gebser, M., Gharib, M., Mercer, R., Schaub, T.: Monotonic Answer Set Programming. Journal of Logic and Computation 19(4), 539–564 (2009)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  14. Łukaszewicz, W.: Considerations on Default Logic: An Alternative Approach. Computational Intelligence 4, 1–16 (1988)

    Article  Google Scholar 

  15. Modgil, S., Caminada, M.: Proof theories and algorithms for abstract argumentation frameworks. In: Rahwan, I., Simari, G. (eds.) Argumentation in Artificial Intelligence, pp. 105–129. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. Nieves, J.C., Cortes, U., Osorio, M.: Preferred extensions as stable models. TPLP 8(4), 527–543 (2008)

    MathSciNet  MATH  Google Scholar 

  17. Kayser, D., Nouioua, F.: From the description of an accident to its causes. Artificial Intelligence 173(12-13), 1154–1193 (2010)

    Article  Google Scholar 

  18. Oren, N., Norman, T.J.: Semantics for Evidence-Based Argumentation, in Computational Models of Argument. In: COMMA 2008, Frontiers in Artificial Intelligence and Applications, pp. 276–284 (2008)

    Google Scholar 

  19. Reiter, R.: A Logic for Default reasoning. Artificial Intelligence 13(1-2), 81–132 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  20. Wu, Y., Caminada, M., Gabbay, D.: Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming. Studia logica 93(2-3), 383–403 (2009)

    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

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nouioua, F., Risch, V. (2011). Argumentation Frameworks with Necessities. In: Benferhat, S., Grant, J. (eds) Scalable Uncertainty Management. SUM 2011. Lecture Notes in Computer Science(), vol 6929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23963-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23963-2_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23962-5

  • Online ISBN: 978-3-642-23963-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics