Improving Reasoning Efficiency in ASPIC+ with Backwards Chaining and Partial Arguments

Hao Wu*, Bruno Yun, Nir Oren

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


The first step in reasoning using an approach such as ASPIC+ requires all arguments to be generated, and doing so is computationally intensive when encountering large or frequently updated defeasible theories. In this paper, we introduce the informative partial argumentation framework that enables us to control and customise the argument construction process, potentially improving computational efficiency. In our framework, arguments are constructed in a lazy manner; and through the modularisation of our framework, it is possible to restrict the amount of computation to only the necessary information.

Original languageEnglish
Pages (from-to)86-97
Number of pages12
JournalCEUR Workshop Proceedings
Publication statusPublished - 2022
Event4th International Workshop on Systems and Algorithms for Formal Argumentation, SAFA 2022 - Cardiff, Wales, United Kingdom
Duration: 13 Sept 202213 Sept 2022

Bibliographical note

Publisher Copyright:
© 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0)


  • Argumentation
  • ASPIC+
  • Backward-chaining


Dive into the research topics of 'Improving Reasoning Efficiency in ASPIC+ with Backwards Chaining and Partial Arguments'. Together they form a unique fingerprint.

Cite this