Compiling rules and queries in knowledge base systems: A substitution-based approach

Jonghoon Chun*, Lawrence Joseph Henschen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 introduce a more relaxed version of conventional (Skolem) function-free databases, called acceptable databases which generalize 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. The compilation technique suitable for compiling acceptable IDB rules based on the substitution rule is addressed. We show the correctness of the substitution-based compilation by proving completeness and soundness of the substitution rule.

Original languageEnglish (US)
Title of host publicationProceedings of the 4th International Conference on Software Engineering and Knowledge Engineering
PublisherPubl by IEEE
Pages109-115
Number of pages7
ISBN (Print)0818628308
StatePublished - 1992
EventProceedings of the 4th International Conference on Software Engineering and Knowledge Engineering - Capri, Italy
Duration: Jun 15 1992Jun 20 1992

Publication series

NameProceedings of the 4th International Conference on Software Engineering and Knowledge Engineering

Other

OtherProceedings of the 4th International Conference on Software Engineering and Knowledge Engineering
CityCapri, Italy
Period6/15/926/20/92

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Compiling rules and queries in knowledge base systems: A substitution-based approach'. Together they form a unique fingerprint.

Cite this