Abstract
Integrity constraints were initially defined to verify the correctness of the data that is stored in a database. They were used to restrict the modifications that can be applied to a database. However, there are many other applications in which integrity constraints can play an important role. For example, the semantic query optimization method developed by Chakravarthy, Grant, and Minker for definite deductive databases uses integrity constraints during query processing to prevent the exploration of search space that is bound to fail. In this paper, we generalize the semantic query optimization method to apply to negated atoms. The generalized method is referred to assemantic compilation. This exploration has led to two significant results. First, semantic compilation provides an alternative search space for negative query literals. The alternative search space can find answers in cases for which negation-as-finite-failure and constructive negation cannot. Second, we show how semantic compilation can be used to transform a disjunctive database with or without functions and denial constraints without negation into a new disjunctive database that complies with the integrity constraints.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chakravarthy, U. (1985).Semantic Query Optimization in Deductive Databases, Ph.D. thesis, University of Maryland, Department of Computer Science, College Park, MD.
Chakravarthy, U.S. Grant, J. & Minker, J. (1990). Logic Based Approach to Semantic Query Optimization,ACM Transactions on Database Systems, 5(2), 162–207.
Chan, D. (1988). Constructive Negation Based on the Completed Databases. In R.A. Kowalski and K.A. Bowen (Eds.),Proceedings of the Fifth International Conference and Symposium on Logic Programming. MIT Press: Cambridge, MA, pp. 111–125.
Clark, K.L. (1992). Negation as Failure. In H. Gallaire and J. Minker (Eds.),Logic and Data Bases. Plenum Press: New York, pp. 293–322.
Fernández, J.A., Lobo, J., Minker, J. & Subrahmanian, VS. (1992). Disjunctive LP + Integrity Constraints=Stable Model Semantics,Annals of Mathematics and Artificial Intelligence. Preliminary version presented at the Second International Symposium on Artificial Intelligence and Mathematics, Florida.
Fernández, J.A. & Minker, J. (1991). Bottom-up Evaluation on Disjunctive Databases. In K. Furukawa (Ed.),Proceedings of the International Conference on Logic Programming. MIT Press: Cambridge, MA, pp. 660–675.
Gaasterland, T. (1992).Generating Cooperative Answers in Deductive Databases, Ph.D. thesis, University of Maryland, Department of Computer Science, College Park, MD. (Technical Report UMIACS-TR-92-107, CS-TR-2968).
Gaasterland, T., Giuliano, M., Litcher, A., Liu, Y. & Minker, J. (to appear). Using Integrity Constraints to Control Search in Knowledge Base Systems.Journal of Expert Systems. (Also, Technical Report UMIACS-TR-90-27, CS-TR-2416, University of Maryland.)
Gaasterland, T., Godfrey, P., Minker, J. & Novik, L. (1992). A Cooperative Answering System. In Andrei Voronkov (Ed.),Proceedings of the Logic Programming and Automated Reasoning Conference, pp. 101–120, vol. 2.
Gallaire, H. & Minker, J. (Eds.) (1978).Logic and Databases, Plenum Press: New York.
Kowalski, R. (1979).Logic for Problem Solving, Elsevier: New York.
Lloyd, J.W. (1987).Foundations of Logic Programming, 2nd ed., Springer-Verlag: New York.
Lobo, J. & Minker, J. (1988). A Metainterpreter to Semantically Optimize Queries in Deductive Databases. In L. Kerschberg (Ed.),Proceedings of the Workshop on Expert Database Systems, pp. 387–420, Tysons Corner, VA.
Minker, J. & Gal, A. (1990). Producing Cooperative Answers in Deductive Databases. In P. Saint-Dizier and S. Szpakowics, (Eds.),Logic and Logic Grammar for Language Processing, L.S. Horward.
Przymusinski, T.C. (1989a). Every Logic Program Has a Natural Stratification and an Iterated Fixed Point Model. InProceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principle of Database Systems, pp. 11–21.
Przymusinski, T.C. (1989b). On Constructive Negation in Logic Programming. In E.L. Lusk and R.A. Overbeek (Eds.),Proceedings, of the North American Conference of Logic Programming, Cleveland, OH. Addendum to Proceedings.
Reiter, R. (1978). Deductive Question Answering on Relational Databases. In H. Gallaire and J. Minker (Eds.),Logic and Data Bases, Plenum Press: New York, pp. 149–177.
Ross, K.A. (1989). A Procedural Semantics for Well Founded Negation in Logic Programs. InProceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principle of Database Systems. Philadelphia, ACM Press.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gaasterland, T., Lobo, J. Processing negation and disjunction in logic programs through integrity constraints. J Intell Inf Syst 2, 225–243 (1993). https://doi.org/10.1007/BF00962069
Issue Date:
DOI: https://doi.org/10.1007/BF00962069