- From: Seth Russell <seth@robustai.net>
- Date: Thu, 30 May 2002 10:34:55 -0700
- To: <bwm@hplb.hpl.hp.com>, "Peter F. Patel-Schneider" <pfps@research.bell-labs.com>
- Cc: <www-rdf-comments@w3.org>, <em@w3.org>, <w3c-semweb-cg@w3.org>
From: "Peter F. Patel-Schneider" <pfps@research.bell-labs.com> > Case 1: > Does: > > <ex:John> <ex:loves> <ex:Mary> . > > <_:s1> <rdf:type> <rdf:Statement> . > <_:s1> <rdf:subject> <var:?x> . > <_:s1> <rdf:predicate> <ex:loves> . > <_:s1> <rdf:object> <var:?y> . > > <_:s2> <rdf:type> <rdf:Statement> . > <_:s2> <rdf:subject> <var:?y> . > <_:s2> <rdf:predicate> <ex:loves> . > <_:s2> <rdf:object> <var:?x> . > > <_:s1> <log:implies> <_:s2> . > > Universally-Entail > > <ex:Mary> <ex:loves> <ex:John> . Let's put it this way: We could construct an automated agent, called here agentA, which could make that entailment, based upon that graph. To AgentA, that entailment is true. I have no idea what a class of entailments called 'Universal Entailments' would include. Do you? Seth Russell
Received on Thursday, 30 May 2002 13:41:24 UTC