메뉴 건너뛰기




Volumn 3703 LNCS, Issue , 2005, Pages 118-132

Principles of inductive reasoning on the semantic web: A framework for learning in Aℒ-log

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; KNOWLEDGE BASED SYSTEMS; LEARNING SYSTEMS; WORLD WIDE WEB;

EID: 33646199426     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11552222_12     Document Type: Conference Paper
Times cited : (12)

References (26)
  • 1
    • 0003727420 scopus 로고    scopus 로고
    • F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P.F. Patel-Schneicler, editors. Cambridge University Press
    • F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P.F. Patel-Schneicler, editors. The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, 2003.
    • (2003) The Description Logic Handbook: Theory, Implementation and Applications
  • 4
    • 0030125127 scopus 로고    scopus 로고
    • On the relative expressiveness of description logics and predicate logics
    • A. Borgida. On the relative expressiveness of description logics and predicate logics. Artificial Intelligence, 82(1-2):353-367, 1996.
    • (1996) Artificial Intelligence , vol.82 , Issue.1-2 , pp. 353-367
    • Borgida, A.1
  • 5
    • 0024084964 scopus 로고
    • Generalized snbsumption and its application to induction and redundancy
    • W. Buntine. Generalized snbsumption and its application to induction and redundancy. Artificial Intelligence, 36(2):149-176, 1988.
    • (1988) Artificial Intelligence , vol.36 , Issue.2 , pp. 149-176
    • Buntine, W.1
  • 7
  • 10
    • 33646188991 scopus 로고    scopus 로고
    • Learning in clausal logic: A perspective on inductive logic programming
    • A.C. Kakas and F. Sadri, editors, Computational Logic: Logic Programming and Beyond, Springer
    • P. Flach and N. Lavrač. Learning in Clausal Logic: A Perspective on Inductive Logic Programming. In A.C. Kakas and F. Sadri, editors, Computational Logic: Logic Programming and Beyond, volume 2407 of Lecture Notes in Computer Science, pages 437-471. Springer, 2002.
    • (2002) Lecture Notes in Computer Science , vol.2407 , pp. 437-471
    • Flach, P.1    Lavrač, N.2
  • 11
    • 0026151736 scopus 로고
    • The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning
    • A.M. Frisch. The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning. Artificial Intelligence, 49:161-198, 1991.
    • (1991) Artificial Intelligence , vol.49 , pp. 161-198
    • Frisch, A.M.1
  • 12
    • 84949226359 scopus 로고    scopus 로고
    • Sorted downward refinement: Building background knowledge into a refinement operator for inductive logic programming
    • S. Dzeroski and P. Flach, editors, Inductive Logic Programming, Springer
    • A.M. Frisch. Sorted downward refinement: Building background knowledge into a refinement operator for inductive logic programming. In S. Dzeroski and P. Flach, editors, Inductive Logic Programming, volume 1634 of Lecture Notes in Artificial Intelligence, pages 104-115. Springer, 1999.
    • (1999) Lecture Notes in Artificial Intelligence , vol.1634 , pp. 104-115
    • Frisch, A.M.1
  • 13
    • 9444264553 scopus 로고
    • Thoughts and afterthoughts on the 1988 workshop on principles of hybrid reasoning
    • A.M. Frisch and A.G. Cohn. Thoughts and afterthoughts on the 1988 workshop on principles of hybrid reasoning. AI Magazine, 11(5):84-87, 1991.
    • (1991) AI Magazine , vol.11 , Issue.5 , pp. 84-87
    • Frisch, A.M.1    Cohn, A.G.2
  • 15
    • 7044240764 scopus 로고    scopus 로고
    • Learnability of description logic programs
    • S. Matwin and C. Sammut, editors, Inductive Logic Programming, Springer
    • J.-U. Kietz. Learnability of description logic programs. In S. Matwin and C. Sammut, editors, Inductive Logic Programming, volume 2583 of Lecture Notes in Artificial Intelligence, pages 117-132. Springer, 2003.
    • (2003) Lecture Notes in Artificial Intelligence , vol.2583 , pp. 117-132
    • Kietz, J.-U.1
  • 16
    • 0032156942 scopus 로고    scopus 로고
    • Combining horn rules and description logics in CARIN
    • A.Y. Levy and M.-C. Rousset. Combining Horn rules and description logics in CARIN. Artificial Intelligence, 104:165-209, 1998.
    • (1998) Artificial Intelligence , vol.104 , pp. 165-209
    • Levy, A.Y.1    Rousset, M.-C.2
  • 17
    • 22944460204 scopus 로고    scopus 로고
    • Efficient evaluation of candidate hypotheses in Aℒ-log
    • R. Camacho, R. King, and A. Srinivasan, editors, Inductive Logic Programming, Springer
    • F.A. Lisi and F. Esposito. Efficient Evaluation of Candidate Hypotheses in Aℒ-log. In R. Camacho, R. King, and A. Srinivasan, editors, Inductive Logic Programming, volume 3194 of Lecture Notes in Artificial Intelligence, pages 216-233. Springer, 2004.
    • (2004) Lecture Notes in Artificial Intelligence , vol.3194 , pp. 216-233
    • Lisi, F.A.1    Esposito, F.2
  • 18
    • 7444259548 scopus 로고    scopus 로고
    • Bridging the gap between horn clausal logic and description logics in inductive learning
    • A. Cappelli and F. Turini, editors, AI*IA 2003: Advances in Artificial Intelligence, Springer
    • F.A. Lisi and D. Malerba. Bridging the Gap between Horn Clausal Logic and Description Logics in Inductive Learning. In A. Cappelli and F. Turini, editors, AI*IA 2003: Advances in Artificial Intelligence, volume 2829 of Lecture Notes in Artificial Intelligence, pages 49-60. Springer, 2003.
    • (2003) Lecture Notes in Artificial Intelligence , vol.2829 , pp. 49-60
    • Lisi, F.A.1    Malerba, D.2
  • 19
    • 9444223349 scopus 로고    scopus 로고
    • Ideal refinement of descriptions in Aℒ-log
    • T. Horvath and A. Yamamoto, editors, Inductive Logic Programming, Springer
    • F.A. Lisi and D. Malerba. Ideal Refinement of Descriptions in Aℒ-log. In T. Horvath and A. Yamamoto, editors, Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 215-232. Springer, 2003.
    • (2003) Lecture Notes in Artificial Intelligence , vol.2835 , pp. 215-232
    • Lisi, F.A.1    Malerba, D.2
  • 20
    • 22944475382 scopus 로고    scopus 로고
    • Inducing multi-level association rules from multiple relations
    • F.A. Lisi and D. Malerba. Inducing Multi-Level Association Rules from Multiple Relations. Machine Learning, 55:175-210, 2004.
    • (2004) Machine Learning , vol.55 , pp. 175-210
    • Lisi, F.A.1    Malerba, D.2
  • 21
    • 21944442464 scopus 로고    scopus 로고
    • Levelwise search and borders of theories in knowledge discovery
    • H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
    • (1997) Data Mining and Knowledge Discovery , vol.1 , Issue.3 , pp. 241-258
    • Mannila, H.1    Toivonen, H.2
  • 22
    • 0019004898 scopus 로고
    • Equality and domain closure in first order databases
    • R. Reiter. Equality and domain closure in first order databases. Journal of ACM, 27:235-249, 1980.
    • (1980) Journal of ACM , vol.27 , pp. 235-249
    • Reiter, R.1
  • 23
    • 21244492715 scopus 로고    scopus 로고
    • On the decidability and complexity of integrating ontologies and rules
    • to appear
    • R. Rosati. On the decidability and complexity of integrating ontologies and rules. Journal of Web Semantics, 2005. to appear.
    • (2005) Journal of Web Semantics
    • Rosati, R.1
  • 24
    • 84954444436 scopus 로고    scopus 로고
    • Towards learning in CARIN-AℒN
    • J. Cussens and A. Frisch, editors, Inductive Logic Programming, Springer
    • C. Rouveirol and V. Ventos. Towards Learning in CARIN-AℒN. In J. Cussens and A. Frisch, editors, Inductive Logic Programming, volume 1866 of Lecture Notes in Artificial Intelligence, pages 191-208. Springer, 2000.
    • (2000) Lecture Notes in Artificial Intelligence , vol.1866 , pp. 191-208
    • Rouveirol, C.1    Ventos, V.2
  • 25
    • 0026107613 scopus 로고
    • Attributive concept descriptions with complements
    • M. Schmidt-Schauss and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48(1):1-26, 1991.
    • (1991) Artificial Intelligence , vol.48 , Issue.1 , pp. 1-26
    • Schmidt-Schauss, M.1    Smolka, G.2
  • 26
    • 84947904538 scopus 로고    scopus 로고
    • A logic framework for the incremental inductive synthesis of Datalog theories
    • N.E. Fuchs, editor, Proceedings of 7th International Workshop on Logic Program Synthesis and Transformation, Springer
    • G. Semeraro, F. Esposito, D. Malerba, N. Fanizzi, and S. Ferilli. A logic framework for the incremental inductive synthesis of Datalog theories. In N.E. Fuchs, editor, Proceedings of 7th International Workshop on Logic Program Synthesis and Transformation, volume 1463 of Lecture Notes in Computer Science, pages 300-321. Springer, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1463 , pp. 300-321
    • Semeraro, G.1    Esposito, F.2    Malerba, D.3    Fanizzi, N.4    Ferilli, S.5


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