Monadic datalog containment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7392 LNCS, Issue PART 2, 2012, Pages 79-91

  Benedikt, Michael ^a   Bourhis, Pierre ^a   Senellart, Pierre ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b TELECOM PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORESTRY; MACHINERY;

CONJUNCTIVE QUERIES; DATALOG; EXPTIME; LOWER BOUNDS; TREE AUTOMATA; UPPER BOUND;

ROBOTS;

FORESTRY; MACHINERY; PROBLEM SOLVING;

EID: 84875625429     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31585-5_11     Document Type: Conference Paper

References (18)

1. Shmueli, O.: Equivalence of datalog queries is undecidable. J. Log. Prog. 15(3) (1993)
2. Bonatti, P.A.: On the decidability of containment of recursive datalog queries. In: PODS (2004)
3. Calvanese, D., De Giacomo, G., Vardi, M.Y.: Decidable containment of recursive queries. Theoretical Computer Science 336(1) (2005)
4. Chaudhuri, S., Vardi, M.Y.: On the equivalence of recursive and nonrecursive Datalog programs. In: PODS (1992)
5. Chaudhuri, S., Vardi, M.Y.: On the equivalence of recursive and nonrecursive Datalog programs. JCSS 54(1) (1997)
6. Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y.: Decidable optimization problems for database logic programs. In: STOC (1988)
7. Chaudhuri, S., Vardi, M.Y.: On the complexity of equivalence between recursive and nonrecursive Datalog programs. In: PODS (1994)
8. Cal̀?, A., Martinenghi, D.: Conjunctive Query Containment under Access Limitations. In: Li, Q., Spaccapietra, S., Yu, E., Oliv́e, A. (eds.) ER 2008. LNCS, vol. 5231, pp. 326-340. Springer, Heidelberg (2008)
9. Benedikt, M., Gottlob, G., Senellart, P.: Determining relevance of accesses at runtime. In: PODS (2011)
10. Calvanese, D., Giacomo, G.D., Lenzerini, M., Vardi, M.Y.: Containment of conjunctive regular path queries with inverse. In: KR (2000)
11. Courcelle, B.: Recursive queries and context-free graph grammars. Theoretical Computer Science 78(1) (1991)
12. ten Cate, B., Segoufin, L.: Unary negation. In: STACS (2011)
13. Benedikt, M., Bourhis, P., Ley, C.: Querying schemas with access paths. PVLDB (2012)
14. Bj̈orklund, H., Martens, W., Schwentick, T.: Optimizing Conjunctive Queries over Trees Using Schema Information. In: Ochmánski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 132-143. Springer, Heidelberg (2008)
15. Rajaraman, A., Sagiv, Y., Ullman, J.D.: Answering queries using templates with binding patterns. In: PODS (1995)
16. Li, C., Chang, E.Y.: Answering queries with useful bindings. ACM TODS 26(3) (2001)
17. Cal̀?, A., Martinenghi, D.: Querying the deep web. In: EDBT (2010)
18. Bj̈orklund, H., Martens, W., Schwentick, T.: Validity of tree pattern queries with respect to schema information (2012) (unpublished draft)