TY - GEN
T1 - Substitution-based compilation of extended rules in deductive databases
AU - Lee, Sang Ho
AU - Henschen, Lawrence Joseph
N1 - Funding Information:
1This work was supported in part by the National Science Foundation under Grant DCR-860-8311 2Current Address: Database Section, Computer Technology Division, Electronics & Telecommunications Research Institute (ETRI), Daejon, Republic of Korea.
Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1990.
PY - 1990
Y1 - 1990
N2 - Query compilation in a deductive database refers to the process of continually replacing defined literals in rule bodies by their definitions until rules with references only to stored relations are obtained. The compiled forms generate the same tuples for the head literal in a database as do the original sets of rules. Previously, the rules were assumed to be function free. However, the use of universal quantifiers (corresponding to the division operator in a database) adds a new degree of flexibility in defining views. We propose a new inference rule, the substitution rule, to replace resolution in the compilation process. The substitution rule handles the embedded universal quantifiers correctly so that the compiled forms again derive all proper instances of the head literals.
AB - Query compilation in a deductive database refers to the process of continually replacing defined literals in rule bodies by their definitions until rules with references only to stored relations are obtained. The compiled forms generate the same tuples for the head literal in a database as do the original sets of rules. Previously, the rules were assumed to be function free. However, the use of universal quantifiers (corresponding to the division operator in a database) adds a new degree of flexibility in defining views. We propose a new inference rule, the substitution rule, to replace resolution in the compilation process. The substitution rule handles the embedded universal quantifiers correctly so that the compiled forms again derive all proper instances of the head literals.
UR - http://www.scopus.com/inward/record.url?scp=84941869899&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84941869899&partnerID=8YFLogxK
U2 - 10.1007/3-540-52885-7_79
DO - 10.1007/3-540-52885-7_79
M3 - Conference contribution
AN - SCOPUS:84941869899
SN - 9783540528852
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 57
EP - 71
BT - 10th International Conference on Automated Deduction, Proceedings
A2 - Stickel, Mark E.
PB - Springer Verlag
T2 - 10th International Conference on Automated Deduction, CADE 1990
Y2 - 24 July 1990 through 27 July 1990
ER -