메뉴 건너뛰기




Volumn 175, Issue 9-10, 2011, Pages 1620-1654

On rules with existential variables: Walking the decidability line

Author keywords

Backward chaining; Chase; Decidability; Forward chaining; Rule dependency; Rules; TGD

Indexed keywords

BACKWARD CHAINING; CHASE; DECIDABILITY; FORWARD CHAINING; RULE DEPENDENCY; RULES; TGD;

EID: 79955095848     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2011.03.002     Document Type: Article
Times cited : (325)

References (38)
  • 11
    • 0021508773 scopus 로고
    • A proof procedure for data dependencies
    • C. Beeri, and M. Vardi A proof procedure for data dependencies J. ACM 31 4 1984 718 741
    • (1984) J. ACM , vol.31 , Issue.4 , pp. 718-741
    • Beeri, C.1    Vardi, M.2
  • 15
    • 78449294986 scopus 로고    scopus 로고
    • Datalog+/-: A family of logical knowledge representation and query languages for new applications
    • IEEE Computer Society
    • A. Calì, G. Gottlob, T. Lukasiewicz, B. Marnette, and A. Pieris Datalog+/-: A family of logical knowledge representation and query languages for new applications LICS 2010 IEEE Computer Society 228 242
    • (2010) LICS , pp. 228-242
    • Calì, A.1    Gottlob, G.2    Lukasiewicz, T.3    Marnette, B.4    Pieris, A.5
  • 18
    • 34548305118 scopus 로고    scopus 로고
    • Tractable reasoning and efficient query answering in description logics: The DL-Lite family
    • DOI 10.1007/s10817-007-9078-x, Special Issue on Reasoning in Description Logics
    • D. Calvanese, G.D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati Tractable reasoning and efficient query answering in description logics: The DL-Lite family J. Automat. Reason. 39 3 2007 385 429 (Pubitemid 47340922)
    • (2007) Journal of Automated Reasoning , vol.39 , Issue.3 , pp. 385-429
    • Calvanese, D.1    De Giacomo, G.2    Lembo, D.3    Lenzerini, M.4    Rosati, R.5
  • 20
    • 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, in: STOC, 1977, pp. 77-90.
    • (1977) STOC , pp. 77-90
    • Chandra, A.K.1    Merlin, P.M.2
  • 21
    • 0022106416 scopus 로고
    • The implication problem for functional and inclusion dependencies is undecidable
    • A.K. Chandra, and M.Y. Vardi The implication problem for functional and inclusion dependencies is undecidable SIAM J. Comput. 14 3 1985 671 677
    • (1985) SIAM J. Comput. , vol.14 , Issue.3 , pp. 671-677
    • Chandra, A.K.1    Vardi, M.Y.2
  • 22
    • 0000015099 scopus 로고
    • Conceptual graphs: Fundamental notions
    • M. Chein, and M.-L. Mugnier Conceptual graphs: Fundamental notions Rev. Intell. Artif. 6 4 1992 365 406
    • (1992) Rev. Intell. Artif. , vol.6 , Issue.4 , pp. 365-406
    • Chein, M.1    Mugnier, M.-L.2
  • 24
    • 0037272998 scopus 로고    scopus 로고
    • A top-down proof procedure for generalized data dependencies
    • DOI 10.1007/s00236-002-0095-2
    • S. Coulondre A top-down proof procedure for generalized data dependencies Acta Inform. 39 1 2003 1 29 (Pubitemid 36201874)
    • (2003) Acta Informatica , vol.39 , Issue.1 , pp. 1-29
    • Coulondre, S.1
  • 25
    • 0025398865 scopus 로고
    • Monadic second-order logic of graphs. I. Recognizable sets of finite graphs
    • B. Courcelle The monadic second-order logic of graphs: I. recognizable sets of finite graphs Inform. and Comput. 85 1 1990 12 75 (Pubitemid 20680563)
    • (1990) Information and Computation , vol.85 , Issue.1 , pp. 12-75
    • Courcelle Bruno1
  • 30
    • 18144386595 scopus 로고    scopus 로고
    • Data exchange: Semantics and query answering
    • DOI 10.1016/j.tcs.2004.10.033, PII S030439750400725X
    • R. Fagin, P.G. Kolaitis, R.J. Miller, and L. Popa Data exchange: semantics and query answering Theoret. Comput. Sci. 336 1 2005 89 124 (Pubitemid 40612385)
    • (2005) Theoretical Computer Science , vol.336 , Issue.1 , pp. 89-124
    • Fagin, R.1    Kolaitis, P.G.2    Miller, R.J.3    Popa, L.4
  • 32
    • 0021375730 scopus 로고
    • Testing containment of conjunctive queries under functional and inclusion dependencies
    • DOI 10.1016/0022-0000(84)90081-3
    • D. Johnson, and A. Klug Testing containment of conjunctive queries under functional and inclusion dependencies J. Comput. System Sci. 28 1 1984 167 189 (Pubitemid 14569352)
    • (1984) Journal of Computer and System Sciences , vol.28 , Issue.1 , pp. 167-189
    • Johnson, D.S.1    Klug, A.2
  • 35
    • 84955569247 scopus 로고    scopus 로고
    • Sound and Complete Forward and Backward Chainings of Graph Rules
    • Conceptual Structures: Knowledge Representation as Interlingua
    • E. Salvat, and M.-L. Mugnier Sound and complete forward and backward chainings of graph rules Proceedings of the Fourth International Conference on Conceptual Structures (ICCS96), Sydney, Australia LNAI vol. 1115 1996 Springer 248 262 (Pubitemid 126107981)
    • (1996) Lecture Notes in Computer Science , Issue.1115 , pp. 248-262
    • Salvat, E.1    Mugnier, M.-L.2
  • 38
    • 0021372035 scopus 로고
    • The implication and finite implication problems for typed template dependencies
    • DOI 10.1016/0022-0000(84)90074-6
    • M. Vardi The implication and finite implication problems for typed template dependencies J. Comput. System Sci. 28 1 1984 3 28 (Pubitemid 14569359)
    • (1984) Journal of Computer and System Sciences , vol.28 , Issue.1 , pp. 3-28
    • Vardi Moshe, Y.1


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