메뉴 건너뛰기




Volumn , Issue , 2004, Pages 450-457

A logic-based approach for query refinement in ontology-based information retrieval systems

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL; LOGIC PROGRAMMING; MAPPING; MATHEMATICAL MODELS; PROBLEM SOLVING; QUERY LANGUAGES;

EID: 16244409471     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (16)

References (10)
  • 1
    • 15544386398 scopus 로고    scopus 로고
    • A Logic-based Approach for Query Refinement
    • IEEE, in press
    • N. Stojanovic, "A Logic-based Approach for Query Refinement", WI 2004, IEEE, in press
    • WI 2004
    • Stojanovic, N.1
  • 4
    • 0001602577 scopus 로고
    • A note on inductive generalization
    • B. Meltzer and D. Michie, editors, chapter 8. American Elsevier
    • G.D. Plotkin, "A note on inductive generalization" In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 5, chapter 8, pages 153 - 163. American Elsevier, 1970
    • (1970) Machine Intelligence , vol.5 , pp. 153-163
    • Plotkin, G.D.1
  • 5
    • 33947709517 scopus 로고    scopus 로고
    • Discovery of relational association rules
    • Springer-Verlag
    • L. Dehaspe and H. Toivonen, "Discovery of Relational Association Rules", in Relational Data Mining, Springer-Verlag, 2001
    • (2001) Relational Data Mining
    • Dehaspe, L.1    Toivonen, H.2
  • 6
    • 84949203006 scopus 로고    scopus 로고
    • Generalizing refinements operators to learn prenex conjunctive normal forms
    • Proceedings of the 9th International Workshop on Inductive Logic Programming. Springer-Verlag
    • S.H. Nienhuys-Cheng, W. Van Laer, J. Ramon and L. De Raedt, "Generalizing Refinements Operators to Learn Prenex Conjunctive Normal Forms", Proceedings of the 9th International Workshop on Inductive Logic Programming, volume 1634 of LNAI, pp. 245-256. Springer-Verlag, 1999.
    • (1999) LNAI , vol.1634 , pp. 245-256
    • Nienhuys-Cheng, S.H.1    Van Laer, W.2    Ramon, J.3    De Raedt, L.4
  • 7
    • 84949204017 scopus 로고    scopus 로고
    • Refinement operator can be (weakly) perfect
    • Springer
    • L. Badea, M. Stanciu, "Refinement Operator can be (weakly) perfect", ILP-99, pp. 21-32, Springer, 1999
    • (1999) ILP-99 , pp. 21-32
    • Badea, L.1    Stanciu, M.2
  • 10
    • 0345320917 scopus 로고    scopus 로고
    • Report CW238, Department of Computing Science, K.U.Leuven
    • L. De Raedt, and L. Dehaspe, "Clausal Discovery", Report CW238, Department of Computing Science, K.U.Leuven, 1996
    • (1996) Clausal Discovery
    • De Raedt, L.1    Dehaspe, L.2


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