Skip to main content
SpringerLink
Log in

Preprocessing Argumentation Frameworks via Replacement Patterns

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 2019)

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

Included in the following conference series:

Abstract

A fast-growing research direction in the study of formal argumentation is the development of practical systems for central reasoning problems underlying argumentation. In particular, numerous systems for abstract argumentation frameworks (AF solvers) are available today, covering several argumentation semantics and reasoning tasks. Instead of proposing another algorithmic approach for AF solving, we introduce in this paper distinct AF preprocessing techniques as a solver-independent approach to obtaining performance improvements of AF solvers. We establish a formal framework of replacement patterns to perform local simplifications that are faithful with respect to standard semantics for AFs. Moreover, we provide a collection of concrete replacement patterns. Towards potential applicability, we employ the patterns in a preliminary empirical evaluation of their influence on AF solver performance.

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

Notes

  1. 1.

    However, we keep the set structure flat, i.e., when merging arguments \(m_S, m_{S'} \in U_m\) the resulting argument is \(m_{S \cup S'}\).

References

  1. Atkinson, K., et al.: Towards artificial argumentation. AI Mag. 38(3), 25–36 (2017)

    Article  MathSciNet  Google Scholar 

  2. Baroni, P., Boella, G., Cerutti, F., Giacomin, M., van der Torre, L., Villata, S.: On the input/output behavior of argumentation frameworks. Artif. Intell. 217, 144–197 (2014)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  4. Baroni, P., Gabbay, D., Giacomin, M., van der Torre, L. (eds.): Handbook of Formal Argumentation. College Publications (2018)

    Google Scholar 

  5. Baumann, R., Dvořák, W., Linsbichler, T., Woltran, S.: A general notion of equivalence for abstract argumentation. In: Proceedings of IJCAI, pp. 800–806. ijcai.org (2017)

    Google Scholar 

  6. Cerutti, F., Gaggl, S.A., Thimm, M., Wallner, J.P.: Foundations of implementations for formal argumentation. IfCoLog J. Log. Appl. 4(8), 2623–2707 (2017)

    Google Scholar 

  7. Cerutti, F., Giacomin, M., Vallati, M.: Generating structured argumentation frameworks: AFBenchGen2. In: Proceedings of COMMA. Frontiers in Artificial Intelligence and Applications, vol. 287, pp. 467–468. IOS Press (2016)

    Google Scholar 

  8. Cerutti, F., Vallati, M., Giacomin, M.: Where are we now? State of the art and future trends of solvers for hard argumentation problems. In: Proceedings of COMMA. Frontiers in Artificial Intelligence and Applications, vol. 287, pp. 207–218. IOS Press (2016)

    Google Scholar 

  9. 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–358 (1995)

    Article  MathSciNet  Google Scholar 

  10. Dvořák, W., Järvisalo, M., Wallner, J.P., Woltran, S.: Complexity-sensitive decision procedures for abstract argumentation. Artif. Intell. 206, 53–78 (2014)

    Article  MathSciNet  Google Scholar 

  11. Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61–75. Springer, Heidelberg (2005). https://doi.org/10.1007/11499107_5

    Chapter  MATH  Google Scholar 

  12. Egly, U., Gaggl, S.A., Woltran, S.: Answer-set programming encodings for argumentation frameworks. Argum. Comput. 1(2), 147–177 (2010)

    Article  Google Scholar 

  13. Gaggl, S.A., Linsbichler, T., Maratea, M., Woltran, S.: Introducing the second international competition on computational models of argumentation. In: Proceedings of SAFA. CEUR Workshop Proceedings, vol. 1672, pp. 4–9. CEUR-WS.org (2016)

    Google Scholar 

  14. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Advanced preprocessing for answer set solving. In: Proceedings of ECAI. Frontiers in Artificial Intelligence and Applications, vol. 178, pp. 15–19. IOS Press (2008)

    Google Scholar 

  15. Geilen, N., Thimm, M.: Heureka: a general heuristic backtracking solver for abstract argumentation. In: Black, E., Modgil, S., Oren, N. (eds.) TAFA 2017. LNCS (LNAI), vol. 10757, pp. 143–149. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-75553-3_10

    Chapter  Google Scholar 

  16. Giacomin, M., Linsbichler, T., Woltran, S.: On the functional completeness of argumentation semantics. In: Proceedings of KR, pp. 43–52. AAAI Press (2016)

    Google Scholar 

  17. Heule, M., Järvisalo, M., Lonsing, F., Seidl, M., Biere, A.: Clause elimination for SAT and QSAT. J. Artif. Intell. Res. 53, 127–168 (2015)

    Article  MathSciNet  Google Scholar 

  18. Järvisalo, M., Heule, M.J.H., Biere, A.: Inprocessing rules. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 355–370. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31365-3_28

    Chapter  Google Scholar 

  19. Korhonen, T., Berg, J., Saikko, P., Järvisalo, M.: MaxPre: an extended MaxSAT preprocessor. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 449–456. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66263-3_28

    Chapter  Google Scholar 

  20. Lonsing, F., Bacchus, F., Biere, A., Egly, U., Seidl, M.: Enhancing search-based QBF solving by dynamic blocked clause elimination. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR 2015. LNCS, vol. 9450, pp. 418–433. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48899-7_29

    Chapter  Google Scholar 

  21. Nofal, S., Atkinson, K., Dunne, P.E.: Looking-ahead in backtracking algorithms for abstract argumentation. Int. J. Approx. Reason. 78, 265–282 (2016)

    Article  MathSciNet  Google Scholar 

  22. Thimm, M., Villata, S.: The first international competition on computational models of argumentation: results and analysis. Artif. Intell. 252, 267–294 (2017)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work was financially supported by Academy of Finland grants 276412 and 312662 (M.J. and A.N.), the Austrian Science Fund (FWF) grants P30168-N31 and I2854 (W.D. and S.W.), and University of Helsinki Doctoral Programme in Computer Science (A.N.).

Author information

Authors and Affiliations

  1. Institute of Logic and Computation, TU Wien, Vienna, Austria

    Wolfgang Dvořák, Thomas Linsbichler & Stefan Woltran

  2. HIIT, Department of Computer Science, University of Helsinki, Helsinki, Finland

    Matti Järvisalo & Andreas Niskanen

Authors
  1. Wolfgang Dvořák
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matti Järvisalo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas Linsbichler
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Andreas Niskanen
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Stefan Woltran
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wolfgang Dvořák .

Editor information

Editors and Affiliations

  1. University of Calabria, Rende, Italy

    Francesco Calimeri

  2. University of Calabria, Rende, Italy

    Nicola Leone

  3. Mathematics and Computer Science, University of Calabria, Rende, Italy

    Marco Manna

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dvořák, W., Järvisalo, M., Linsbichler, T., Niskanen, A., Woltran, S. (2019). Preprocessing Argumentation Frameworks via Replacement Patterns. In: Calimeri, F., Leone, N., Manna, M. (eds) Logics in Artificial Intelligence. JELIA 2019. Lecture Notes in Computer Science(), vol 11468. Springer, Cham. https://doi.org/10.1007/978-3-030-19570-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-19570-0_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-19569-4

  • Online ISBN: 978-3-030-19570-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation