New recursive subclass of domain independent formulas based on subimplication

Joonyeoub Sung*, Lawrence Joseph Henschen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationProceedings - International Conference on Data Engineering
PublisherIEEE
Pages475-484
Number of pages10
StatePublished - Jan 1 1995
EventProceedings of the 1995 IEEE 11th International Conference on Data Engineering - Taipei, Taiwan
Duration: Mar 6 1995Mar 10 1995

Other

OtherProceedings of the 1995 IEEE 11th International Conference on Data Engineering
CityTaipei, Taiwan
Period3/6/953/10/95

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Fingerprint Dive into the research topics of 'New recursive subclass of domain independent formulas based on subimplication'. Together they form a unique fingerprint.

Cite this