Skip to main content
SpringerLink
Log in

Formalizing a logic for logic programming

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

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

References

  1. K.R. Apt, H. Blair and A. Walker, Towards a theory of declarative knowledge, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Los Altos, CA, 1988).

    Google Scholar 

  2. F. Bry, Logic programming as constructivism: a formalization and its application to databases, in:8th ACM Symp. on Principles of Database Systems (1989) pp. 34–50.

  3. A. Chandra and D. Harel, Horn clause queries and generalizations, J. ACM 29 (1982) 841–862.

    Google Scholar 

  4. K.L. Clark, Negation as failure, in:Logic and Databases, eds. Gallaire and Minker (Plenum Press, New York, 1978) pp. 293–322.

    Google Scholar 

  5. M. Fitting, A Kripke-Kleene semantics for logic programs, J. Logic Progr. 2 (1985) 295–312.

    Google Scholar 

  6. M. Gelfond, On stratified autoepistemic theories, in:Proc. AAAI (1987).

  7. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming,Proc. 5th Int. Conf. Symp. on Logic Programming (1988).

  8. P. Kolaitis and C. Papadimitriou, Why not negation by fixpoint?, in:Proc. 7th Symp. on Principles of Database Systems (1988).

  9. K. Kunen, Negation in logic programming, J. Logic Progr. 4 (1987) 289–308.

    Google Scholar 

  10. K. Kunen, Some remarks on the completed database, Technical Report 775, Univ. of Wisconsin, Madison, WI 53706.

  11. V. Lifschitz, On the declarative semantics of logic programs with negation, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Los Altos, CA, 1988) pp. 177–192.

    Google Scholar 

  12. W. Marek and M. Truszczynski, Autoepistemic logic, J. ACM 38 (1991) 588–619.

    Google Scholar 

  13. T.C. Przymusinski, On the declarative semantics of deductive databases and logic programs, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Los Altos, CA, 1988) pp. 193–216.

    Google Scholar 

  14. T.C. Przymusinski, Every logic program has a natural stratification and an iterated fixed point model,8th ACM Symp. on Principles of Database Systems (1989) pp. 11–21.

  15. K.A. Ross, A procedural semantics for well-founded negation in logic programs, in:8th ACM Symp. on Principles of Database Systems (1989) pp. 22–33.

  16. J.C. Shepherdson, Negation as failure, II, J. Logic Progr. 2 (1985) 185–202.

    Google Scholar 

  17. M.H. Van Emden and R.A. Kowalski, The semantics of predicate logic as a programming language, J. ACM 23 (1976) 733–742.

    Google Scholar 

  18. A. Van Gelder, Negation as failure using tight derivations for general logic programs, in:Proc. 3rd IEEE Symp. on Logic Programming, Salt Lake City, Utah (Springer, New York, 1986).

    Google Scholar 

  19. A. Van Gelder, The alternating fixpoint of logic programs with negation, in:8th ACM Symp. on Principles of Database Systems (1989) pp. 1–10. Available from UC Santa Cruz as UCSC-CRL-88-17.

  20. A. Van Gelder, K.A. Ross and J.S. Schlipf, The well-founded semantics for general logic programs, J. ACM 38 (1991) 620–650.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Intelligent Systems, Department of Computer Science, University of Cincinnati, 45221-0008, Cincinnati, OH, USA

    John S. Schlipf

Authors
  1. John S. Schlipf
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was partially supported by NSF grants IRI-8705184 and IRI-8905166.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schlipf, J.S. Formalizing a logic for logic programming. Ann Math Artif Intell 5, 279–302 (1992). https://doi.org/10.1007/BF01543479

Download citation

  • Issue Date:

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

Keywords

Search

Navigation