作者: Sylvie Doutre , Caroline Devred , Claire Lefèvre , Pascal Nicolas
DOI: 10.3233/978-1-60750-619-5-159
关键词: Set (abstract data type) 、 Computer science 、 Constraint (information theory) 、 Mathematical proof 、 Calculus 、 Logical formula 、 Argumentation theory 、 Dialectic 、 Artificial intelligence 、 Answer set programming
摘要: Constrained argumentation frameworks (CAF) generalize Dung's by allowing additional constraints on arguments to be taken into account in the definition of acceptability arguments. These are expressed means a logical formula which is added framework. The resulting system captures several other extensions original system. To determine if set credulously inferred from CAF, notion dialectical proof (alternating pros and cons arguments) extended for order respect constraint. new constrained proofs computed using Answer Set Programming.