Decidable optimization problems for database logic programs

Stavros S. Cosmadakis; Paris C. Kanellakis; Haim Gaifman; Moshe Y. Vardi

doi:10.1145/62212.62259

Decidable optimization problems for database logic programs

Stavros S. Cosmadakis, Paris C. Kanellakis, Haim Gaifman, Moshe Y. Vardi

Einstein Institute of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

140 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 II, then II is said to be bounded. It is known that the problem of deciding whether a given Datalog program is bounded is undecidable, even for binary programs. We show here that boundedness is decidable for monadic programs, i.e., programs where the recursive predicates are monadic (the non-recursive predicates can have arbitrary arity). Underlying our results are new tools for the optimization of Datalog programs based on automata theory and logic. In particular, one of the tools we develop is a theory of two-way alternating tree automata. We also use our techniques to show that containment for monadic programs is decidable.

Original language	English
Title of host publication	Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988
Publisher	Association for Computing Machinery
Pages	477-490
Number of pages	14
ISBN (Print)	0897912640, 9780897912648
DOIs	https://doi.org/10.1145/62212.62259
State	Published - 1988
Event	20th Annual ACM Symposium on Theory of Computing, STOC 1988 - Chicago, IL, United States Duration: 2 May 1988 → 4 May 1988

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)	0737-8017

Conference

Conference	20th Annual ACM Symposium on Theory of Computing, STOC 1988
Country/Territory	United States
City	Chicago, IL
Period	2/05/88 → 4/05/88

Access to Document

10.1145/62212.62259

Cite this

Cosmadakis, S. S., Kanellakis, P. C., Gaifman, H., & Vardi, M. Y. (1988). Decidable optimization problems for database logic programs. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988 (pp. 477-490). (Proceedings of the Annual ACM Symposium on Theory of Computing). Association for Computing Machinery. https://doi.org/10.1145/62212.62259

@inproceedings{94a1aafd72ca4f51aa1f5cceb9974ea8,

title = "Decidable optimization problems for database logic programs",

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 II, then II is said to be bounded. It is known that the problem of deciding whether a given Datalog program is bounded is undecidable, even for binary programs. We show here that boundedness is decidable for monadic programs, i.e., programs where the recursive predicates are monadic (the non-recursive predicates can have arbitrary arity). Underlying our results are new tools for the optimization of Datalog programs based on automata theory and logic. In particular, one of the tools we develop is a theory of two-way alternating tree automata. We also use our techniques to show that containment for monadic programs is decidable.",

author = "Cosmadakis, {Stavros S.} and Kanellakis, {Paris C.} and Haim Gaifman and Vardi, {Moshe Y.}",

year = "1988",

doi = "10.1145/62212.62259",

language = "אנגלית",

isbn = "0897912640",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "477--490",

booktitle = "Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988",

note = "20th Annual ACM Symposium on Theory of Computing, STOC 1988 ; Conference date: 02-05-1988 Through 04-05-1988",

}

Cosmadakis, SS, Kanellakis, PC, Gaifman, H & Vardi, MY 1988, Decidable optimization problems for database logic programs. in Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988. Proceedings of the Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, pp. 477-490, 20th Annual ACM Symposium on Theory of Computing, STOC 1988, Chicago, IL, United States, 2/05/88. https://doi.org/10.1145/62212.62259

Decidable optimization problems for database logic programs. / Cosmadakis, Stavros S.; Kanellakis, Paris C.; Gaifman, Haim et al.
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988. Association for Computing Machinery, 1988. p. 477-490 (Proceedings of the Annual ACM Symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Decidable optimization problems for database logic programs

AU - Cosmadakis, Stavros S.

AU - Kanellakis, Paris C.

AU - Gaifman, Haim

AU - Vardi, Moshe Y.

PY - 1988

Y1 - 1988

N2 - 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 II, then II is said to be bounded. It is known that the problem of deciding whether a given Datalog program is bounded is undecidable, even for binary programs. We show here that boundedness is decidable for monadic programs, i.e., programs where the recursive predicates are monadic (the non-recursive predicates can have arbitrary arity). Underlying our results are new tools for the optimization of Datalog programs based on automata theory and logic. In particular, one of the tools we develop is a theory of two-way alternating tree automata. We also use our techniques to show that containment for monadic programs is decidable.

AB - 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 II, then II is said to be bounded. It is known that the problem of deciding whether a given Datalog program is bounded is undecidable, even for binary programs. We show here that boundedness is decidable for monadic programs, i.e., programs where the recursive predicates are monadic (the non-recursive predicates can have arbitrary arity). Underlying our results are new tools for the optimization of Datalog programs based on automata theory and logic. In particular, one of the tools we develop is a theory of two-way alternating tree automata. We also use our techniques to show that containment for monadic programs is decidable.

UR - http://www.scopus.com/inward/record.url?scp=84898929116&partnerID=8YFLogxK

U2 - 10.1145/62212.62259

DO - 10.1145/62212.62259

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84898929116

SN - 0897912640

SN - 9780897912648

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 477

EP - 490

BT - Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988

PB - Association for Computing Machinery

T2 - 20th Annual ACM Symposium on Theory of Computing, STOC 1988

Y2 - 2 May 1988 through 4 May 1988

ER -

Decidable optimization problems for database logic programs

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this