Abstract
Datalog is the language of logic programs without function symbols. It is used as a database query language. If it is possible to eliminate recursion from a Datalog program P, then P is said to be bounded. The problem of deciding whether a given Datalog program is bounded is shown to be undecidable, even for linear programs (i. e. , programs where each rule contains at most one occurrence of a recursive predicate. It is shown that every strongly nontrivial semantic property of Datalog programs that contain boundedness is undecidable.
Original language | English |
---|---|
Title of host publication | Unknown Host Publication Title |
Publisher | IEEE |
Pages | 106-115 |
Number of pages | 10 |
ISBN (Print) | 0818607939 |
State | Published - 1987 |
Externally published | Yes |