메뉴 건너뛰기




Volumn 6333 LNCS, Issue , 2010, Pages 195-203

Secrecy-preserving query answering for instance checking in EL

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS CONTROL MECHANISM; ANSWERING QUERIES; INFORMATION SHARING; KNOWLEDGE BASE; POLYNOMIAL-TIME ALGORITHMS; QUERY ANSWERING;

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

References (8)
  • 1
    • 48349128877 scopus 로고    scopus 로고
    • Privacy-preserving reasoning on the semantic web
    • IEEE Computer Society Press, Los Alamitos
    • Bao, J., Slutzki, G., Honavar, V.: Privacy-preserving reasoning on the semantic web. In: Web Intelligence, pp. 791-797. IEEE Computer Society Press, Los Alamitos (2007)
    • (2007) Web Intelligence , pp. 791-797
    • Bao, J.1    Slutzki, G.2    Honavar, V.3
  • 2
  • 3
    • 85017332763 scopus 로고    scopus 로고
    • Polynomial time reasoning in a description logic with existential restrictions, gci axioms, and - What else?
    • de Mántaras, R. L., Saitta, L. eds., IOS Press, Amsterdam
    • Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, gci axioms, and - what else? In: de Mántaras, R. L., Saitta, L. (eds.) ECAI, pp. 298-302. IOS Press, Amsterdam (2004)
    • (2004) ECAI , pp. 298-302
    • Brandt, S.1
  • 4
    • 78049369854 scopus 로고    scopus 로고
    • Data complexity in the el family of dls
    • Calvanese, D., Franconi, E., Haarslev, V., Lembo, D., Motik, B., Turhan, A.-Y., Tessaris, S. eds., CEUR-WS.org
    • Krisnadhi, A., Lutz, C.: Data complexity in the el family of dls. In: Calvanese, D., Franconi, E., Haarslev, V., Lembo, D., Motik, B., Turhan, A.-Y., Tessaris, S. (eds.) Description Logics, CEUR Workshop Proceedings, vol. 250. CEUR-WS.org (2007)
    • (2007) Description Logics, CEUR Workshop Proceedings , vol.250
    • Krisnadhi, A.1    Lutz, C.2
  • 5
    • 19944397213 scopus 로고    scopus 로고
    • Managing clinical terminology hierarchies using algorithmic calculation of subsumption: Experience with SNOMED-RT
    • Spackman, K.: Managing clinical terminology hierarchies using algorithmic calculation of subsumption: Experience with SNOMED-RT. J. of the Amer. Med. Informatics Assoc. (2000)
    • (2000) J. of the Amer. Med. Informatics Assoc.
    • Spackman, K.1
  • 6
    • 68349087666 scopus 로고    scopus 로고
    • Experience building a large, re-usable medical ontology using a description logic with transitivity and concept inclusions
    • AAAI Spring Symposium AAAI'97, Stanford, CA
    • Rector, A., Horrocks, I.: Experience building a large, re-usable medical ontology using a description logic with transitivity and concept inclusions. In: Proceedings of the Workshop on Ontological Engineering, AAAI Spring Symposium (AAAI'97), Stanford, CA, pp. 321-325 (1997)
    • (1997) Proceedings of the Workshop on Ontological Engineering , pp. 321-325
    • Rector, A.1    Horrocks, I.2
  • 7
    • 78049411611 scopus 로고    scopus 로고
    • Secrecy-preserving query answering in el
    • Iowa State University, Ames, IA
    • Tao, J., Slutzki, G., Honavar, V.: Secrecy-preserving query answering in el. Technical Report TR10-03a, Iowa State University, Ames, IA (2010)
    • (2010) Technical Report TR10-03a
    • Tao, J.1    Slutzki, G.2    Honavar, V.3
  • 8
    • 33747774836 scopus 로고    scopus 로고
    • Unauthorized inferences in semistructured databases
    • Farkas, C., Brodsky, A., Jajodia, S.: Unauthorized inferences in semistructured databases. Information Sciences 176, 3269-3299 (2006)
    • (2006) Information Sciences , vol.176 , pp. 3269-3299
    • Farkas, C.1    Brodsky, A.2    Jajodia, S.3


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