Computing Argumentation in Polynomial Number of BDD Operations: A Preliminary Report [chapter]

Yuqing Tang, Timothy J. Norman, Simon Parsons
2011 Lecture Notes in Computer Science  
Many advances in argumentation theory have been made, but the exponential complexity of argumentation-based reasoning has made it impractical to apply argumentation theory. In this paper, we propose a binary decision diagram (BDD) approach to argumentation-based reasoning. In the approach, sets of arguments and defeats are encoded into BDDs so that an argumentation process can work on a set of arguments and defeats simultaneously in one BDD operation. As a result, the argumentation can be
more » ... ed in polynomial number of BDD operations on the number of input sentences. H is called the support and h is called the conclusion of the argument. A(Σ) denotes the set of all arguments which can be constructed from Σ. This definition of argument can be understood as a set of constraints on how information can be clustered as arguments. Condition (1) is to ensure that an argument is coherent.
doi:10.1007/978-3-642-21940-5_16 fatcat:53touxay5nhh5h4fcanexzcmvq