메뉴 건너뛰기




Volumn , Issue , 2010, Pages 351-356

Soundness Preserving Approximation for TBox Reasoning

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DATA DESCRIPTION; INFERENCE ENGINES; KNOWLEDGE REPRESENTATION;

EID: 84889029269     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (29)

References (16)
  • 3
    • 36348950945 scopus 로고    scopus 로고
    • Approximating Description Logic Classification for Semantic Web Reasoning
    • Groot, P.; Stuckenschmidt, H.; and Wache, H. 2005. Approximating Description Logic Classification for Semantic Web Reasoning. In ESWC-2005.
    • (2005) ESWC-2005
    • Groot, P.1    Stuckenschmidt, H.2    Wache, H.3
  • 4
    • 77958569096 scopus 로고    scopus 로고
    • HermiT-Benchmark. 2009. HermiT Benchmark. http://hermit-reasoner.com/2009/JAIR benchmarks/.
    • (2009) HermiT Benchmark
  • 5
    • 52149108883 scopus 로고    scopus 로고
    • Resolution-Based Approximate Reasoning for OWL DL
    • Hitzler, P., and Vrandecic, D. 2005. Resolution-Based Approximate Reasoning for OWL DL. In ISWC-2005.
    • (2005) ISWC-2005
    • Hitzler, P.1    Vrandecic, D.2
  • 6
    • 0013214209 scopus 로고
    • Subsumption Algorithms for Concept Description Languages
    • Pitman Publishing
    • Hollunder, B.; Nutt, W.; and Schmidt-Schauß, M. 1990. Subsumption Algorithms for Concept Description Languages. In ECAI-90, 348-353. Pitman Publishing.
    • (1990) ECAI-90 , pp. 348-353
    • Hollunder, B.1    Nutt, W.2    Schmidt-Schauß, M.3
  • 8
    • 77958531827 scopus 로고    scopus 로고
    • SRIQ and SROIQ are Harder than SHOIQ
    • Kazakov, Y. 2008. SRIQ and SROIQ are Harder than SHOIQ. In DL 2008.
    • (2008) DL 2008
    • Kazakov, Y.1
  • 9
    • 77953798872 scopus 로고    scopus 로고
    • Consequence-Driven Reasoning for Horn SHIQ Ontologies
    • Kazakov, Y. 2009. Consequence-Driven Reasoning for Horn SHIQ Ontologies. In IJCAI 2009.
    • (2009) IJCAI 2009
    • Kazakov, Y.1
  • 11
    • 36348935029 scopus 로고    scopus 로고
    • Approximating OWL-DL Ontologies
    • Pan, J. Z., and Thomas, E. 2007. Approximating OWL-DL Ontologies. In AAAI-2007, 1434-1439.
    • (2007) AAAI-2007 , pp. 1434-1439
    • Pan, J. Z.1    Thomas, E.2
  • 12
    • 0029290445 scopus 로고
    • Tractable Reasoning via Approximation
    • Schaerf, M., and Cadoli, M. 1995. Tractable Reasoning via Approximation. Artificial Intelligence 74:249-310.
    • (1995) Artificial Intelligence , vol.74 , pp. 249-310
    • Schaerf, M.1    Cadoli, M.2
  • 14
    • 33748289295 scopus 로고    scopus 로고
    • Efficient Reasoning with Range and Domain Constraints
    • Tsarkov, D., and Horrocks, I. 2004. Efficient Reasoning with Range and Domain Constraints. In (DL 2004).
    • (2004) DL 2004)
    • Tsarkov, D.1    Horrocks, I.2
  • 15
    • 34548295755 scopus 로고    scopus 로고
    • Optimizing Terminological Reasoning for Expressive Description Logics
    • Tsarkov, D.; Horrocks, I.; and Patel-Schneider, P. F. 2007. Optimizing Terminological Reasoning for Expressive Description Logics. J. Autom. Reason. 39(3):277-316.
    • (2007) J. Autom. Reason , vol.39 , Issue.3 , pp. 277-316
    • Tsarkov, D.1    Horrocks, I.2    Patel-Schneider, P. F.3
  • 16
    • 77958572766 scopus 로고    scopus 로고
    • Scalable Instance Retrieval for the Semantic Web by Approximation
    • Wache, H.; Groot, P.; and Stuckenschmidt, H. 2005. Scalable Instance Retrieval for the Semantic Web by Approximation. In WISE Workshops-05.
    • (2005) WISE Workshops-05
    • Wache, H.1    Groot, P.2    Stuckenschmidt, H.3


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