Encoding Argumentation Semantics by Boolean Algebra
Summary :
In this paper, a Boolean algebra approach is proposed to encode various acceptability semantics for abstract argumentation frameworks, where each semantics can be equivalently encoded into several Boolean constraint models based on Boolean matrices and a family of Boolean operations between them. Then, we show that these models can be easily translated into logic programs, and can be solved by a constraint solver over Boolean variables. In addition, we propose some querying strategies to accelerate the calculation of the grounded, stable and complete extensions. Finally, we describe an experimental study on the performance of our encodings according to different semantics and querying strategies.
- Publication
- IEICE TRANSACTIONS on Information Vol.E100-D No.4 pp.838-848
- Publication Date
- 2017/04/01
- Publicized
- 2017/01/18
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2016EDP7313
- Type of Manuscript
- PAPER
- Category
- Artificial Intelligence, Data Mining
Authors
Fuan PU
Beijing
Guiming LUO
Beijing
Zhou JIANG
Beijing
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Fuan PU, Guiming LUO, Zhou JIANG, "Encoding Argumentation Semantics by Boolean Algebra" in IEICE TRANSACTIONS on Information,
vol. E100-D, no. 4, pp. 838-848, April 2017, doi: 10.1587/transinf.2016EDP7313.
Abstract: In this paper, a Boolean algebra approach is proposed to encode various acceptability semantics for abstract argumentation frameworks, where each semantics can be equivalently encoded into several Boolean constraint models based on Boolean matrices and a family of Boolean operations between them. Then, we show that these models can be easily translated into logic programs, and can be solved by a constraint solver over Boolean variables. In addition, we propose some querying strategies to accelerate the calculation of the grounded, stable and complete extensions. Finally, we describe an experimental study on the performance of our encodings according to different semantics and querying strategies.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2016EDP7313/_p
Copy
@ARTICLE{e100-d_4_838,
author={Fuan PU, Guiming LUO, Zhou JIANG, },
journal={IEICE TRANSACTIONS on Information},
title={Encoding Argumentation Semantics by Boolean Algebra},
year={2017},
volume={E100-D},
number={4},
pages={838-848},
abstract={In this paper, a Boolean algebra approach is proposed to encode various acceptability semantics for abstract argumentation frameworks, where each semantics can be equivalently encoded into several Boolean constraint models based on Boolean matrices and a family of Boolean operations between them. Then, we show that these models can be easily translated into logic programs, and can be solved by a constraint solver over Boolean variables. In addition, we propose some querying strategies to accelerate the calculation of the grounded, stable and complete extensions. Finally, we describe an experimental study on the performance of our encodings according to different semantics and querying strategies.},
keywords={},
doi={10.1587/transinf.2016EDP7313},
ISSN={1745-1361},
month={April},}
Copy
TY - JOUR
TI - Encoding Argumentation Semantics by Boolean Algebra
T2 - IEICE TRANSACTIONS on Information
SP - 838
EP - 848
AU - Fuan PU
AU - Guiming LUO
AU - Zhou JIANG
PY - 2017
DO - 10.1587/transinf.2016EDP7313
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E100-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 2017
AB - In this paper, a Boolean algebra approach is proposed to encode various acceptability semantics for abstract argumentation frameworks, where each semantics can be equivalently encoded into several Boolean constraint models based on Boolean matrices and a family of Boolean operations between them. Then, we show that these models can be easily translated into logic programs, and can be solved by a constraint solver over Boolean variables. In addition, we propose some querying strategies to accelerate the calculation of the grounded, stable and complete extensions. Finally, we describe an experimental study on the performance of our encodings according to different semantics and querying strategies.
ER -
English
