Undecidability and intractability results concerning datalog programs and their persistency numbers
Article No.: 12, Pages 1 - 29
Abstract
The relation between Datalog programs and homomorphism problems, and, between Datalog programs and bounded treewidth structures has been recognized for some time and given much attention recently. Additionally, the essential role of persistent variables (in program expansions) for solving several relevant problems has also started to be observed. In Afrati et al. [2005] the general notion of program persistencies was refined into four notions (two syntactical ones and two semantical ones) and the interrelationship between these four persistency numbers was studied. In the present article (1) we prove undecidability results concerning the semantical notions of persistency number--modulo equivalence, of persistency number and of characteristic integer, (2) we exhibit new classes of programs for which boundedness is undecidable and (3) we prove intractabiltity results concerning the syntactical notions of weak persistency number and of weak characteristic integer.
References
[1]
Abiteboul, S., Hull, R., and Vianu, V. 1995. Foundations of Databases. Addison-Wesley.
[2]
Afrati, F. N. 1997. Bounded arity Datalog(≠) queries on graphs. J. Comput. Syst. Sci. 55, 2, 210--228.
[3]
Afrati, F. N. and Cosmadakis, S. S. 1989. Expressiveness of restricted recursive queries (extended abstract). In Proceedings of the 21st Annual ACM Symposium on Theory of Computing. ACM, 113--126.
[4]
Afrati, F. N., Cosmadakis, S. S., and Foustoucos, E. 2005. Datalog programs and their persistency numbers. ACM Trans. Comput. Log. 6, 3, 481--518.
[5]
Chandra, A. K., Kozen, D., and Stockmeyer, L. J. 1981. Alternation. J. ACM 28, 1, 114--133.
[6]
Cosmadakis, S. S., Gaifman, H., Kanellakis, P. C., and Vardi, M. Y. 1988. Decidable optimization problems for database logic programs (preliminary report). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing. ACM, 477--490.
[7]
Cosmadakis, S. S. 1989. On the first-order expressibility of recursive queries. In Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, 311--323.
[8]
Courcelle, B. 1990. Graph rewriting: An algebraic and logic approach. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics (B). 193--242.
[9]
Diestel, R. 2006. Graph Theory. Springer.
[10]
Gaifman, H., Mairson, H. G., Sagiv, Y., and Vardi, M. Y. 1987. Undecidable optimization problems for database logic programs. In Proceedings of the Symposium on Logic in Computer Science. IEEE Computer Society, 106--115.
[11]
Gaifman, H., Mairson, H. G., Sagiv, Y., and Vardi, M. Y. 1993. Undecidable optimization problems for database logic programs. J. ACM 40, 3, 683--713.
[12]
Garey, M. R. and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman.
[13]
Gottlob, G., Leone, N., and Scarcello, F. 1999. Hypertree decompositions and tractable queries. In Proceedings of the 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, 21--32.
[14]
Gottlob, G., Leone, N., and Scarcello, F. 2001. Hypertree decompositions: A survey. In Proceedings of the International Symposium on the Mathematical Foundations of Computer Science, J. Sgall, A. Pultr, and P. Kolman, Eds. Lecture Notes in Computer Science, vol. 2136. Springer, 37--57.
[15]
Halin, R. 1976. S-functions for graphs. J. Geom. 8, 1-2, 171--186.
[16]
Hillebrand, G. G., Kanellakis, P. C., Mairson, H. G., and Vardi, M. Y. 1991. Tools for datalog boundedness. In Proceedings of the 10th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, 1--12.
[17]
Hillebrand, G. G., Kanellakis, P. C., Mairson, H. G., and Vardi, M. Y. 1995. Undecidable boundedness problems for Datalog programs. J. Logic Program. 25, 2, 163--190.
[18]
Hopcroft, J. E. and Ullman, J. D. 1979. Introduction to Automata Theory, Languages and Computation. Addison-Wesley.
[19]
Kolaitis, P. G. and Vardi, M. Y. 1998. Conjunctive-query containment and constraint satisfaction. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, 205--213.
[20]
Marcinkowski, J. 1999. Achilles, turtle, and undecidable boundedness problems for small Datalog programs. SIAM J. Comput. 29, 1, 231--257.
[21]
Ullman, J. D. 1988. Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press.
[22]
Vardi, M. Y. 1988. Decidability and undecidability results for boundedness of linear recursive queries. In Proceedings of the 7th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, 341--351.
Index Terms
- Undecidability and intractability results concerning datalog programs and their persistency numbers
Recommendations
Datalog programs and their persistency numbers
The relation between Datalog programs and homomorphism problems and between Datalog programs and bounded treewidth structures has been recognized for some time and given much attention recently. Additionally, the essential role of persistent variables (...
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP -optimization problems. The emphasis is on proving tight nonapproximability results via consideration of measures ...
On temporal logic versus datalog
Logic and complexity in computer scienceWe provide a direct and modular translation from the temporal logics CTL, ETL, FCTL (CTL extended with the ability to express fairness) and the Modal µ-calculus to Monadic inf-Datalog with built-in predicates. We call it inf-Datalog because the ...
Comments
Information & Contributors
Information
Published In
Copyright © 2010 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 22 January 2010
Accepted: 01 June 2008
Revised: 01 November 2007
Received: 01 December 2006
Published in TOCL Volume 11, Issue 2
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed
Funding Sources
- K. Karathéodory Basic Research Program
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 236Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 09 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in