메뉴 건너뛰기




Volumn 4933 LNAI, Issue , 2008, Pages 32-45

Acquiring generalized domain-range restrictions

Author keywords

[No Author keywords available]

Indexed keywords

DATA DESCRIPTION; KETONES;

EID: 49949098542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78137-0_3     Document Type: Conference Paper
Times cited : (17)

References (24)
  • 3
    • 49949119757 scopus 로고    scopus 로고
    • McGuinness, D., v. Harmelen, F.: OWL Web Ontology Language Overview. W3C Recommendation (February 10, 2004), http://www.w3.org/TR/owl-features/
    • McGuinness, D., v. Harmelen, F.: OWL Web Ontology Language Overview. W3C Recommendation (February 10, 2004), http://www.w3.org/TR/owl-features/
  • 5
    • 49949116612 scopus 로고    scopus 로고
    • Krötzsch, M., Rudolph, S., Hitzler, P.: Complexity boundaries for horn description logics. In: N.N. (ed.) Proceedings of AAAI 2007. LNCS (LNAI), Springer, Heidelberg (2007)
    • Krötzsch, M., Rudolph, S., Hitzler, P.: Complexity boundaries for horn description logics. In: N.N. (ed.) Proceedings of AAAI 2007. LNCS (LNAI), Springer, Heidelberg (2007)
  • 6
    • 84880493386 scopus 로고    scopus 로고
    • Description logic programs: Combining logic programs with description logics
    • ACM, New York
    • Grosof, B., et al.: Description logic programs: Combining logic programs with description logics. In: Proc. of the International World Wide Web Conference (WWW 2003), pp. 48-57. ACM, New York (2003)
    • (2003) Proc. of the International World Wide Web Conference (WWW , pp. 48-57
    • Grosof, B.1
  • 8
    • 0003554779 scopus 로고
    • Two basic algorithms in concept analysis
    • Technical Report 831, FB4, TH Darmstadt
    • Ganter, B.: Two basic algorithms in concept analysis. Technical Report 831, FB4, TH Darmstadt (1984)
    • (1984)
    • Ganter, B.1
  • 10
    • 0346876953 scopus 로고    scopus 로고
    • Attribute exploration with background knowledge
    • Ganter, B.: Attribute exploration with background knowledge. Theoretical Computer Science 217, 215-233 (1999)
    • (1999) Theoretical Computer Science , vol.217 , pp. 215-233
    • Ganter, B.1
  • 11
    • 35048880141 scopus 로고    scopus 로고
    • Terminologische Merkmalslogik in der formalen Begriffsanalyse
    • Stumme, G, Ganter, B, eds, Springer, Heidelberg
    • Prediger, S.: Terminologische Merkmalslogik in der formalen Begriffsanalyse. In: Stumme, G., Ganter, B. (eds.) Begriffliche Wissensverarbeitung: Methoden und Anwendungen, pp. 99-124. Springer, Heidelberg (2000)
    • (2000) Begriffliche Wissensverarbeitung: Methoden und Anwendungen , pp. 99-124
    • Prediger, S.1
  • 12
    • 0041548033 scopus 로고
    • Computing a minimal representation of the subsumption lattice of all conjunctions of concepts defined in a terminology
    • Santa Cruz, USA, pp
    • Baader, F.: Computing a minimal representation of the subsumption lattice of all conjunctions of concepts defined in a terminology. In: Proceedings of KRUSE 1995, Santa Cruz, USA, pp. 168-178 (1995)
    • (1995) Proceedings of KRUSE , pp. 168-178
    • Baader, F.1
  • 13
    • 35048890074 scopus 로고    scopus 로고
    • An FCA method for the extensional exploration of relational data
    • Ganter, B, de Moor, A, eds, Dresden, Germany, Shaker, Aachen, pp
    • Rudolph, S.: An FCA method for the extensional exploration of relational data. In: Ganter, B., de Moor, A. (eds.) Using Conceptual Structures, Contributions to ICCS 2003, Dresden, Germany, Shaker, Aachen, pp. 197-210 (2003)
    • (2003) Using Conceptual Structures, Contributions to ICCS , pp. 197-210
    • Rudolph, S.1
  • 17
    • 0021509216 scopus 로고
    • Linear-time algorithms for testing the satisfiability of propositional Horn formulae
    • Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Log. Program. 1, 267-284 (1984)
    • (1984) J. Log. Program , vol.1 , pp. 267-284
    • Dowling, W.F.1    Gallier, J.H.2
  • 19
    • 0002819235 scopus 로고
    • Families minimales d'implications informatives resultant d'un tableau de données binaires.
    • Guigues, J.L., Duquenne, V.: Families minimales d'implications informatives resultant d'un tableau de données binaires. Math. Sei Humaines 95, 5-18 (1986)
    • (1986) Math. Sei Humaines , vol.95 , pp. 5-18
    • Guigues, J.L.1    Duquenne, V.2
  • 20
    • 49949118748 scopus 로고    scopus 로고
    • Zickwolff, M.: Rule Exploration: First Order Logic in Formai Concept Analysis. PhD thesis, FB4, TH Darmstadt (1991)
    • Zickwolff, M.: Rule Exploration: First Order Logic in Formai Concept Analysis. PhD thesis, FB4, TH Darmstadt (1991)
  • 21
    • 84974706794 scopus 로고    scopus 로고
    • Formal concept analysis methods for dynamic conceptual graphs
    • Delugach, H.S, Stumme, G, eds, ICCS, Springer, Heidelberg
    • Ganter, B., Rudolph, S.: Formal concept analysis methods for dynamic conceptual graphs. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, pp. 143-156. Springer, Heidelberg (2001)
    • (2001) LNCS (LNAI , vol.2120 , pp. 143-156
    • Ganter, B.1    Rudolph, S.2
  • 22
    • 34548065511 scopus 로고    scopus 로고
    • Exploring relational structures via FLE
    • Wolff, K.E, Pfeiffer, H.D, Delugach, H.S, eds, ICCS, Springer, Heidelberg
    • Rudolph, S.: Exploring relational structures via FLE. In: Wolff, K.E., Pfeiffer, H.D., Delugach, H.S. (eds.) ICCS 2004. LNCS (LNAI), vol. 3127, pp. 196-212. Springer, Heidelberg (2004)
    • (2004) LNCS (LNAI , vol.3127 , pp. 196-212
    • Rudolph, S.1
  • 23
    • 37249007814 scopus 로고    scopus 로고
    • Supporting lexical ontology learning by relational exploration
    • Hill, R, Polovina, S, Priss, U, eds, Proceedings of ICCS, Springer, Heidelberg
    • Rudolph, S., Völker, J., Hitzler, P.: Supporting lexical ontology learning by relational exploration. In: Hill, R., Polovina, S., Priss, U. (eds.) Proceedings of ICCS 2007. LNCS (LNAI), Springer, Heidelberg (2007)
    • (2007) LNCS (LNAI
    • Rudolph, S.1    Völker, J.2    Hitzler, P.3
  • 24
    • 26844451787 scopus 로고
    • Finding closed sets under symmetry
    • Technical Report 1307, FB4, TH Darmstadt
    • Ganter, B.: Finding closed sets under symmetry. Technical Report 1307, FB4, TH Darmstadt (1990)
    • (1990)
    • Ganter, B.1


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