On 5/6/07, Benjamin Goertzel <[EMAIL PROTECTED]> wrote:
We have created a workable probabilistic first and higher order logic
system, and implemented
and tested a substantial part of it. I agree that it's a significant step forward ;-) We will publish a book on this in the near future, entitled Probabilistic
Logic Networks. That's good to hear, but I'll have to read the book to believe it =) 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. Also, how efficient is the inference algorithm, as compared to first-order resolution (for binary logic)? Is the algorithm somewhat analogous to resolution? 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. YKY ----- 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
