.png){kind=icon}
返回
REDUCTION RULES FOR RESOLUTION-BASED SYSTEMS
.png){kind=icon}
PRE
AI
DOI：10.1016/0004-3702(91)90098-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Inference rules for resolution-based systems can be classified into deduction rules, which add new objects, and reduction rules, which remove objects. Traditional reduction rules like subsumption do not actively contribute to a solution, but they help to avoid redundancies in the search space. We present a number of advanced reduction rules, which can cope with high degrees of redundancy and play a distinctly active part because they find trivial solutions on their own and thus relieve the control component for the deduction rules from low level tasks. We describe how these reduction rules can be implemented with reasonable efficiency in a clause graph resolution system, but they are not restricted to this particular representation.
Keyword:
CONNECTION GRAPHS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容