Argumentation (abduction) is widely applied in artificial intelligence (AI) and law reasoning. However, the problem of how to perform argumentation in disjunctive logic programming (DLP) is still open.In addition, a u...Argumentation (abduction) is widely applied in artificial intelligence (AI) and law reasoning. However, the problem of how to perform argumentation in disjunctive logic programming (DLP) is still open.In addition, a unifying semantic framework is required for incorporating various semantics for DLP. An argumentation-theoretic framework for DLP by taking the disjuncts of negative literals as abducibles is presented. This semantics not only is a simple and intuitive framework for performing argumentation and abduction in DLP, but also provides a unifying framework for many key semantics of disjunctive logic programs. In particular, it is shown that the EGCWA, well-founded model and disjunctive stable models can all be embedded into this semantics.展开更多
文摘Argumentation (abduction) is widely applied in artificial intelligence (AI) and law reasoning. However, the problem of how to perform argumentation in disjunctive logic programming (DLP) is still open.In addition, a unifying semantic framework is required for incorporating various semantics for DLP. An argumentation-theoretic framework for DLP by taking the disjuncts of negative literals as abducibles is presented. This semantics not only is a simple and intuitive framework for performing argumentation and abduction in DLP, but also provides a unifying framework for many key semantics of disjunctive logic programs. In particular, it is shown that the EGCWA, well-founded model and disjunctive stable models can all be embedded into this semantics.
