Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1997: Foundations of Software Technology and Theoretical Computer Science pp 138–152Cite as

An abductive semantics for disjunctive logic programs and its proof procedure

  • Conference paper
  • First Online:

  • 140 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1346))

Abstract

While it is well-known how normal logic programs may be viewed as a form of abduction and argumentation, the problem of how disjunctive programs may be used for abductive reasoning is rarely discussed. In this paper we propose an abductive semantics for disjunctive logic programs with default negation and show that Eshghi and Kowalski's abductive proof procedure for normal programs can be adopted to compute abductive solutions for disjunctive programs.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Baral and V. Subrahmanian. Stable and extension class theory for logic programs and default logic. J. Automated Reasoning, pages 345–366, 1992.

    Google Scholar 

  2. A. Bondarenko, F. Toni, and R. Kowalski. An assumption-based framework for nonmonotonic reasoning. In Proc. 2nd Int'l Workshop on LPNMR, pages 171–189. MIT Press, 1993.

    Google Scholar 

  3. S. Brass and J. Dix. Disjunctive semantics based upon partinal and botton-up evaluation. In Proc. 12th ICLP, pages 199–216, 1995.

    Google Scholar 

  4. W. Chen and D. Warren. Extending prolog with nonmonotonic reasoning. J. Logic Programming, 27(2):169–183, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  5. P. Dung. Acyclic disjunctive logic programs with abductive procedures as proof procedure. In Proc. 1992 Fifth Generation Computer Systems, pages 555–561, 1992.

    Google Scholar 

  6. P. Dung. An abductive procedure for disjunctive logic programs. Unpublished manuscript, 1993.

    Google Scholar 

  7. P. Dung. An argumentation theoretic foundation for logic programming. J. Logic Programming, 22:151–177, 1995. A short version appeared in Proc. ICLP '91.

    Article  MATH  MathSciNet  Google Scholar 

  8. P. Dung. On the acceptability of argument and its fundamental rule in nonmonotonic reasoning and logic programming and n-person game. Artificial Intelligence, 76, 1995. A short version appeared in Proc. IJCAI'93.

    Google Scholar 

  9. T. Eiter and G. Gottlob. On the computational cost of disjunctive logic programming: prepositional case. Annals of Mathematics and Artificial Intelligence, 15:289–324, 1993.

    Article  MathSciNet  Google Scholar 

  10. K. Eshghi and R.A. Kowalski. Abduction compared with negation by failure. In Proc. 6th ICLP, pages 234–254. MIT Press, 1989.

    Google Scholar 

  11. A. Van Gelder. The alternating fixpoint of logic programs with negation. J. Computer and System Sciences, pages 185–221, 1993. The preliminary version appeared in PODS '89.

    Google Scholar 

  12. M. Gelfond, V. Lifschitz, H. Przymusinska, and M. Truszczynski. Disjunctive defaults. In Proc. 2nd Int'l Conf. on Principle of Knowledge Representation and Reasoning, pages 230–237, 1991.

    Google Scholar 

  13. L. Giordano, A. Marteli, and M. Sapino. A semantics for eshghi and kowalski's abductive procedure. In Proc. 10th ICLP. MIT Press, 1993.

    Google Scholar 

  14. G. Gottlob. Complexity results for nonmonotonic logics. Journal of Logic and Computation, 2:397–425, 1992.

    MATH  MathSciNet  Google Scholar 

  15. K. Inoue and C. Sakama. Transforming abductive logic programs to disjunctive programs. In Proc. 10th ICLP. MIT Press, 1993.

    Google Scholar 

  16. A. Kakas, R. Kowalski, and F. Toni. Abductive logic programming. J. Logic and Computation, 2:719–770, 1992.

    MATH  MathSciNet  Google Scholar 

  17. A. Kakas, R. Kowalski, and F. Toni. The role of abduction in logic programming. In Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford University, 1995.

    Google Scholar 

  18. A. Kakas and P. Mancarella. Generalized stable models: a semantics for abduction. In Proc. 9th ECAI, 1990.

    Google Scholar 

  19. A. Kakas and P. Mancarella. Stable theories for logic programs. In Proc. ILPS. MIT Press, 1991.

    Google Scholar 

  20. A. Kakas and P. Mancarella. Preferred extensions are partial stable models. J. Logic Programming, pages 341–348, 1992.

    Google Scholar 

  21. J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.

    Google Scholar 

  22. W. Marek, A. Rajasekar, and M. Truszczyński. Complexity of computing with extended propositional logic programs. In H. Blair, W. Marek, A. Nerode, and J. Remmel, editors, Proc. the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming, pages 93–102, Washington DC, 1992. Cornell University.

    Google Scholar 

  23. D. Poole. What the lottery paradox tells us about default reasoning. In Proc. KR '89, pages 333–340, 1989.

    Google Scholar 

  24. T. C. Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 1995.

    Google Scholar 

  25. D. Saccà and C. Zaniolo. Stable models and non-determinism in logic programs with negation. In Proc. 9th ACM PODS, pages 205–217, 1990.

    Google Scholar 

  26. C. Sakama and K. Inoue. Relating disjunctive logic programs to default theories. In Proc. 2nd Int'l Worshop on LPNMR, pages 266–282. MIT Press, 1993.

    Google Scholar 

  27. C. Sakama and K. Inoue. Representing priorities in logic programs. In Proc. Int'l Conference and Symposium on Logic Programming. MIT Press, 1996.

    Google Scholar 

  28. J. You, R. Cartwright, and M. Li. Iterative belief revision in extended logic programming. Theoretical Computer Science, 170(1–2):383–406, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  29. J. You and L. Yuan. A three-valued semantics for deductive databases and logic programs. J. Computer and System Sciences, 49:334–361, 1994. A short version appeared in Proc. PODS '90.

    Article  MATH  MathSciNet  Google Scholar 

  30. J. You and L. Yuan. On the equivalence of semantics for normal logic programs. J. Logic Programming, 22(3):211–222, 1995.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Alberta, T6G 2H1, Edmonton, Alberta, Canada

    Jia -Huai You, Li Yan Yuan & Randy Goebel

Authors
  1. Jia -Huai You
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Li Yan Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Randy Goebel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Ramesh G Sivakumar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

You, J.H., Yuan, L.Y., Goebel, R. (1997). An abductive semantics for disjunctive logic programs and its proof procedure. In: Ramesh, S., Sivakumar, G. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1997. Lecture Notes in Computer Science, vol 1346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0058028

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63876-6

  • Online ISBN: 978-3-540-69659-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation