Skip to main content
SpringerLink
Log in

Identifying Necessary and Sufficient Conditions for the Enforcement Problem of Argumentation Frameworks

  • Conference paper
  • First Online:
PRIMA 2022: Principles and Practice of Multi-Agent Systems (PRIMA 2022)

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

Abstract

In the dynamics research of argumentation frameworks (AFs), the enforcement problem deals with changing an AF for the purpose of ensuring that a certain set of desired arguments becomes (part of) an extension. In this paper we focus on expansions of an AF where solely the addition of new arguments and attacks is allowed and the original framework remains unchanged. Existing results about the enforcement problem under strong and normal expansion are all sufficient conditions. We argue that necessary and sufficient conditions are essential concerning the solvability of the enforcement problem. Specifically, two necessary and sufficient conditions are identified for the non-strict enforcement in respectively the odd-length cycle free and the even-length cycle free AFs under strong expansion. This result can be used to determine that when new arguments satisfying the condition are unavailable, enforcing the desired set simply becomes unsolvable.

This work was supported in part by funding from the National Natural Science Foundation of China (61621003).

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

References

  1. Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321–357 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Boella, G., Kaci, S., van der Torre, L.: Dynamics in argumentation with single extensions: abstraction principles and the grounded extension. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS (LNAI), vol. 5590, pp. 107–118. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02906-6_11

    Chapter  MATH  Google Scholar 

  3. Cayrol, C., de Saint-Cyr, F.D., Lagasquie-Schiex, M.: Change in abstract argumentation frameworks: adding an argument. J. Artif. Intell. Res. 38, 49–84 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bisquert, P., Cayrol, C., de Saint-Cyr, F.D., Lagasquie-Schiex, M.-C.: Change in argumentation systems: exploring the interest of removing an argument. In: Benferhat, S., Grant, J. (eds.) SUM 2011. LNCS (LNAI), vol. 6929, pp. 275–288. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-23963-2_22

    Chapter  Google Scholar 

  5. Liao, B., Jin, L., Koons, R.C.: Dynamics of argumentation systems: a division-based method. Artif. Intell. 175(11), 1790–1814 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Baumann, R., Brewka, G.: Expanding argumentation frameworks: enforcing and monotonicity results. COMMA 10, 75–86 (2010)

    Google Scholar 

  7. Coste-Marquis, S., Konieczny, S., Mailly, J.G., Marquis, P.: Extension enforcement in abstract argumentation as an optimization problem. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)

    Google Scholar 

  8. Baumann, R., Doutre, S., Mailly, J.G., Wallner, J.P.: Enforcement in formal argumentation. J. Appl. Logic 2, 1623–1677 (2021)

    MATH  Google Scholar 

  9. Baroni, P., Caminada, M., Giacomin, M.: An introduction to argumentation semantics. Knowl. Eng. Rev. 26(4), 365–410 (2011)

    Article  Google Scholar 

  10. Cerutti, F., Giacomin, M., Vallati, M., Zanella, M.: An SCC recursive meta-algorithm for computing preferred labellings in abstract argumentation. In: Fourteenth International Conference on the Principles of Knowledge Representation and Reasoning (2014)

    Google Scholar 

  11. Baumann, R., Ulbricht, M.: On cycles, attackers and supporters–a contribution to the investigation of dynamics in abstract argumentation. In: Twenty-Ninth International Joint Conference on Artificial Intelligence, vol. 2, pp. 1780–1786 (2021)

    Google Scholar 

  12. Dunne, P.E., Bench-Capon, T.J.: Complexity and combinatorial properties of argument systems. Technical report, Department of Computer Science (ULCS), University of Liverpool (2001)

    Google Scholar 

  13. Baumann, R.: What does it take to enforce an argument? Minimal change in abstract argumentation. In: ECAI, vol. 12, pp. 127–132 (2012)

    Google Scholar 

  14. Niskanen, A., Wallner, J.P., Järvisalo, M.: Optimal status enforcement in abstract argumentation. In: IJCAI, pp. 1216–1222 (2016)

    Google Scholar 

  15. Wallner, J.P., Niskanen, A., Järvisalo, M.: Complexity results and algorithms for extension enforcement in abstract argumentation. J. Artif. Intell. Res. 60, 1–40 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  16. Niskanen, A., Wallner, J.P., Järvisalo, M.: Extension enforcement under grounded semantics in abstract argumentation. In: Sixteenth International Conference on Principles of Knowledge Representation and Reasoning (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Laboratory of MADIS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, China

    Huan Zhang & Songmao Zhang

  2. School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, 100049, China

    Huan Zhang

Authors
  1. Huan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Songmao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Huan Zhang .

Editor information

Editors and Affiliations

  1. Özyeğin University, Istanbul, Turkey

    Reyhan Aydoğan

  2. Universitat Politècnica de València, Valencia, Spain

    Natalia Criado

  3. Université Paris-Dauphine, Paris, France

    Jérôme Lang

  4. Universitat Politècnica de València, Valencia, Spain

    Victor Sanchez-Anguix

  5. King's College London, London, UK

    Marc Serramia

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, H., Zhang, S. (2023). Identifying Necessary and Sufficient Conditions for the Enforcement Problem of Argumentation Frameworks. In: Aydoğan, R., Criado, N., Lang, J., Sanchez-Anguix, V., Serramia, M. (eds) PRIMA 2022: Principles and Practice of Multi-Agent Systems. PRIMA 2022. Lecture Notes in Computer Science(), vol 13753. Springer, Cham. https://doi.org/10.1007/978-3-031-21203-1_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-21203-1_44

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-21202-4

  • Online ISBN: 978-3-031-21203-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation