Skip to main content
SpringerLink
Log in

Negation as failure for disjunctive logic programming

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

We generalize the Negation-as-Failure procedure for disjunctive logic programming. Then we compare our method with related methods in the literature. We also propose a new completion theory for disjunctive logic programs which allows some program clauses to have inclusive meaning and the others exclusive meaning.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K.R. Apt and M. Bezem, Acyclic programs, in:Proc. 7th Int. Conf. on Logic Programming, Israel, eds. D.H.D. Warren and P. Szeredi (MIT Press).

  2. M. Bezem, Characterizing termination of logic programs with level mapping, in:Proc. North American Conf. on Logic Programming, eds. E.L. Lusk and R.A. Overbeek (MIT Press).

  3. D.G. Bossu and P. Siegel, Saturation, non-monotonic reasoning, and the closed world assumption, Artificial Intelligence 25 (1985) 13–63.

    Google Scholar 

  4. L. Cavedon, Continuity, consistency, and completeness properties for logic programs, in:Proc. 6th Int. Conf. on Logic Programming (MIT Press).

  5. K.L. Clark, Negation as Failure, in: Logic and Database (Plenum, New York, 1978) pp. 293–322.

    Google Scholar 

  6. P.M. Dung, Acyclic disjunctive programs with abductive procedure as proof procedure, in:Proc. 4th Fifth Generation Computer Systems, Tokyo, Japan (1992).

  7. P.M. Dung and K. Kanchanasut, On the generalized predicate completion of non-horn program, inProc. North American Conf. on Logic Programming, Vol. 1, eds. E.L. Lusk and R.A. Overbeek (MIT Press).

  8. N.H. Liem, On the negation in disjunctive logic programming, M.S. Thesis, Division of Computer Science, Asian Institute of Technology, Thailand (1991).

    Google Scholar 

  9. J.W. Lloyd,Foundations of Logic Programming, 2nd Ed. (Springer, 1987).

  10. J. Lobo, J. Minker and A. Rajasekar, Weak completion theory for non-Horn programs, in:Proc. 5th Int. Conf. on Logic Programming, eds. R.A. Kowalski and K.A. Bowen (MIT Press, 1989) pp. 828–842.

  11. D. Loveland, Near-Horn prolog, in:Proc. 4th Int. Conf. on Logic Programming, ed. J.P. Lassez (MIT Press) pp. 456–469.

  12. J. Minker, On indefinite databases and the closed world assumption, in:Proc. 6th Conf. on Automated Deduction (Springer, 1982) pp. 292–308.

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

  14. J. Minker and A. Rajasekar, A fixpoint semantics for disjunctive logic programs. J. Logic Progr. (1990) 45–74.

  15. R. Reiter,On Closed-World Data Bases, in Logic and Data Bases, eds. H. Gallaire and J. Minker, (Plenum, New York, 1978), pp. 55–76.

    Google Scholar 

  16. K. Ross, The well founded semantics for disjunctive logic programs, in:Proc. 1st Int. Conf. on Deductive and Object Oriented Databases (1989) pp. 352–369.

Download references

Author information

Authors and Affiliations

  1. Division of Computer Science, Asian Institute of Technology, G.P.O. Box 2754, 10501, Bangkok, Thailand

    Phan Minh Dung & Ngo Huu Liem

Authors
  1. Phan Minh Dung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ngo Huu Liem
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dung, P.M., Liem, N.H. Negation as failure for disjunctive logic programming. Ann Math Artif Intell 12, 25–51 (1994). https://doi.org/10.1007/BF01530760

Download citation

  • Issue Date:

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

Keywords

Search

Navigation