Re: FOL versus Rule Languages - A tutorial

very helpful Dieter; thanks
[...]
>                "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." [1]

what if (somewhere on the web) it is also the case that
a owl:sameAs b
(it was first order notation with equality)

-- 
Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/