Author:
Gottlob Georg,Leone Nicola,Scarcello Francesco
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. S. Abiteboul, R. Hull, V. Vianu. Foundations of Databases, Addison-Wesley Publishing Company, 1995.
2. S. Arnborg, J. Lagergren, and D. Seese. Problems easy for tree-decomposable graphs. J. of Algorithms, 12:308–340, 1991.
3. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the Desiderability of Acyclic Database Schemes. Journal of ACM, 30(3):479–513, 1983.
4. P.A. Bernstein, and N. Goodman. The power of natural semijoins. SIAM J. Computing, 10(4):751–771, 1981.
5. W. Bibel. Constraint Satisfaction from a Deductive Viewpoint. Artificial Intelligence, 35,401–413, 1988.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献