> More likely though, is that your algorithm is incomplete wrt FOL, ie, > there may be some things that FOL can infer but PLN can't. Either > that, or your algorithm may be actually slower than FOL.
FOL is not an algorithm, it:s a representational formalism... As compared to standard logical theorem-proving algorithms, the design intention is that Novamente/OpenCogs inference algorithms will be vastly more efficient on the average case for those inference problems typically confronting an embodied social organism. Ben ------------------------------------------- agi Archives: http://www.listbox.com/member/archive/303/=now RSS Feed: http://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: http://www.listbox.com/member/?member_id=8660244&id_secret=103754539-40ed26 Powered by Listbox: http://www.listbox.com
