Ben or anyone, Do you know of an explanation or reference that is a for Dummies explanation of how SAT (or SMT) handles computations in spaces with and 100,000 variables and/or 10^300 states in practically computable time.
I assume it is by focusing only on that part of the space through which relevant and/or relatively short inferences paths pass, or something like that. Ed Porter -----Original Message----- From: Ben Goertzel [mailto:[EMAIL PROTECTED] Sent: Wednesday, February 20, 2008 5:54 PM To: [email protected] Subject: Re: [agi] would anyone want to use a commonsense KB? > And I seriously doubt that a general SMT solver + > prob. theory is going to beat a custom probabilistic logic solver. My feeling is that an SMT solver plus appropriate subsets of prob theory can be a very powerful component of a general probabilistic inference framework... I can back this up with some details but that would get too thorny for this list... 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/?&; Powered by Listbox: http://www.listbox.com ------------------------------------------- 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=95818715-a78a9b Powered by Listbox: http://www.listbox.com
