메뉴 건너뛰기




Volumn 6333 LNCS, Issue , 2010, Pages 1-17

Query answering under non-guarded rules in Datalog+/-

Author keywords

[No Author keywords available]

Indexed keywords

ANSWERING QUERIES; COMPLEXITY RESULTS; DATA COMPLEXITY; DATALOG; INCLUSION DEPENDENCIES; INTEGRITY CONSTRAINTS; LARGE DATASETS; ONTOLOGY LANGUAGE; ONTOLOGY-BASED DATA ACCESS; QUERY ANSWERING;

EID: 78049355421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15918-3_1     Document Type: Conference Paper
Times cited : (76)

References (24)
  • 2
    • 78751687512 scopus 로고    scopus 로고
    • Extending decidable cases for rules with existential variables
    • Baget, J.-F., Leclère, M., Mugnier, M.-L., Salvat, E.: Extending decidable cases for rules with existential variables. In: Proc. of IJCAI, pp. 677-682 (2009)
    • (2009) Proc. of IJCAI , pp. 677-682
    • Baget, J.-F.1    Leclère, M.2    Mugnier, M.-L.3    Salvat, E.4
  • 3
    • 84976783056 scopus 로고
    • The implication problem for data dependencies
    • Beeri, C., Vardi, M. Y.: The implication problem for data dependencies. In: Proc. of ICALP, pp. 73-85 (1981)
    • (1981) Proc. of ICALP , pp. 73-85
    • Beeri, C.1    Vardi, M.Y.2
  • 4
    • 0348229307 scopus 로고    scopus 로고
    • The expressive power of stratified logic programs with value invention
    • Cabibbo, L.: The expressive power of stratified logic programs with value invention. Inf. Comput. 147(1), 22-56 (1998)
    • (1998) Inf. Comput. , vol.147 , Issue.1 , pp. 22-56
    • Cabibbo, L.1
  • 5
    • 84860514494 scopus 로고    scopus 로고
    • Taming the infinite chase: Query answering under expressive relational constraints
    • Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: Proc. of KR, pp. 70-80 (2008)
    • (2008) Proc. of KR , pp. 70-80
    • Calì, A.1    Gottlob, G.2    Kifer, M.3
  • 6
  • 7
    • 70350662981 scopus 로고    scopus 로고
    • A general datalog-based framework for tractable query answering over ontologies
    • Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. In: Proc. of PODS, pp. 77-86 (2009)
    • (2009) Proc. of PODS , pp. 77-86
    • Calì, A.1    Gottlob, G.2    Lukasiewicz, T.3
  • 8
    • 79957830183 scopus 로고    scopus 로고
    • Advanced processing for ontological queries
    • to appear
    • Calì, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. In: Proc. of VLDB (to appear, 2010)
    • (2010) Proc. of VLDB
    • Calì, A.1    Gottlob, G.2    Pieris, A.3
  • 10
    • 78049357096 scopus 로고    scopus 로고
    • Ontological reasoning with F-Logic Lite and its extensions
    • to appear
    • Calì, A., Gottlob, G., Pieris, A.: Ontological reasoning with F-Logic Lite and its extensions. In: Proc. of AAAI (to appear, 2010)
    • (2010) Proc. of AAAI
    • Calì, A.1    Gottlob, G.2    Pieris, A.3
  • 11
    • 1142299764 scopus 로고    scopus 로고
    • On the decidability and complexity of query answering over inconsistent and incomplete databases
    • Calì, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proc. of PODS, pp. 260-271 (2003)
    • (2003) Proc. of PODS , pp. 260-271
    • Calì, A.1    Lembo, D.2    Rosati, R.3
  • 12
    • 34548305118 scopus 로고    scopus 로고
    • Tractable reasoning and efficient query answering in description logics: The DL-lite family
    • Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-lite family. J. Autom. Reasoning 39(3), 385-429 (2007)
    • (2007) J. Autom. Reasoning , vol.39 , Issue.3 , pp. 385-429
    • Calvanese, D.1    De Giacomo, G.2    Lembo, D.3    Lenzerini, M.4    Rosati, R.5
  • 13
    • 0038062314 scopus 로고    scopus 로고
    • Complexity and expressive power of logic programming
    • Dantsin, E., Eiter, T., Georg, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3), 374-425 (2001)
    • (2001) ACM Comput. Surv. , vol.33 , Issue.3 , pp. 374-425
    • Dantsin, E.1    Eiter, T.2    Georg, G.3    Voronkov, A.4
  • 15
    • 35248867325 scopus 로고    scopus 로고
    • Reformulation of XML queries and constraints
    • Deutsch, A., Tannen, V.: Reformulation of XML queries and constraints. In: Proc. of ICDT, pp. 225-241 (2003)
    • (2003) Proc. of ICDT , pp. 225-241
    • Deutsch, A.1    Tannen, V.2
  • 17
    • 0021375730 scopus 로고
    • Testing containment of conjunctive queries under functional and inclusion dependencies
    • Johnson, D. S., Klug, A. C.: Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28(1), 167-189 (1984)
    • (1984) J. Comput. Syst. Sci. , vol.28 , Issue.1 , pp. 167-189
    • Johnson, D.S.1    Klug, A.C.2
  • 23
    • 36549038135 scopus 로고    scopus 로고
    • A comparison of two modelling paradigms in the semantic web
    • Patel-Schneider, P. F., Horrocks, I.: A comparison of two modelling paradigms in the semantic web. J. Web Semantics 5(4), 240-250 (2007)
    • (2007) J. Web Semantics , vol.5 , Issue.4 , pp. 240-250
    • Patel-Schneider, P.F.1    Horrocks, I.2


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