메뉴 건너뛰기




Volumn 38, Issue 2, 2009, Pages 481-507

Ontologies and soft computing in flexible querying

Author keywords

Content understanding; Context; Fuzzy relations; Ontologies; Transitivity

Indexed keywords


EID: 72049101453     PISSN: 03248569     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (9)

References (36)
  • 1
    • 0000504344 scopus 로고
    • An algorithm for the organization of information
    • 1962
    • ADELSON-VELSKII, G. M. and LANDIS, E. M. (1962) An algorithm for the organization of information. Doklady Akademii Nauk SSSR 146, 263-266, 1962;
    • (1962) Doklady Akademii Nauk SSSR , vol.146 , pp. 263-266
    • Adelson-Velskii, G.M.1    Landis, E.M.2
  • 2
    • 0001276534 scopus 로고    scopus 로고
    • English translation in
    • English translation in Soviet Math, 3, 1259-1263.
    • Soviet Math. , vol.3 , pp. 1259-1263
  • 4
    • 11144268169 scopus 로고
    • A note on multiplying boolean matrices
    • BAKER, J. J. (1962) A note on multiplying Boolean matrices. Comm. ACM 5 (2), 102.
    • (1962) Comm. ACM , vol.5 , Issue.2 , pp. 102
    • Baker, J.J.1
  • 13
    • 0141998809 scopus 로고    scopus 로고
    • Fuzzy information retrieval based on multi-relationship fuzzy concept networks
    • CHEN, S.-M., HORNG, Y.-J. and LEE, C.-H. (2003) Fuzzy information retrieval based on multi-relationship fuzzy concept networks. Fuzzy Sets & Systems 140, 183-205.
    • (2003) Fuzzy Sets & Systems , vol.140 , pp. 183-205
    • Chen, S.-M.1    Horng, Y.-J.2    Lee, C.-H.3
  • 14
    • 34547188626 scopus 로고    scopus 로고
    • Flexible querying of semistructured data: A fuzzy-set-based approach
    • DE CALMES, M., PRADE, H. and SEDES, F. (2007) Flexible querying of semistructured data: A fuzzy-set-based approach. International Journal of Intelligent Systems 22 (7), 723-737.
    • (2007) International Journal of Intelligent Systems , vol.22 , Issue.7 , pp. 723-737
    • Calmes, M.1    Prade, H.2    Sedes, F.3
  • 15
    • 48849090539 scopus 로고    scopus 로고
    • An introduction to bipolar representations of information and preference
    • DUBOIS, D. and PRADE, H. (2008) An introduction to bipolar representations of information and preference. International Journal of Intelligent Systems 23 (8), 66-877.
    • (2008) International Journal of Intelligent Systems , vol.23 , Issue.8 , pp. 66-877
    • Dubois, D.1    Prade, H.2
  • 16
    • 72049088156 scopus 로고    scopus 로고
    • Using fuzzy sets in flexible querying: Why and how? Flexible query answering systems
    • DUBOIS, D. and PRADE, H. (1997) Using Fuzzy Sets in Flexible Querying: Why and How? Flexible Query Answering Systems. Kluwer Academic Publishers.
    • (1997) Kluwer Academic Publishers
    • Dubois, D.1    Prade, H.2
  • 17
    • 0016046280 scopus 로고
    • Some recent investigations of a new fuzzy partitioning algorithm and its applications to pattern classification problems
    • DUNN, J. C. (1974) Some recent investigations of a new fuzzy partitioning algorithm and its applications to pattern classification problems. Journal of Cybernetics 4, 1-15.
    • (1974) Journal of Cybernetics , vol.4 , pp. 1-15
    • Dunn, J.C.1
  • 18
    • 0012134807 scopus 로고    scopus 로고
    • Fuzzy information systems: Managing uncertainty in databases and information retrieval systems
    • KRAFT, D. H., PETRY, F. E. (1997) Fuzzy information systems: managing uncertainty in databases and information retrieval systems. Fuzzy Sets and Systems 90, 183-191.
    • (1997) Fuzzy Sets and Systems , vol.90 , pp. 183-191
    • Kraft, D.H.1    Petry, F.E.2
  • 19
    • 0035480423 scopus 로고    scopus 로고
    • An optimal algorithm for computing the maxmin transitive closure of a fuzzy similarity matrix
    • LEE, H.-S. (2001) An optimal algorithm for computing the maxmin transitive closure of a fuzzy similarity matrix. Fuzzy Sets & Systems 123, 129-136.
    • (2001) Fuzzy Sets & Systems , vol.123 , pp. 129-136
    • Lee, H.-S.1
  • 21
    • 0347540951 scopus 로고    scopus 로고
    • Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation
    • DE MEYER, H., NAESSENS, H. and DE BAETS, B. (2004) Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. EJOR 155, 226-238.
    • (2004) EJOR , vol.155 , pp. 226-238
    • Meyer, H.1    Naessens, H.2    Baets, B.3
  • 24
    • 24044444934 scopus 로고    scopus 로고
    • The set of fuzzy rational numbers and flexible querying
    • ROCACHER, D. and BOSC, P. (2005) The set of fuzzy rational numbers and flexible querying. Fuzzy Sets and Systems 155 (3), 317-339.
    • (2005) Fuzzy Sets and Systems , vol.155 , Issue.3 , pp. 317-339
    • Rocacher, D.1    Bosc, P.2
  • 27
    • 33746191302 scopus 로고    scopus 로고
    • Fuzzy ontologies for the semantic web
    • Springer Verlag
    • SANCHEZ, E. and YAMANOI, T. (2006) Fuzzy Ontologies for the Semantic Web. LNCS 4027, Springer Verlag, 691-699.
    • (2006) LNCS 4027 , pp. 691-699
    • Sanchez, E.1    Yamanoi, T.2
  • 28
    • 0029509262 scopus 로고
    • On the all-pairs-shortest-path problem in unweighted undirected graphs
    • SEIDEL, R. (1995) On the All-Pairs-Shortest-Path problem in unweighted undirected graphs. J. Computer & System Sciences 51, 400-403.
    • (1995) J. Computer & System Sciences , vol.51 , pp. 400-403
    • Seidel, R.1
  • 30
    • 60349113558 scopus 로고    scopus 로고
    • WSC
    • WSC, RDF Reification. http://www.w3.org/TR/rdf-schema/h-reificationvocab.
    • RDF Reification
  • 31
    • 72049118362 scopus 로고    scopus 로고
    • ™. http://image.ntua.gr/-wallace/java/transitive/.
    • Wallace, M.1
  • 33
    • 27744505065 scopus 로고    scopus 로고
    • Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
    • WALLACE, M., AVRITHIS, Y. and KOLLIAS, S. (2006) Computationally efficient sup-t transitive closure for sparse fuzzy binary relations. Fuzzy Sets and Systems 157 (3), 341-372.
    • (2006) Fuzzy Sets and Systems , vol.157 , Issue.3 , pp. 341-372
    • Wallace, M.1    Avrithis, Y.2    Kollias, S.3
  • 34
    • 0016496379 scopus 로고
    • A modification of Warshall's algorithm for the transitive closure of binary relations
    • WARREN, H. S. (1975) A modification of Warshall's algorithm for the transitive closure of binary relations. Comm. ACM 18 (4), 218-220.
    • (1975) Comm. ACM , vol.18 , Issue.4 , pp. 218-220
    • Warren, H.S.1
  • 35
    • 84945708259 scopus 로고
    • A theorem on boolean matrices
    • WARSHALL, S. (1962) A theorem on Boolean matrices. J. ACM 9 (1), 11-12.
    • (1962) J. ACM , vol.9 , Issue.1 , pp. 11-12
    • Warshall, S.1


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