W3C home > Mailing lists > Public > www-rdf-rules@w3.org > September 2001

RE: Expressiveness of RDF as Rule Conclusion Language (was Re: W hat is an RDF Query? )

From: Wagner, G.R. <G.R.Wagner@tm.tue.nl>
Date: Wed, 26 Sep 2001 19:55:08 +0200
Message-ID: <511BB18E82E9D11188230008C724064602D9DDE9@tmex1.tm.tue.nl>
To: www-rdf-rules@w3.org
> >, there is absolutely no
> >need to do so. It is conceptually much more adequate (more
> >natural and more general) to view the inference process as
> >being based on simple rule application (detachment).
> 
> This has its own problems and limitations, however. It confuses 
> 'rule' in the sense of inference rule, with 'rule' in the sense of an 
> implication; 

I believe that most people working in the area of logic 
programming (and deductive database) semantics consider 
logic programming rules as inference rules and not as
implications. 

The intended (i.e. stable) models of a rule [P if not Q]
are not the same as the intended models of the corresponding
material implication [not Q -> P] = [P v Q].

-Gerd

---------------------------------------
Gerd Wagner  
http://tmitwww.tm.tue.nl/staff/gwagner/
Dep. Information & Technology 
Eindhoven University of Technology  
Email: G.Wagner@tm.tue.nl 
Phone: (+31 40) 247 26 17  
Fax: (+31 40) 247 26 12
Received on Wednesday, 26 September 2001 13:55:11 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:53:09 GMT