抽象论证的可实现性特征
Characterizing Realizability in Abstract Argumentation
摘要：
知识表示形式化的可实现性研究的问题是：给定一个语义和一组解释，是否存在一个其语义与给定的解释集完全一致的知识库？我们介绍了一个一般的框架，分析可实现性的抽象辩证框架（ADF）和它的各种子类。特别是，该框架适用于Dung论证框架，尼尔森和帕森斯的SETAF，以及双极ADF。我们提出了一个统一的特征化方法的容许，完全，首选和模型/稳定的语义。我们采用这种方法来设计一种算法，决定上述形式主义和语义的可实现性，而且该算法允许构建所需的知识库，只要存在。该算法是内置的一个模块化的方式，因此很容易扩展到新的形式主义和语义。我们还实现了我们的方法在答案集编程，并使用该实现获得了几个新的结果，上述形式主义的相对表现力。
英文摘要：
Realizability for knowledge representation formalisms studies the following question: given a semantics and a set of interpretations, is there a knowledge base whose semantics coincides exactly with the given interpretation set? We introduce a general framework for analyzing realizability in abstract dialectical frameworks (ADFs) and various of its subclasses. In particular, the framework applies to Dung argumentation frameworks, SETAFs by Nielsen and Parsons, and bipolar ADFs. We present a uniform characterization method for the admissible, complete, preferred and model/stable semantics. We employ this method to devise an algorithm that decides realizability for the mentioned formalisms and semantics; moreover the algorithm allows for constructing a desired knowledge base whenever one exists. The algorithm is built in a modular way and thus easily extensible to new formalisms and semantics. We have also implemented our approach in answer set programming, and used the implementation to obtain several novel results on the relative expressiveness of the abovementioned formalisms.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
