Semantic Checking of Questions Expressed in Predicate Calculus Language.

@inproceedings{DBLP:conf/vldb/Demolombe79,
  author    = {Robert Demolombe},
  editor    = {Antonio L. Furtado and
               Howard L. Morgan},
  title     = {Semantic Checking of Questions Expressed in Predicate Calculus
               Language},
  booktitle = {Fifth International Conference on Very Large Data Bases, October
               3-5, 1979, Rio de Janeiro, Brazil, Proceedings},
  publisher = {IEEE Computer Society},
  year      = {1979},
  pages     = {444-450},
  ee        = {db/conf/vldb/Demolombe79.html},
  crossref  = {DBLP:conf/vldb/79},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Not all predicate calculus WFF correspond to meaningful questions, In order to avoid this problem, +different authors have defined syntactically the WFF classes which are known to be significative. These restrictions are generally more severe than is necessary, and we have defined a much wider class of WFF : the evaluable formula.

We prove that these WFF have a clearly defined sense. Moreover, we can easily test a formula to see if it is evaluable.

Finally, we show how it is possible to deduce from a formula the conditions which have to be fulfilled by the predicate argument validity domains in order to obtain-answers which are not an empty set. We can thus reject questions which have a defined sense but which, in the context of a clearly determined application, cannot have an answer.

Copyright © 1979 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/vldb7588 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Printed Edition

References

[1]

...

[2]

...

[3]

Donald D. Chamberlin, Raymond F. Boyce: SEQUEL: A Structured English Query Language. SIGMOD Workshop, Vol. 1 1974: 249-264 BibTeX

[4]

E. F. Codd: Relational Completeness of Data Base Sublanguages. In: R. Rustin (ed.): Database Systems: 65-98, Prentice Hall and IBM Research Report RJ 987, San Jose, California : (1972) BibTeX

[5]

...

[6]

...

[7]

...

[8]

...

[9]

...

[10]

...

[11]

...

[12]

...

[13]

...

[14]

...

[15]

...

Referenced by

1. Hervé Gallaire: Impacts of Logic and Databases (Invited Paper). VLDB 1981: 248-259
2. Robert Demolombe: Estimation of the Number of Tuples Satisfying a Query Expressed in Predicate Calculus Language. VLDB 1980: 55-63
3. Jean Le Bihan, Christian Esculier, Gérard Le Lann, Witold Litwin, Georges Gardarin, S. Sedillort, L. Treille: SIRIUS: A French Nationwide Project on Distributed Data Bases. VLDB 1980: 75-85