W3C home > Mailing lists > Public > public-rule-workshop-discuss@w3.org > August 2005

Deductive Closure of a Relation

From: Dieter Fensel <dieter.fensel@deri.org>
Date: Wed, 24 Aug 2005 20:41:08 +0200
Message-Id: <5.2.0.9.0.20050824203009.05164668@mail1.uibk.ac.at>
To: public-rule-workshop-discuss@w3.org

Assume you have

         p(a,b), p(b,c)
         and the following two rules:
         p(x,y) -> q(x,y)
         p(x,y) & p(y,z) -> q(x,z)

Then under minimal model semantics q is the deductive closure
of p, i.e., q(a,b), q(b,c), q(a,c) are true and no other q(x,y) us true.

In FOL, this is different since you cannot exclude models in which
q(a,a) is true. That is, you cannot express deductive closure in FOL.

The difference becomes appeared when you allow negation in your
query language for facts, i.e., when you allow to query for negated
facts [2]

         -- dieter

[2] Michael Kifer, Jos de Bruijn, Harold Boley, Dieter Fensel: A Realistic 
Architecture for the Semantic Web,
to appear in the RuleML Conference Proceedings, Galway, November
2005

----------------------------------------------------------------
Dieter Fensel, http://www.deri.org/
Tel.: +43-512-5076485/8
Received on Wednesday, 24 August 2005 18:41:36 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Tuesday, 8 January 2008 14:16:23 GMT