- From: Peter F. Patel-Schneider <pfps@research.bell-labs.com>
- Date: Thu, 05 Sep 2002 12:23:38 -0400 (EDT)
- To: pfps@research.bell-labs.com
- Cc: www-rdf-rules@w3.org, timbl@w3.org
From: "Peter F. Patel-Schneider" <pfps@research.bell-labs.com> Subject: Re: Is n3 a rules language or a logic language? Date: Thu, 05 Sep 2002 11:59:42 -0400 (EDT) [...] > This is definitely not true. A rules engine with p |- q will not conclude > anything from not q whereas a complete reasoner for the propositional > calculus will conclude not b from not a and a implies b. As pointed out my Wolfram Conen, I mispoke here It should be > calculus will conclude not a from not b and a implies b. peter
Received on Thursday, 5 September 2002 12:23:55 UTC