.png){kind=icon}
Return
LINEAR RESOLUTION FOR CONSEQUENCE FINDING
.png){kind=icon}
PRE
AI
DOI：10.1016/0004-3702(92)90030-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
CIRCUMSCRIPTION
ASSUMPTION
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveEffects of plasma diameter and operating frequency on dynamic behaviour of induction thermal plasma
PREAI
ShareSaveQuantification of the scavenger capacity of different flavonoids with regard to the superoxide ion
PREAI
ShareSaveMechanical Refrigeration Dehumidifier Performance Evaluation in a Tomato Greenhouse in Cold Regions
PREAI
ShareSaveShareSave
View more