Skip to main content
Log in

Credulous argumentation with the disjunctive stable semantics

  • Published:
Science in China Series E: Technological Sciences Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Przymunski, T., Stable semantics for disjunctive programs.New Generation Computing, 1991, 9: 401.

    Article  Google Scholar 

  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–1080

    Google Scholar 

  4. Levi, G.,Advances in Logic Programming Theory Oxford: Clarendon, 1994, 1–53.

    MATH  Google Scholar 

  5. Wang Kewen, An abductive framework for disjunctive logic programming,Nankai University Technical Report NIM12, 1995.

  6. Torres, A., A nondeterministic well-founded semantics,Annals of Math. and AI, 1995, 14; 37.

    MATH  MathSciNet  Google Scholar 

  7. Sato T., Completed logic programs and their consistency,J. Logic Programming, 1990, 9(1): 33.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, K., Chen, H. & Wu, Q. Credulous argumentation with the disjunctive stable semantics. Sci. China Ser. E-Technol. Sci. 41, 330–336 (1998). https://doi.org/10.1007/BF02919444

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02919444

Keywords

Navigation