A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Computing Argumentation in Polynomial Number of BDD Operations: A Preliminary Report
[chapter]
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
doi:10.1007/978-3-642-21940-5_16
fatcat:53touxay5nhh5h4fcanexzcmvq