Skip to main content
SpringerLink
Log in

Fixed point theorems in logic programming

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

Abstract

We discuss two major fixed point theorems which are based on a notion of completeness. Although the spaces involved are of different nature, there is a similarity between the two theorems.

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. C.R. Baral and V.S. Subrahmanian, Stable and extension class theory for logic programs and default logics, Journal of Automated Reasoning 8 (1992) 345–366.

    Article  MATH  MathSciNet  Google Scholar 

  2. F. Fages, Consistency of Clark's completion and existence of stable models, Journal of Methods of Logic in Computer Science 1 (1994) 51–60.

    Google Scholar 

  3. M. Fitting, Metric methods, three examples and a theorem, Journal of Logic Programming (1993), to appear.

  4. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Logic Programming: Proceedings of the 5th Int. Conference and Symposium, eds. R. Kowalski and K. Bowen (1988) pp. 1070–1080.

  5. J. Kelley, General Topology (Van Nostrand, Princeton, NJ, 1955).

    Google Scholar 

  6. K. Kunen, Signed data dependencies in logic programs, Journal of Logic Programming 7(3) (1989) 231–245.

    Article  MathSciNet  Google Scholar 

  7. J.W. Loyd, Foundations of Logic Programming (Springer-Verlag, New York, 1987).

    Google Scholar 

  8. A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Math. 5 (1955) 285–309.

    MATH  MathSciNet  Google Scholar 

  9. H. Turner, Signed logic programs, in: Logic Programming: Proc. of the 1994 Int. Symposium, ed. M. Bruynooghe (MIT Press, 1994) pp. 61–75.

  10. M.A. Khamsi, D. Misane and V. Kreinovitch, A new method of proving the existence of answer sets for disjunctive logic programs, in: Proc. ILPS'93 Workshop on Logic Programming with Incomplete Information, eds. C. Baral and M. Gelfond (1993).

  11. M.A. Khamsi and D. Misane, Disjunctive signed logic programs, Preprint.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, University of Texas at El Paso, El Paso, TX, 79968, USA

    Mohamed A. Khamsi

  2. Departement de Mathematiques, Universite Mohamed V, Faculte des Sciences, Rabat, Morocco

    Driss Misane

Authors
  1. Mohamed A. Khamsi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Driss Misane
    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

Khamsi, M.A., Misane, D. Fixed point theorems in logic programming. Annals of Mathematics and Artificial Intelligence 21, 231–243 (1997). https://doi.org/10.1023/A:1018969519807

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018969519807

Keywords

Search

Navigation