Is it the same as Matthew Ikle's theory? I saw his PowerPoint but I don't understand what he meant by "probability envelope" etc.
The theory of indefinite probabilities, which is in that powerpoint, is a small part of PLN... Also, how efficient is the inference algorithm, as compared to first-order
resolution (for binary logic)? Is the algorithm somewhat analogous to resolution?
We use forward and backward chaining inference, but, the heuristic inference tree pruning algorithms are different for PLN than for standard non-probabilistic theorem-provers. I think it would be a good thing if PLN has a high resemblance to binary
logic, because we need to convert many classical algorithms to the new logic, eg induction, abduction, and belief revision.
These and other standard logical inference types are all handled in PLN. -- Ben ----- This list is sponsored by AGIRI: http://www.agiri.org/email To unsubscribe or change your options, please go to: http://v2.listbox.com/member/?member_id=231415&user_secret=fabd7936
