TY - GEN
T1 - On first order database query languages
AU - Avron, A.
AU - Hirshfeld, J.
PY - 1991/7
Y1 - 1991/7
N2 - Using methods from model theory, the authors construct algorithms that, given any first-order predicate calculus query over a finite database, determine if they have a finite number of solutions or not, and if they do, list them all. This is done for languages that include function names (but no symbols for infinite relations) and for languages that include a name for the order of natural number or for the prefix order in a domain of strings over some alphabet (but no function symbols). The results prove some conjectures of M. Kiffer (Proc. Int. Conf. on Databases and Knowledge Bases, 1988, pp. 405-415).
AB - Using methods from model theory, the authors construct algorithms that, given any first-order predicate calculus query over a finite database, determine if they have a finite number of solutions or not, and if they do, list them all. This is done for languages that include function names (but no symbols for infinite relations) and for languages that include a name for the order of natural number or for the prefix order in a domain of strings over some alphabet (but no function symbols). The results prove some conjectures of M. Kiffer (Proc. Int. Conf. on Databases and Knowledge Bases, 1988, pp. 405-415).
UR - http://www.scopus.com/inward/record.url?scp=0026185775&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0026185775
SN - 081862230X
T3 - Proceedings - Symposium on Logic in Computer Science
SP - 226
EP - 231
BT - Proceedings - Symposium on Logic in Computer Science
PB - Publ by IEEE
T2 - Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science
Y2 - 15 July 1991 through 18 July 1991
ER -