Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs


DATALOG is the language of logic programs without function symbols. It is considered to be the paradigmatic database query language. If it is possible to eliminate recursion from a DATALOG program then it is bounded. Since bounded programs can be executed in the parallel constant time, the possibility of automatized boundedness detecting is believed to be… (More)
DOI: 10.1137/S0097539797322140