메뉴 건너뛰기




Volumn 23, Issue , 2004, Pages 297-306

On the decidability of containment of recursive datalog queries - Preliminary report

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; DATABASE SYSTEMS; NONLINEAR SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

EID: 3142679372     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1055558.1055600     Document Type: Conference Paper
Times cited : (10)

References (11)
  • 1
    • 3142778862 scopus 로고    scopus 로고
    • Undecidability results-for description logics with recursion and counting
    • P.A. Bonatti. Undecidability results-for description logics with recursion and counting. In Proc. of IJCAI'03, pp., 2003.
    • Proc. of IJCAI'03 , pp. 2003
    • Bonatti, P.A.1
  • 2
    • 77952052056 scopus 로고    scopus 로고
    • Towards service description logics
    • LNAI 2424, Springer
    • P.A. Bonatti. Towards Service Description Logics. In Proc. of JELIA'02, LNAI 2424, pages 74-85, 2002. Springer.
    • (2002) Proc. of JELIA'02 , pp. 74-85
    • Bonatti, P.A.1
  • 4
    • 84880652644 scopus 로고    scopus 로고
    • Reasoning in expressive description logics with fixpoints based on automata on infinite trees
    • D. Calvanese, G. De Giacomo, M. Lenzerini. Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In Proc. of IJCAI'99, pages 84-89, 1999.
    • (1999) Proc. of IJCAI'99 , pp. 84-89
    • Calvanese, D.1    De Giacomo, G.2    Lenzerini, M.3
  • 5
    • 35248855387 scopus 로고    scopus 로고
    • Decidable Containment of Recursive Queries
    • LNCS 2572, Springer
    • D. Calvanese, G. De Giacomo, Moshe Y. Vardi. Decidable Containment of Recursive Queries. Proc. of ICDT'OS, LNCS 2572, pp. 330-345, 2003. Springer.
    • (2003) Proc. of ICDT'OS , pp. 330-345
    • Calvanese, D.1    De Giacomo, G.2    Vardi, M.Y.3
  • 6
    • 84958776545 scopus 로고
    • Optimal implementation of conjunctive queries in relational data bases
    • A.K. Chandra, P.M. Merlin. Optimal Implementation of Conjunctive Queries in Relational Data Bases. Proc. of ACM STOC'77, pp. 77-90, 1977.
    • (1977) Proc. of ACM STOC'77 , pp. 77-90
    • Chandra, A.K.1    Merlin, P.M.2
  • 9
    • 0005411349 scopus 로고    scopus 로고
    • The hybrid μ-calculus
    • LNCS 2392, Springer
    • U. Sattler, M.Y. Vardi. The hybrid μ-calculus. In Proc. of IJCAR'01, LNCS 2392, pages 27-30, 2001. Springer.
    • (2001) Proc. of IJCAR'01 , pp. 27-30
    • Sattler, U.1    Vardi, M.Y.2
  • 10
    • 0002732106 scopus 로고
    • Equivalence of DATALOG queries is undecidable
    • O. Shinueli. Equivalence of DATALOG Queries is Undecidable. JLP, 15(3): 231-241, 1993.
    • (1993) JLP , vol.15 , Issue.3 , pp. 231-241
    • Shinueli, O.1
  • 11
    • 84948958512 scopus 로고    scopus 로고
    • Information Integration using logical views
    • LNCS 1186, Springer
    • J.D. Ullman. Information Integration Using Logical Views. Proc. of ICDT'97, LNCS 1186, pp. 19-40, 1997. Springer.
    • (1997) Proc. of ICDT'97 , pp. 19-40
    • Ullman, J.D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.