Work

Undecidable optimization problems for database logic programs

Year: 1993

Type: article

Abstract: Datalogis 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 F', then t' is said to be bounded.It is shown that the problem of deciding whether a given Datalog program is bounded is undecidable, even for linear programs (i.e., programs in which each rule contains at most one occurrence of a recursive predicate).It is then shown that every semantic property of Datalog programs is undecidable if it is stable, is strongly nontrivial, and contains An earlier version of this work appeared under the same title in the Proceedings of the 2nd IEEE Symposium on Logic i~z Computer Science (Ithaca, N.Y.).

Source: Journal of the ACM

DOI: 10.1145/174130.174142

Authors: Haim Gaifman, Harry Mairson, Yehoshua Sagiv, Moshe Y. Vardi

Institutions: Hebrew University of Jerusalem, Brandeis University, IBM (United States), IBM Research - Almaden

Language: English

Topic: Logic, Reasoning, and Knowledge

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, International Business Machines Corporation, University of Oxford, Office of Naval Research

OpenAlex ID: W245469613

FWCI: 7.619

Cites: 45

Cited by: 162

Related to: 10