Title
Semantic paramodulation for Horn sets
Abstract
We present a new strategy for semantic paramodulation for Horn sets and prove its completeness The strategy requires for each paramoduiation that either both parents be false positive units or that one parent and the paramodulant both be false relative to an interpretation We also discuss some of the issues involved in choosing an interpretation that has a chance of giving better performance that simple set-of-support paramoduiation.
Year
Venue
Keywords
1983
IJCAI
false positive
Field
DocType
Citations 
Computer science,Algorithm,Theoretical computer science,Artificial intelligence,Completeness (statistics),Machine learning
Conference
4
PageRank 
References 
Authors
0.60
8
2
Name
Order
Citations
PageRank
William McCune115045.05
Lawrence J. Henschen2478280.94