Skip to main content
Springer Nature Link
Log in

Protected completions of first-order general logic programs

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Minker and Perlis [15] have made the important observation that in certain circumstances, it might be desirable to prevent the inference of ⌝A when A is in the finite failure set of a logic program P. In this paper, we investigate the model-theoretic aspects of their proposal and develop a Fitting-style [5] declarative semantics for protected completions of general logic programs (containing function symbols). This extends the Minker-Perlis proposal which applies to function-free pure logic programs. In addition, an operational semantics is proposed and it is proven to be sound for existentially quantified positive queries and negative ground queries to general, canonical protected logic programs. Completeness issues are investigated and completeness is proved for positive existential queries and negative ground queries for the following classes of programs: (1) function-free general protected logic programs (the Minker-Perlis operational semantics apply to function-free pure protected logic programs), (2) pure protected logic programs (with function symbols) and (3) protected general logic programs that do not contain any internal variables (though they may contain function symbols).

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Apt, K. R., Blair, H. A., and Walker, A., ‘Towards a theory of declarative knowledge’, in Foundations of Deductive Databases and Logic Programming (ed. Jack Minker), Morgan-Kauffmann (1988).

  2. Barbuti, R. and Martelli, M., ‘Completeness of the SLDNF-resolution for a class of logic programs’, Proc. 3rd Int. Conf. on Logic Prog., LNCS 225, pp. 600–614, Springer-Verlag (1986).

  3. Barbuti, R. and Martelli, M., ‘Programming in a generally functional style to design logic databases’, unpublished manuscript (1986).

  4. Cavedon, L. and Lloyd, J. W., ‘Completeness results for SLDNF-resolution’, Tech. Rep. 87/9, Dept of Computer Science, Melbourne University, to appear in J. Logic Programming.

  5. Fitting, M. C., ‘A Kripke-Kleene semantics for logic programs’, J. Logic Programming 2, 4, 295–312 (1985).

    Google Scholar 

  6. Fitting, M. C., ‘Notes on the mathematical aspects of Kripke's theory of truth’, Notre Dame J. Formal Logic 27, 1, 75–88 (1986).

    Google Scholar 

  7. Jaffar, J. and Stuckey, P. J., ‘Canonical logic programs’, J. Logic Programming 2, 143–155 (1986).

    Google Scholar 

  8. Kunen, K., ‘Signed data dependencies in logic programs’, to appear in J. Logic Programming.

  9. Lloyd, J. W., Foundations of Logic Programming, Springer-Verlag (1984).

  10. Lloyd, J. W. and Topor R., ‘A basis for deductive database systems’, J. Logic Programming 2 (1984).

  11. Lassez, J.-L. and Maher, M., ‘Optimal fixed-points of logic programs’, Theor. Comp. Sci. 39, 115–125 (1985).

    Google Scholar 

  12. Lukasiewicz, J., ‘O logice trojwartosciowej’, Ruch Filozoficzny 5, 169–170 (1920).

    Google Scholar 

  13. Maher, M., ‘Equivalences of logic programs’, in Foundations of Deductive Databases and Logic Programming (ed. Jack Minker), Morgan-Kauffmann (1988).

  14. Minker, J. and Perlis, D., ‘Applications of protected circumscription’, Proc. 7th Conf. on Automated Deduction, LNCS 170, pp. 414–425, Springer-Verlag (1984).

  15. Minker, J. and Perlis, D., ‘Computing protected circumscription’, J. Logic Programming 2, 4, 235–249 (1985).

    Google Scholar 

  16. Post, E., ‘Introduction to a general theory of elementary propositions’, Amer. J. Math. 43, 163–185 (1921).

    Google Scholar 

  17. VanFrassen, B. C., ‘Singular terms, truth-value gaps, and free logic’, J. Philosophy 63, 481–485 (1966).

    Google Scholar 

  18. Wallace, M., ‘Computable semantics for general logic programs’, to appear in J. Logic Programming.

Download references

Author information

Author notes

  1. James J. Lu

    Present address: Computer Science Dept., Northwestern University, 60201, Evanston, IL, U.S.A.

Authors and Affiliations

  1. School of Computer & Information Science, Syracuse University, 313 Link Hall, 13244-1240, Syracuse, N.Y., U.S.A.

    James J. Lu & V. S. Subrahmanian

Authors
  1. James J. Lu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. V. S. Subrahmanian
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lu, J.J., Subrahmanian, V.S. Protected completions of first-order general logic programs. J Autom Reasoning 6, 147–172 (1990). https://doi.org/10.1007/BF00245816

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words