UNDECIDABLE OPTIMIZATION PROBLEMS FOR DATABASE LOGIC PROGRAMS.

Haim Gaifman*, Harry Mairson

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

55 Scopus citations

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 languageEnglish
Title of host publicationUnknown Host Publication Title
PublisherIEEE
Pages106-115
Number of pages10
ISBN (Print)0818607939
StatePublished - 1987
Externally publishedYes

Fingerprint

Dive into the research topics of 'UNDECIDABLE OPTIMIZATION PROBLEMS FOR DATABASE LOGIC PROGRAMS.'. Together they form a unique fingerprint.

Cite this