Advertisement

Processing Knowledge Base Systems Containing Rules with Complex Bodies

  • Jonghoon Chun
  • Lawrence J. Henschen
Conference paper

Abstract

The use of negative information and the unrestricted use of quantifiers in the body of a rule enhances the expressive power of deductive database systems. We consider a more relaxed version of conventional deductive databases called an acceptable database which generalizes the class of allowed databases by accepting occurrences of universal quantifiers for variables occurring in positive literals and existential quantifiers for variables occurring in negative literals in the body of an IDB rule. We propose a system capable of handling such extended databases in a deductive paradigm. We pay our special attention to negative rules and queries to develop a special technique in which the relevant attribute domain set from which to remove the negated set is automatically deduced.

Keywords

Negative Rule Deductive Database Reference Domain Head Variable Negative Literal 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Apt, K., Blair, H. and Walker, A., “Towards a Theory of Declarative Knowledge,” Foundations of Deductive Databases and Logic Programming, (Minker, Ed.), Morgan Kaufmann, 1988.Google Scholar
  2. [2]
    Chun, J. and Henschen, L. J., “On Negative Rules and Queries in Expert Database Systems,” Proc. 4th Int’l Symp. on AI, Cancun, Mexico, 1991.Google Scholar
  3. [3]
    Chun, J. and Henschen, L. J., “Compiling Rules and Queries in Knowledge Base Systems: A Substitution-based Approach,” to be appeared in Proc. 4th Int’l Conf. on SEKE.Google Scholar
  4. [4]
    Decker, H., “Integrity Enforcement in Deductive Databases,” Proc. 1st Conf. on Expert Database Systems, Charleston, SC, 1986.Google Scholar
  5. [5]
    Foo, N., Rao, A., Taylor, A. and Walker, A., “Deduced Relevant Types and Constructive Negation,” Proc. 5th Conf. and Symp. on Logic Programming, (Kowalski and Bowen Eds.), MIT Press, 1988.Google Scholar
  6. [6]
    Gallaire, H., Minker, J., and Nicolas, J., “Logic and Databases: A Deductive Approach,” ACM Computing Surveys Vol. 16, No. 2, 1984.Google Scholar
  7. [7]
    Lee, S. H., “Extending the Expressive Power of Deductive Databases,” Ph. D. thesis, Northwestern University, Evanston, IL, 1989.Google Scholar
  8. [8]
    Reiter, R., “Deductive Question Answering on Relational Data Bases,” Logic and Data Bases (Gallaire and Minker, Eds.), Plenum Press, 1978.Google Scholar
  9. [9]
    Reiter, R., “On Closed World Databases,” Logic and Databases (Gallaire and Minker, Eds.), Plenum Press, 1978.Google Scholar
  10. [10]
    Seki, H. and Itoh, H., “A Query Evaluation Method for Stratified Programs under the Extended CWA,” Proc. 5th Conf. and Symp. on Logic Programming, (Kowalski and Bowen, Eds.), MIT Press, 1988.Google Scholar
  11. [11]
    Topor, R. W. and Sonenberg, E. A., “On Domain Independent Databases,” Foundations of Deductive Databases and Logic Programming, (Minker, Ed.), Morgan Kaufmann, 1988.Google Scholar
  12. [12]
    Van Gelder, A., “Negation as Failure Using Tight Derivations for General Logic Programming,” Foundations of Deductive Databases and Logic Programming, (Minker, Ed.), Morgan Kaufmann, 1988.Google Scholar

Copyright information

© Springer-Verlag/Wien 1992

Authors and Affiliations

  • Jonghoon Chun
    • 1
  • Lawrence J. Henschen
    • 1
  1. 1.Department of Electrical Engineering and Computer ScienceNorthwestern UniversityEvanstonUSA

Personalised recommendations