Skip to main content
SpringerLink
Log in

dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation

  • Conference paper
  • First Online:
Applications of Declarative Programming and Knowledge Management (INAP 2011, WLP 2011)

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

Abstract

The aim of this paper is to announce the release of a novel system for abstract argumentation which is based on decomposition and dynamic programming. We provide first experimental evaluations to show the feasibility of this approach.

This work has been funded by the Vienna Science and Technology Fund (WWTF) through project ICT08-028, by the Austrian Science Fund (FWF): P20704-N18, and by the Vienna University of Technology program “Innovative Ideas”.

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 EPUB and 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

Notes

  1. 1.

    http://www.dbai.tuwien.ac.at/research/project/sharp

References

  1. Baroni, P., Dunne, P.E., Giacomin, M.: On extension counting problems in argumentation frameworks. In: Proceedings of the COMMA 2010, pp. 63–74 (2010)

    Google Scholar 

  2. Baroni, P., Giacomin, M.: Semantics of abstract argument systems. In: Rahwan, I., Simari, G.R. (eds.) Argumentation in Artificial Intelligence, pp. 25–44. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Charwat, G.: Tree-decomposition based algorithms for abstract argumentation frameworks. Master’s thesis, TU Wien (2012)

    Google Scholar 

  4. Dermaku, A., Ganzow, T., Gottlob, G., McMahan, B., Musliu, N., Samer, M.: Heuristic methods for hypertree decomposition. In: Gelbukh, A., Morales, E.F. (eds.) MICAI 2008. LNCS (LNAI), vol. 5317, pp. 1–11. Springer, Heidelberg (2008)

    Google Scholar 

  5. 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  MATH  Google Scholar 

  6. Dunne, P.E., Bench-Capon, T.J.M.: Coherence in finite argument systems. Artif. Intell. 141(1/2), 187–203 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dvořák, W., Pichler, R., Woltran, S.: Towards fixed-parameter tractable algorithms for abstract argumentation. Artif. Intell. 186, 1–37 (2012)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  9. Morak, M.: SHARP - a smart hypertree-decomposition-based algorithm framework for parameterized problems. TU Wien. http://www.dbai.tuwien.ac.at/research/project/sharp/sharp.pdf (2010)

  10. Samer, M., Szeider, S.: Algorithms for propositional model counting. J. Discrete Algorithms 8(1), 50–64 (2010)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, University of Vienna, Vienna, Austria

    Wolfgang Dvořák

  2. Institute of Information Systems, Vienna University of Technology, Vienna, Austria

    Michael Morak, Clemens Nopp & Stefan Woltran

Authors
  1. Wolfgang Dvořák
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Morak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Clemens Nopp
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. 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. Universität Wien Institut für Informationssysteme, Wien, Austria

    Hans Tompits

  2. Universidade de Évora, Evora, Portugal

    Salvador Abreu

  3. Vienna University of Technology, Vienna, Austria

    Johannes Oetsch

  4. Vienna University of Technology, Vienna, Austria

    Jörg Pührer

  5. Universität Würzburg Inst. Informatik, Würzburg, Germany

    Dietmar Seipel

  6. Kyushu Institute of Technology, Iizuka, Japan

    Masanobu Umeda

  7. Fraunhofer FIRST, Berlin, Germany

    Armin Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dvořák, W., Morak, M., Nopp, C., Woltran, S. (2013). dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation. In: Tompits, H., et al. Applications of Declarative Programming and Knowledge Management. INAP WLP 2011 2011. Lecture Notes in Computer Science(), vol 7773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41524-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41524-1_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41523-4

  • Online ISBN: 978-3-642-41524-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation