Credulous argumentation with the disjunctive stable semantics
- 14 Downloads
The relationship between the disjunctive stable semantics and argumentation is rarely explored. In particular, the problem of how to perform argumentation with disjunctive logic programs by the disjunctive stable semantics is still open. This paper attempts to address this problem and a satisfied solution is provided, in which a disjunctive logic program is naturally transformed into an argument framework and the credulous argumentation is characterized as the maximal members of all acceptable hypotheses. In this semantic framework, some interesting results are obtained. In particular, it is shown that the formalism of credulous argumentation can be implemented through the disjunctive stable models. As a result, the work provides not only a new way of performing argumentation (abduction) in disjunctive deductive databases, but also a natural and complete extension for the disjunctive stable semantics.
Keywordsargumentation disjunctive stable models strongly stable disjunctive programs
- 2.Wang Kewen, Chen Huowang, Wu Quanyuan, Argumentation in disjunctive logic programming,Science in China (in Chinese), Ser. E, 1997, 28(1): 90.Google Scholar
- 3.Gelfond, M., Lifschitz, V., The stable model semantics for logic programming, inProc. 5th Int'l Conf. Symp. on Logic Programming, Seattle, 1988 (eds. Kowalski, R., Bowen, K.), Cambridge, MA: MIT Press, 1988, 1070–1080Google Scholar
- 5.Wang Kewen, An abductive framework for disjunctive logic programming,Nankai University Technical Report NIM12, 1995.Google Scholar