.png){kind=icon}
Return
REDUCTION RULES FOR RESOLUTION-BASED SYSTEMS
.png){kind=icon}
PRE
AI
DOI：10.1016/0004-3702(91)90098-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
CONNECTION GRAPHS
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}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more