作者: Leila Amgoud , Caroline Devred
DOI: 10.1007/978-3-642-23963-2_10
关键词: ENCODE 、 Semantics (computer science) 、 Argumentation framework 、 Argumentation theory 、 Mathematics 、 Default reasoning 、 Focus (linguistics) 、 Constraint satisfaction problem 、 Encoding (memory) 、 Theoretical computer science
摘要: This paper studies how to encode the problem of computing extensions an argumentation framework (under a given semantics) as constraint satisfaction (CSP). Such encoding is great importance since it makes possible use very efficient solvers (developed by CSP community) for extensions. We focus on three families frameworks: Dung's abstract framework, its constrained version and preference-based frameworks.