.png){kind=icon}
返回
LINEAR RESOLUTION FOR CONSEQUENCE FINDING
.png){kind=icon}
PRE
AI
DOI：10.1016/0004-3702(92)90030-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we re-evaluate the consequence finding problem within first-order logic. Firstly, consequence finding is generalized to the problem in which only interesting clauses having a certain property (called characteristic clauses) should be found. The use of characteristic clauses enables characterization of various reasoning problems of interest to AI, including abduction, nonmonotonic reasoning, prime implicates and truth maintenance systems. Secondly, an extension of the Model Elimination theorem proving procedure (SOL-resolution) is presented, providing an effective mechanism complete for finding the characteristic clauses. An important feature of SOL-resolution is that it constructs such a subset of consequences directly without testing each generated clause for the required property. We also discuss efficient but incomplete variations of SOL-resolution and their properties, which address finding the most specific and the least specific abductive explanations.
Keyword:
CIRCUMSCRIPTION
ASSUMPTION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
引用论文
.png){kind=icon}
Effects of plasma diameter and operating frequency on dynamic behaviour of induction thermal plasma
PREAI
分享收藏Quantification of the scavenger capacity of different flavonoids with regard to the superoxide ion
PREAI
分享收藏Mechanical Refrigeration Dehumidifier Performance Evaluation in a Tomato Greenhouse in Cold Regions
PREAI
分享收藏分享收藏
查看更多内容