Safe stratified Datalog with integer order does not have syntax

Authors:
Alexei P. Stolboushkin;Michael A. Taitslin
Affiliations:
Fourth Dimension Software, Redwood City, CA;Tver State Univ., Russia
Venue:
ACM Transactions on Database Systems (TODS)
Year:
1998

Citing 6
Cited 3

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A closed-form evaluation for Datalog queries with integer (gap)-order constraints

ICDT Selected papers of the 4th international conference on Database theory
Constraint query languages

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraint Programming and Database Query Languages

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Safe Stratified Datalog with Integer Order Programs

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming

Safe constraint queries

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Safe query languages for constraint databases

ACM Transactions on Database Systems (TODS)
Expressive power of query languages for constraint complex value databases

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Stratified Datalog with integer (gap)-order (or Datalog ¬,z ) is considered. A Datalog ¬,z -program is said to be safe if its bottom-up processing terminates on all valid inputs. We prove that safe Datalog ¬,z programs do not have effective syntax in the sense that there is no recursively enumerable set S of safe Datalog ¬,z programs such that every safe Datalog ¬,z program is equivalent to a program in S.