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

Jonghoon Chun; Lawrence Joseph Henschen

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

Jonghoon Chun^*, Lawrence Joseph Henschen

^*Corresponding author for this work

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Proceedings of the 4th International Conference on Software Engineering and Knowledge Engineering
Publisher	Publ by IEEE
Pages	109-115
Number of pages	7
ISBN (Print)	0818628308
State	Published - Dec 1 1992
Event	Proceedings of the 4th International Conference on Software Engineering and Knowledge Engineering - Capri, Italy Duration: Jun 15 1992 → Jun 20 1992

Other

Other	Proceedings of the 4th International Conference on Software Engineering and Knowledge Engineering
City	Capri, Italy
Period	6/15/92 → 6/20/92

ASJC Scopus subject areas

Engineering(all)

Cite this

@inproceedings{f46e44daa11e44d0b45bbf336ce66f57,

title = "Compiling rules and queries in knowledge base systems: A substitution-based approach",

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.",

author = "Jonghoon Chun and Henschen, {Lawrence Joseph}",

year = "1992",

month = dec,

day = "1",

language = "English (US)",

isbn = "0818628308",

pages = "109--115",

booktitle = "Proceedings of the 4th International Conference on Software Engineering and Knowledge Engineering",

publisher = "Publ by IEEE",

note = "Proceedings of the 4th International Conference on Software Engineering and Knowledge Engineering ; Conference date: 15-06-1992 Through 20-06-1992",

}

TY - GEN

T1 - Compiling rules and queries in knowledge base systems

T2 - Proceedings of the 4th International Conference on Software Engineering and Knowledge Engineering

AU - Chun, Jonghoon

AU - Henschen, Lawrence Joseph

PY - 1992/12/1

Y1 - 1992/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0026959030&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026959030&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0026959030

SN - 0818628308

SP - 109

EP - 115

BT - Proceedings of the 4th International Conference on Software Engineering and Knowledge Engineering

PB - Publ by IEEE

Y2 - 15 June 1992 through 20 June 1992

ER -

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

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this