Skip to main content
SpringerLink
Log in

Using semantic information for processing negation and disjunction in logic programs

  • Intelligent Databases
  • Conference paper
  • First Online:
Methodologies for Intelligent Systems (ISMIS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 689))

Included in the following conference series:

Abstract

There are many applications in which integrity constraints can play an important role. An example is the semantic query optimization method developed by Chakravarthy, Grant, and Minker for definite deductive databases. They use 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 as semantic compilation. We show that semantic compilation provides an alternative search space for negative query literals. We also 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.

Terry Gaasterland was supported by the Office of Scientific Computing, U.S. Department of Energy, under Contract W-31-109-Eng-38, and Jorge Lobo under NSF grant #IRI-9210220.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. U.S. Chakravarthy, J. Grant, and J. Minker. Logic based approach to semantic query optimization. ACM Transactions on Database Systems, 5(2):162–207, June, 1990.

    Google Scholar 

  2. U. Chakravarthy. Semantic Query Optimization in Deductive Databases. Ph.D. thesis, University of Maryland, Department of Computer Science, College Park, 1985.

    Google Scholar 

  3. D. Chan. Constructive negation based on the completed databases. In R. A. Kowalski and K. A. Bowen, editors, Proc. 5th International Conference and Symposium on Logic Programming, pages 111–125, Seattle, Washington, MIT Press, August 15–19, 1988.

    Google Scholar 

  4. K. L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, New York, 1978.

    Google Scholar 

  5. J. A. Fernández and J. Minker. Bottom-up evaluation on disjunctive databases. In K. Furukawa, editor, Proc International Conference on Logic. Programming, pages 660–675, Cambridge, Massachusetts, 1991. MIT Press.

    Google Scholar 

  6. T. Gaasterland. Generating Cooperative Answers in Deductive Databases. Ph.D. thesis, University of Maryland, Department of Computer Science, College Park, 1992. (Technical Report UMIACS-TR-92-107, CS-TR-2968, University of Maryland, October, 1992).

    Google Scholar 

  7. T. Gaasterland, M. Giuliano, A. Litcher, Y. Liu, and J. Minker. Using integrity constraints to control search in knowledge base systems. To appear, Journal of Expert Systems.

    Google Scholar 

  8. T. Gaasterland, P. Godfrey, J. Minker, and L. Novik. A cooperative answering system. In Andrei Voronkov, editor, Proceedings of the Logic Programming and Automated Reasoning Conference, pages 101–120, volume 2, Russia, July 1992.

    Google Scholar 

  9. H. Gallaire and J. Minker, editors. Logic and Databases. Plenum Press, New York, April 1978.

    Google Scholar 

  10. R. Kowalski. Logic For Problem Solving. Elsevier Science Publishing Co, Inc., Oxford, 1979.

    Google Scholar 

  11. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.

    Google Scholar 

  12. J. Minker and A. Gal. Producing cooperative answers in deductive databases. In P. Saint-Dizier and S. Szpakowics, editors, Logic and Logic Grammar for Language Processing. L.S. Horward, Ltd., 1990.

    Google Scholar 

  13. T. C Przymusinski. On constructive negation in logic programming. In E.L. Lusk and R.A. Overbeek, editors, Proc. of the North American Conference of Logic Programming, Cleveland, Ohio, October 16–20, 1989. Addendum to Proceedings.

    Google Scholar 

  14. R. Reiter. Deductive question answering on relational databases. In H. Gallaire J. Minker, editor, Logic and Data Bases, pages 149–177. Plenum Press, New York, 1978.

    Google Scholar 

  15. K. A. Ross. A procedural semantics for well founded negation in logic programs. In Proceedings of the 8th ACM SIGACT-S1GMOD-SIGART Symposium on Principle of Database Systems, Philadelphia, Pennsylvania, ACM Press, March, 29–31, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics and Computer Science Division, Argonne National Laboratory, USA

    Terry Gaasterland

  2. Department of Electrical Engineering and Computer Science, University of Illinois at Chicago, USA

    Jorge Lobo

Authors
  1. Terry Gaasterland
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jorge Lobo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Komorowski Zbigniew W. Raś

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gaasterland, T., Lobo, J. (1993). Using semantic information for processing negation and disjunction in logic programs. In: Komorowski, J., Raś, Z.W. (eds) Methodologies for Intelligent Systems. ISMIS 1993. Lecture Notes in Computer Science, vol 689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56804-2_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-56804-2_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56804-9

  • Online ISBN: 978-3-540-47750-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation