.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
We extend the notion of anti-unification to cover equational theories and present a method based on regular tree grammars to compute a finite representation of E-generalization sets. We present a framework to combine Inductive Logic Programming and E-generalization that includes an extension of Plotkin's lgg theorem to the equational case. We demonstrate the potential power of E-generalization by three example applications: computation of suggestions for auxiliary lemmas in equational inductive proofs, computation of construction laws for given term sequences, and learning of screen editor command sequences. (c) 2005 Elsevier B.V. All rights reserved.
Keyword:
equational theory
generalization
inductive logic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
引用论文
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏Inductive logic programming: Issues, results and the challenge of learning language in logic归纳逻辑编程: 学习逻辑语言的问题，结果和挑战.png)
PREAI
分享收藏 没有更多内容
没有更多内容