- From: Drew McDermott <drew.mcdermott@yale.edu>
- Date: Thu, 6 Nov 2003 17:24:18 -0500 (EST)
- To: www-rdf-interest@w3.org, www-rdf-logic@w3.org
Sorry, in the last two lines of my previous message I presupposed that
SAT was undecidable; obviously, I meant "NP-complete." Maybe that
isn't so obvious....
--
-- Drew McDermott
Yale University CS Dept.
Received on Thursday, 6 November 2003 17:26:11 UTC