Boolean Matrix Approach for Abstract Argumentation

摘要

In this paper, we propose a Boolean matrix approach to encode Dung's acceptability semantics. Each semantics is encoded into one or more Boolean constraint models, which can be solved by Boolean constraint solvers. In addition, based on our Boolean matrix representations, we also propose a bit-vector-based approach to compute the grounded semantics, and the experimental results show that this approach can achieve a good performance.