On 8/13/08, Ben Goertzel <[EMAIL PROTECTED]> wrote: > > But if one doesn't need to get into implementation details, in the simplest case one just has > > VariableScopeLink X > ImplicationLink > ___ANDLink > ______ InheritanceLink X male > ______ InheritanceLink X Unmarried > ___InheritanceLink X bachelor > > > where X is a Variable Node ... > > Then the Unification Rule combines this with the links > > InheritanceLink John male > InheritanceLink John unmarried > > and the conclusion comes out from one step of the > unification rule.... > > InheritanceLink John bachelor > > > But I'm not sure that's what you're asking ... and note that the > intension'extension distinction is getting swept behind the scenes here, > into the definition of InheritanceLink...
Thanks, I guess I'll wait for the better documentation. I'm just wondering, how could your inference be efficient, if the mechanism is so complicated. You know, optimization is very difficult even for simpler logic-based systems such as Cyc and Soar. Soar has a special algorithm called "rete" that specifically deals with rule-fetching. One option for us, is to merge my PZ (probabilistic-fuzzy) logic with your PLN, on the declarative side. Then I can help design the ILP on that side. I'll send you my paper ASAP... BTW, is your definition of intension-extension the same as Pei Wang's? Or Judea Pearl's? YKY ------------------------------------------- agi Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: https://www.listbox.com/member/?member_id=8660244&id_secret=111637683-c8fa51 Powered by Listbox: http://www.listbox.com
