메뉴 건너뛰기




Volumn 6902 LNCS, Issue , 2011, Pages 2-23

Ontological query answering with existential rules

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY RESULTS; DATALOG; JOURNAL PAPER; LOGICAL FRAMEWORKS; ONTOLOGICAL QUERY; REASONING MECHANISM;

EID: 80052730550     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23580-1_2     Document Type: Conference Paper
Times cited : (28)

References (36)
  • 3
    • 33746619713 scopus 로고    scopus 로고
    • Improving the forward chaining algorithm for conceptual graphs rules
    • AAAI Press, Menlo Park
    • Baget, J.-F.: Improving the forward chaining algorithm for conceptual graphs rules. In: KR 2004, pp. 407-414. AAAI Press, Menlo Park (2004)
    • (2004) KR 2004 , pp. 407-414
    • Baget, J.-F.1
  • 4
  • 5
    • 84860583113 scopus 로고    scopus 로고
    • Walking the decidability line for rules with existential variables
    • AAAI Press, Menlo Park
    • Baget, J.-F., Leclère, M.,Mugnier, M.-L.:Walking the decidability line for rules with existential variables. In: KR 2010, pp. 466-476. AAAI Press, Menlo Park (2010)
    • (2010) KR 2010 , pp. 466-476
    • Baget, J.-F.1    Leclère, M.2    Mugnier, M.-L.3
  • 6
    • 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: IJCAI 2009, pp. 677-682 (2009)
    • (2009) IJCAI 2009 , pp. 677-682
    • Baget, J.-F.1    Leclère, M.2    Mugnier, M.-L.3    Salvat, E.4
  • 7
    • 79955095848 scopus 로고    scopus 로고
    • On rules with existential variables: Walking the decidability line
    • Baget, J.-F., Leclère, M., Mugnier, M.-L., Salvat, E.: On rules with existential variables: Walking the decidability line. Artificial Intelligence 175(9-10), 1620-1654 (2011)
    • (2011) Artificial Intelligence , vol.175 , Issue.9-10 , pp. 1620-1654
    • Baget, J.-F.1    Leclère, M.2    Mugnier, M.-L.3    Salvat, E.4
  • 9
    • 80052727525 scopus 로고    scopus 로고
    • Walking the complexity lines for generalized guarded existential rules
    • to appear
    • Baget, J.-F., Mugnier, M.-L., Rudolph, S., Thomazo, M.: Walking the complexity lines for generalized guarded existential rules. In: IJCAI 2011 (to appear 2011)
    • (2011) IJCAI 2011
    • Baget, J.-F.1    Mugnier, M.-L.2    Rudolph, S.3    Thomazo, M.4
  • 11
    • 84976783056 scopus 로고
    • The implication problem for data dependencies
    • Even, S., Kariv, O. (eds.) ICALP 1981. Springer, Heidelberg
    • Beeri, C., Vardi, M.: The implication problem for data dependencies. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 73-85. Springer, Heidelberg (1981)
    • (1981) LNCS , vol.115 , pp. 73-85
    • Beeri, C.1    Vardi, M.2
  • 12
    • 0021508773 scopus 로고
    • A proof procedure for data dependencies
    • Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. Journal of the ACM 31(4), 718-741 (1984)
    • (1984) Journal of the ACM , vol.31 , Issue.4 , pp. 718-741
    • Beeri, C.1    Vardi, M.Y.2
  • 13
    • 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: KR 2008, pp. 70-80 (2008)
    • (2008) KR 2008 , pp. 70-80
    • Calì, A.1    Gottlob, G.2    Kifer, M.3
  • 14
    • 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
  • 15
    • 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: PODS 2009, pp. 77-86 (2009)
    • (2009) PODS 2009 , pp. 77-86
    • Calì, A.1    Gottlob, G.2    Lukasiewicz, T.3
  • 16
    • 79957840778 scopus 로고    scopus 로고
    • Datalog extensions for tractable query answering over ontologies
    • De Virgilio, R., Giunchiglia, F., Tanca, L. (eds.) Springer, Heidelberg
    • Calì, A., Gottlob, G., Lukasiewicz, T.: Datalog extensions for tractable query answering over ontologies. In: De Virgilio, R., Giunchiglia, F., Tanca, L. (eds.) Semantic Web Information Management: A Model-Based Perspective, pp. 249-279. Springer, Heidelberg (2010)
    • (2010) Semantic Web Information Management: A Model-Based Perspective , pp. 249-279
    • Calì, A.1    Gottlob, G.2    Lukasiewicz, T.3
  • 17
    • 78449294986 scopus 로고    scopus 로고
    • Datalog+/-: A family of logical knowledge representation and query languages for new applications
    • IEEE Computer Society, Los Alamitos
    • Calì, A., Gottlob, G., Lukasiewicz, T., Marnette, B., Pieris, A.: Datalog+/-: A family of logical knowledge representation and query languages for new applications. In: LICS, pp. 228-242. IEEE Computer Society, Los Alamitos (2010)
    • (2010) LICS , pp. 228-242
    • Calì, A.1    Gottlob, G.2    Lukasiewicz, T.3    Marnette, B.4    Pieris, A.5
  • 18
    • 79957830183 scopus 로고    scopus 로고
    • Advanced processing for ontological queries
    • Calì, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. PVLDB 3(1), 554-565 (2010)
    • (2010) PVLDB , vol.3 , Issue.1 , pp. 554-565
    • Calì, A.1    Gottlob, G.2    Pieris, A.3
  • 19
    • 78049355421 scopus 로고    scopus 로고
    • Query answering under non-guarded rules in datalog+/-
    • Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. Springer, Heidelberg
    • Calì, A., Gottlob, G., Pieris, A.: Query answering under non-guarded rules in datalog+/-. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 1-17. Springer, Heidelberg (2010)
    • (2010) LNCS , vol.6333 , pp. 1-17
    • Calì, A.1    Gottlob, G.2    Pieris, A.3
  • 20
    • 84976755235 scopus 로고
    • Embedded implicational dependencies and their inference problem
    • ACM, New York
    • Chandra, A.K., Lewis, H.R., Makowsky, J.A.: Embedded implicational dependencies and their inference problem. In: STOC 1981, pp. 342-354. ACM, New York (1981)
    • (1981) STOC 1981 , pp. 342-354
    • Chandra, A.K.1    Lewis, H.R.2    Makowsky, J.A.3
  • 21
    • 77955230365 scopus 로고    scopus 로고
    • Graph-based Knowledge Representation and Reasoning-Computational Foundations of Conceptual Graphs
    • Springer, Heidelberg
    • Chein, M., Mugnier, M.-L.: Graph-based Knowledge Representation and Reasoning-Computational Foundations of Conceptual Graphs. In: Advanced Information and Knowledge Processing, Springer, Heidelberg (2009)
    • (2009) Advanced Information and Knowledge Processing
    • Chein, M.1    Mugnier, M.-L.2
  • 22
    • 0025398865 scopus 로고
    • The monadic second-order logic of graphs: I. recognizable sets of finite graphs
    • Courcelle, B.: The monadic second-order logic of graphs: I. recognizable sets of finite graphs. Inf. Comput. 85(1), 12-75 (1990)
    • (1990) Inf. Comput. , vol.85 , Issue.1 , pp. 12-75
    • Courcelle, B.1
  • 23
    • 0022106416 scopus 로고
    • The implication problem for functional and inclusion dependencies is undecidable
    • Chandra, A.K., Vardi, M.Y.: The implication problem for functional and inclusion dependencies is undecidable. SIAM J. Comput. 14(3), 671-677 (1985)
    • (1985) SIAM J. Comput. , vol.14 , Issue.3 , pp. 671-677
    • Chandra, A.K.1    Vardi, M.Y.2
  • 24
    • 0038062314 scopus 로고    scopus 로고
    • Complexity and expressive power of logic programming
    • Dantsin, E., Eiter, T., Gottlob, 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    Gottlob, G.3    Voronkov, A.4
  • 26
    • 35248867325 scopus 로고    scopus 로고
    • Reformulation of xml queries and constraints
    • Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. Springer, Heidelberg
    • Deutsch, A., Tannen, V.: Reformulation of xml queries and constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 225-238. Springer, Heidelberg (2002)
    • (2002) LNCS , vol.2572 , pp. 225-238
    • Deutsch, A.1    Tannen, V.2
  • 27
    • 35248877032 scopus 로고    scopus 로고
    • Data exchange: Semantics and query answering
    • Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. Springer, Heidelberg
    • Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 207-224. Springer, Heidelberg (2002)
    • (2002) LNCS , vol.2572 , pp. 207-224
    • Fagin, R.1    Kolaitis, P.G.2    Miller, R.J.3    Popa, L.4
  • 29
    • 84859119967 scopus 로고    scopus 로고
    • Extending decidable existential rules by joining acyclicity and guardedness
    • to appear
    • Krötzsch,M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: IJCAI 2011(to appear 2011)
    • (2011) IJCAI 2011
    • Krötzsch, M.1    Rudolph, S.2
  • 30
    • 36349031776 scopus 로고    scopus 로고
    • Complexity boundaries for Horn description logics
    • AAAI Press, Menlo Park
    • Krötzsch, M., Rudolph, S., Hitzler, P.: Complexity boundaries for Horn description logics. In: AAAI 2007, pp. 452-457. AAAI Press, Menlo Park (2007)
    • (2007) AAAI 2007 , pp. 452-457
    • Krötzsch, M.1    Rudolph, S.2    Hitzler, P.3
  • 31
    • 78751689814 scopus 로고    scopus 로고
    • Conjunctive query answering in the description logic el using a relational database system
    • Lutz, C., Toman, D.,Wolter, F.: Conjunctive query answering in the description logic el using a relational database system. In: IJCAI 2009, pp. 2070-2075 (2009)
    • (2009) IJCAI 2009 , pp. 2070-2075
    • Lutz, C.1    Toman, D.2    Wolter, F.3
  • 32
    • 70350657109 scopus 로고    scopus 로고
    • Generalized schema-mappings: From termination to tractability
    • Marnette, B.: Generalized schema-mappings: from termination to tractability. In: PODS, pp. 13-22 (2009)
    • (2009) PODS , pp. 13-22
    • Marnette, B.1
  • 33
    • 77954498300 scopus 로고    scopus 로고
    • On chase termination beyond stratification
    • Meier, M., Schmidt, M., Lausen, G.: On chase termination beyond stratification. In: PVLDB, vol. 2(1), pp. 970-981 (2009)
    • (2009) PVLDB , vol.2 , Issue.1 , pp. 970-981
    • Meier, M.1    Schmidt, M.2    Lausen, G.3
  • 35
    • 84955569247 scopus 로고    scopus 로고
    • Sound and Complete Forward and Backward Chainings of Graph Rules
    • Conceptual Structures: Knowledge Representation as Interlingua
    • Salvat, E., Mugnier, M.-L.: Sound and Complete Forward and Backward Chainings of Graph Rules. In: Eklund, P., Mann, G.A., Ellis, G. (eds.) ICCS 1996. LNCS (LNAI), vol. 1115, pp. 248-262. Springer, Heidelberg (1996) (Pubitemid 126107981)
    • (1996) LECTURE NOTES IN COMPUTER SCIENCE , Issue.1115 , pp. 248-262
    • Salvat, E.1    Mugnier, M.-L.2


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