We develop actual inference algorithms for both data - dependent and data - independent disclosures for a highly expressive family of horn - clause constraints
In this thesis , the author just discusses horn clause sets , and gives how to transform horn clause set into neural network . go a step further , the author discusses how to get the learning algorithm of neural network that is equivalence with resolution principle , and proves completeness theorem and soundness theorem of the algorithm for resolution
手机版