Computing, School of
School of Computing: Conference and Workshop Papers
Accessibility Remediation
If you are unable to use this item in its current form due to accessibility barriers, you may request remediation through our remediation request form.
Date of this Version
9-10-1995
Document Type
Article
Citation
P. Z. Revesz, Safe stratified Datalog with integer order programs, Proc. 1st International Conference on Principles and Practice of Constraint Programming, Springer LNCS 976, pp.154--169, Cassis, France, September 1995.
Abstract
Guaranteeing termination of programs on all valid inputs is important for database applications. Termination cannot be guaranteed in Stratified Datalog with integer (gap)-order programs on generalized databases because they express any Turing-computable function. This paper introduces a restriction of those programs that can express only computable queries. The restricted language has a high expressive power and a non-elementary data complexity.
Included in
Computer Engineering Commons, Electrical and Computer Engineering Commons, Other Computer Sciences Commons
Comments
Copyright 1995 Peter Z. Revesz