返回
摘要
En 中文
Three different formalizations of concept-learning in logic (as well as some variants) are analyzed and related. It is shown that learning from interpretations reduces to learning from entailment, which in rum reduces to learning from satisfiability. The implications of this result for inductive logic programming and computational learning theory are then discussed, and guidelines for choosing a problem-setting are formulated. (C) 1997 Elsevier Science B.V.
Keyword:
inductive logic programming
computational learning theory
concept-learning
logic
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
引用论文
Identification of Residues in the N-Terminal Acidic Domain of HIV-1 Vpr Essential for Virion Incorporation
Virology
IF0

