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

Hao Wu; Bruno Yun; Nir Oren

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

Hao Wu^* (Corresponding Author), Bruno Yun, Nir Oren

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

Abstract

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 language	English
Pages (from-to)	86-97
Number of pages	12
Journal	CEUR Workshop Proceedings
Volume	3236
Early online date	13 Sept 2022
Publication status	Published - 13 Sept 2022
Event	4th International Workshop on Systems and Algorithms for Formal Argumentation, SAFA 2022 - Cardiff, Wales, United Kingdom Duration: 13 Sept 2022 → 13 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)

Keywords

Argumentation
ASPIC+
Backward-chaining

Access to Document

Wu_etal_CEURWP_Improving_Reasoning_Efficiency_VoR
© 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0). https://creativecommons.org/licenses/by/4.0/
Final published version, 880 KBLicence: CC BY

https://ceur-ws.org/Vol-3236/paper7.pdfLicence: CC BY

Cite this

@article{0b0dbe8ce94640fd9c7e6ea0f0449362,

title = "Improving Reasoning Efficiency in ASPIC+ with Backwards Chaining and Partial Arguments",

abstract = "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.",

keywords = "Argumentation, ASPIC+, Backward-chaining",

author = "Hao Wu and Bruno Yun and Nir Oren",

note = "Publisher Copyright: {\textcopyright} 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0); 4th International Workshop on Systems and Algorithms for Formal Argumentation, SAFA 2022 ; Conference date: 13-09-2022 Through 13-09-2022",

year = "2022",

month = sep,

day = "13",

language = "English",

volume = "3236",

pages = "86--97",

journal = "CEUR Workshop Proceedings",

issn = "1613-0073",

publisher = "CEUR-WS",

}

TY - JOUR

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

AU - Wu, Hao

AU - Yun, Bruno

AU - Oren, Nir

PY - 2022/9/13

Y1 - 2022/9/13

N2 - 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.

AB - 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.

KW - Argumentation

KW - ASPIC+

KW - Backward-chaining

UR - http://www.scopus.com/inward/record.url?scp=85139824084&partnerID=8YFLogxK

UR - https://ceur-ws.org/Vol-3236/

M3 - Conference article

AN - SCOPUS:85139824084

SN - 1613-0073

VL - 3236

SP - 86

EP - 97

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

T2 - 4th International Workshop on Systems and Algorithms for Formal Argumentation, SAFA 2022

Y2 - 13 September 2022 through 13 September 2022

ER -

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

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this