On Sun, Sep 16, 2007 at 10:23:08PM -0500, Chris Menzel wrote:
> ...But that isn't to say that nothing can be done
> within those limitations if a problem turns out to be NP-complete or
> even (in general) undecidable -- consider, e.g., full first-order
> reasoners like Otter. (01)
Or, I should have added, Randall Schulz's powerful Tau theorem prover
(which implements a dialect of Common Logic). (02)
-chris (03)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Subscribe/Config: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx (04)
|