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.
References
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).
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).
Barbuti, R. and Martelli, M., ‘Programming in a generally functional style to design logic databases’, unpublished manuscript (1986).
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.
Fitting, M. C., ‘A Kripke-Kleene semantics for logic programs’, J. Logic Programming 2, 4, 295–312 (1985).
Fitting, M. C., ‘Notes on the mathematical aspects of Kripke's theory of truth’, Notre Dame J. Formal Logic 27, 1, 75–88 (1986).
Jaffar, J. and Stuckey, P. J., ‘Canonical logic programs’, J. Logic Programming 2, 143–155 (1986).
Kunen, K., ‘Signed data dependencies in logic programs’, to appear in J. Logic Programming.
Lloyd, J. W., Foundations of Logic Programming, Springer-Verlag (1984).
Lloyd, J. W. and Topor R., ‘A basis for deductive database systems’, J. Logic Programming 2 (1984).
Lassez, J.-L. and Maher, M., ‘Optimal fixed-points of logic programs’, Theor. Comp. Sci. 39, 115–125 (1985).
Lukasiewicz, J., ‘O logice trojwartosciowej’, Ruch Filozoficzny 5, 169–170 (1920).
Maher, M., ‘Equivalences of logic programs’, in Foundations of Deductive Databases and Logic Programming (ed. Jack Minker), Morgan-Kauffmann (1988).
Minker, J. and Perlis, D., ‘Applications of protected circumscription’, Proc. 7th Conf. on Automated Deduction, LNCS 170, pp. 414–425, Springer-Verlag (1984).
Minker, J. and Perlis, D., ‘Computing protected circumscription’, J. Logic Programming 2, 4, 235–249 (1985).
Post, E., ‘Introduction to a general theory of elementary propositions’, Amer. J. Math. 43, 163–185 (1921).
VanFrassen, B. C., ‘Singular terms, truth-value gaps, and free logic’, J. Philosophy 63, 481–485 (1966).
Wallace, M., ‘Computable semantics for general logic programs’, to appear in J. Logic Programming.
Author information
Authors and Affiliations
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00245816