On 2/25/08, Ben Goertzel <[EMAIL PROTECTED]> wrote: > Hi, > > There is no good overview of SMT so far as I know, just some technical > papers... but SAT solvers are not that deep and are well reviewed in > this book... > > http://www.sls-book.net/
But that's *propositional* satisfiability, the results may not extend to first-order SAT -- I've no idea. Secondly, the learning of an entire KB from text corpus is much, much harder than SAT. Even the learning of a single hypothesis from examples with background knowledge (ie the problem of inductive logic programming) is harder than SAT. Now you're talking about inducing the entire KB, and possibly involving "theory revision" -- this is VERY impractical. I guess I'd focus on learning simple rules, one at a time, from NL instructions. IMO this is one of the most feasible ways of acquiring the AGI KB. But it also involves the AGI itself in the acquisition process, not just a passive collection of facts like MindPixel... YKY ------------------------------------------- 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
