New recursive subclass of domain independent formulas based on subimplication

Joonyeoub Sung; Lawrence Joseph Henschen

New recursive subclass of domain independent formulas based on subimplication

Joonyeoub Sung^*, Lawrence Joseph Henschen

^*Corresponding author for this work

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We motivate and define submiplication completion of a relational calculus query and of a general deductive database. Subimplication completion not only avoids getting unexpected answers, but also makes some domain dependent queries and databases domain independent. We define a new recursive subclass of domain independent formulas, called weakly range-restricted formulas, which is strictly larger than the class of range-restricted formulas. We also define admissible queries and deductive databases and show that under the subimplication completion they are domain independent and safe.

Original language	English (US)
Title of host publication	Proceedings - International Conference on Data Engineering
Publisher	IEEE
Pages	475-484
Number of pages	10
State	Published - Jan 1 1995
Event	Proceedings of the 1995 IEEE 11th International Conference on Data Engineering - Taipei, Taiwan Duration: Mar 6 1995 → Mar 10 1995

Other

Other	Proceedings of the 1995 IEEE 11th International Conference on Data Engineering
City	Taipei, Taiwan
Period	3/6/95 → 3/10/95

ASJC Scopus subject areas

Software
General Engineering
Engineering (miscellaneous)

Cite this

@inproceedings{236586d3e509469884fc86fe8a5f24d2,

title = "New recursive subclass of domain independent formulas based on subimplication",

abstract = "We motivate and define submiplication completion of a relational calculus query and of a general deductive database. Subimplication completion not only avoids getting unexpected answers, but also makes some domain dependent queries and databases domain independent. We define a new recursive subclass of domain independent formulas, called weakly range-restricted formulas, which is strictly larger than the class of range-restricted formulas. We also define admissible queries and deductive databases and show that under the subimplication completion they are domain independent and safe.",

author = "Joonyeoub Sung and Henschen, {Lawrence Joseph}",

year = "1995",

month = jan,

day = "1",

language = "English (US)",

pages = "475--484",

booktitle = "Proceedings - International Conference on Data Engineering",

publisher = "IEEE",

note = "Proceedings of the 1995 IEEE 11th International Conference on Data Engineering ; Conference date: 06-03-1995 Through 10-03-1995",

}

TY - GEN

T1 - New recursive subclass of domain independent formulas based on subimplication

AU - Sung, Joonyeoub

AU - Henschen, Lawrence Joseph

PY - 1995/1/1

Y1 - 1995/1/1

N2 - We motivate and define submiplication completion of a relational calculus query and of a general deductive database. Subimplication completion not only avoids getting unexpected answers, but also makes some domain dependent queries and databases domain independent. We define a new recursive subclass of domain independent formulas, called weakly range-restricted formulas, which is strictly larger than the class of range-restricted formulas. We also define admissible queries and deductive databases and show that under the subimplication completion they are domain independent and safe.

AB - We motivate and define submiplication completion of a relational calculus query and of a general deductive database. Subimplication completion not only avoids getting unexpected answers, but also makes some domain dependent queries and databases domain independent. We define a new recursive subclass of domain independent formulas, called weakly range-restricted formulas, which is strictly larger than the class of range-restricted formulas. We also define admissible queries and deductive databases and show that under the subimplication completion they are domain independent and safe.

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

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

M3 - Conference contribution

AN - SCOPUS:0029213592

SP - 475

EP - 484

BT - Proceedings - International Conference on Data Engineering

PB - IEEE

T2 - Proceedings of the 1995 IEEE 11th International Conference on Data Engineering

Y2 - 6 March 1995 through 10 March 1995

ER -

New recursive subclass of domain independent formulas based on subimplication

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this