메뉴 건너뛰기




Volumn , Issue , 2009, Pages 739-745

A tableaux-based method for computing least common subsumers for expressive description logics

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; FORMAL LANGUAGES;

EID: 77956029138     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (19)

References (23)
  • 1
    • 84880689092 scopus 로고    scopus 로고
    • Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions
    • Springer
    • F. Baader and R. Küsters. Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions. In Proc. of KI'98, p. 129-140, 1998. Springer.
    • (1998) Proc. of KI'98 , pp. 129-140
    • Baader, F.1    Küsters, R.2
  • 2
    • 0043241024 scopus 로고    scopus 로고
    • Unification of concept terms in description logics
    • F. Baader and P. Narendran. Unification of concept terms in description logics. J. of Symbolic Computation, 31:277-305, 2001.
    • (2001) J. of Symbolic Computation , vol.31 , pp. 277-305
    • Baader, F.1    Narendran, P.2
  • 3
    • 78751693526 scopus 로고    scopus 로고
    • On the problem of computing small representations of least common subsumers
    • Springer
    • F. Baader and A. Y. Turhan. On the problem of computing small representations of least common subsumers. In Proc. of KI 2002, 2002. Springer.
    • Proc. of KI 2002, 2002
    • Baader, F.1    Turhan, A.Y.2
  • 4
    • 84880674268 scopus 로고    scopus 로고
    • Computing least common subsumers in description logics with existential restrictions
    • Morgan Kaufmann
    • F. Baader, R. Küsters, and R. Molitor. Computing least common subsumers in description logics with existential restrictions. In Proc. of IJCAI'99, p. 96-101. Morgan Kaufmann, 1999.
    • (1999) Proc. of IJCAI'99 , pp. 96-101
    • Baader, F.1    Küsters, R.2    Molitor, R.3
  • 6
    • 34248668998 scopus 로고    scopus 로고
    • Computing the least common subsumer w.r.t. a background terminology
    • F. Baader, B. Sertkaya, and A.-Y. Turhan. Computing the least common subsumer w.r.t. a background terminology. J. of Appl. Log., 5(3):392-420, 2007.
    • (2007) J. of Appl. Log. , vol.5 , Issue.3 , pp. 392-420
    • Baader, F.1    Sertkaya, B.2    Turhan, A.-Y.3
  • 9
    • 0002181874 scopus 로고
    • Learning the CLASSIC description logics: Theoretical and experimental results
    • W. W. Cohen and H. Hirsh. Learning the CLASSIC description logics: Theoretical and experimental results. In Proc. of KR'94, p. 121-133, 1994.
    • (1994) Proc. of KR'94 , pp. 121-133
    • Cohen, W.W.1    Hirsh, H.2
  • 10
    • 0026971891 scopus 로고
    • Computing least common subsumers in description logics
    • AAAI Press
    • W. Cohen, A. Borgida, and H. Hirsh. Computing least common subsumers in description logics. In Proc. of AAAI'92, p. 754-761, 1992. AAAI Press.
    • (1992) Proc. of AAAI'92 , pp. 754-761
    • Cohen, W.1    Borgida, A.2    Hirsh, H.3
  • 11
    • 70349264012 scopus 로고    scopus 로고
    • Finding informative commonalities in concept collections
    • ACM Press
    • S. Colucci, E. Di Sciascio, F. M. Donini, and E. Tinelli. Finding informative commonalities in concept collections. In Proc. of CIKM 2008, p. 807-816. ACM Press, 2008.
    • (2008) Proc. of CIKM 2008 , pp. 807-816
    • Colucci, S.1    Di Sciascio, E.2    Donini, F.M.3    Tinelli, E.4
  • 13
    • 33749074505 scopus 로고    scopus 로고
    • Computing concept covers: A preliminary report
    • M. S. Hacid, A. Leger, and C. Rey. Computing concept covers: A preliminary report. In Proc. of DL 2002, 2002.
    • (2002) Proc. of DL 2002
    • Hacid, M.S.1    Leger, A.2    Rey, C.3
  • 14
    • 0002785435 scopus 로고
    • Completeness in the theory of types
    • L. Henkin. Completeness in the theory of types. J. Symb. Log., 15(2):81-91, 1950.
    • (1950) J. Symb. Log. , vol.15 , Issue.2 , pp. 81-91
    • Henkin, L.1
  • 15
    • 56749161547 scopus 로고    scopus 로고
    • Similarity-based information retrieval and its role within spatial data infrastructures
    • Springer
    • K. Janowicz, M. Wilkes, and M. Lutz. Similarity-based information retrieval and its role within spatial data infrastructures. In Proc. of GIScience '08, p. 151-167. Springer, 2008.
    • (2008) Proc. of GIScience '08 , pp. 151-167
    • Janowicz, K.1    Wilkes, M.2    Lutz, M.3
  • 16
    • 34548055968 scopus 로고    scopus 로고
    • Semantic composition of lecture subparts for a personalized e-learning
    • Springer
    • N. Karam, S. Linckels, and C. Meinel. Semantic composition of lecture subparts for a personalized e-learning. In Proc. of ESWC 2007, p. 716-728. Springer, 2007.
    • (2007) Proc. of ESWC 2007 , pp. 716-728
    • Karam, N.1    Linckels, S.2    Meinel, C.3
  • 17
    • 78751698203 scopus 로고    scopus 로고
    • Design repositories on the semantic web with description-logic enabled services
    • J. B. Kopena andW. C. Regli. Design repositories on the semantic web with description-logic enabled services. In Proc. of VLDB 2003, 2003.
    • Proc. of VLDB 2003, 2003
    • Kopena, J.B.1    Regli, W.C.2
  • 18
    • 27544454540 scopus 로고    scopus 로고
    • Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions
    • R. Küsters and R. Molitor. Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions. Studia Logica, 81:227-259, 2005.
    • (2005) Studia Logica , vol.81 , pp. 227-259
    • Küsters, R.1    Molitor, R.2
  • 22
    • 84968501436 scopus 로고
    • Decidability of second-order theories and automata on infinite trees
    • M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. of the Am. Math. Soc., 141:1-35, 1969.
    • (1969) Trans. of the Am. Math. Soc. , vol.141 , pp. 1-35
    • Rabin, M.O.1


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