- From: Harry Halpin <hhalpin@ibiblio.org>
- Date: Mon, 27 Sep 2004 15:38:07 -0400 (EDT)
- To: Peter <meancity@gmail.com>
- cc: www-rdf-interest@w3.org, <www-rdf-logic@w3.org>
While we're on the topic....
Is there any way to map from FOL->DL while minimizing expressive
power lost? While I'm being informal with "minimizing expressive power
lost", I mean either:
a) Given a formula \phi, the translated formula T(\phi) should be
logically equivalent to \phi.
b) Given a formula \phi, the translated formula T(\phi) should be
satisfiable iff the formula \phi is satisfiable.
Now, clearly this won't work for all of FOL, but it could for
some statements. And you think there would be ways of going from FOL->DL
that were sensible.
Ian Horrocks had a few simple rules in his FOL vs. DL Reasoner
paper, but I can't find much else in the literature. Anyone got
any ideas or references?
FOL can be useful, see Pat Hayes's note:
ttp://www.aifb.uni-karlsruhe.de/~sst/is/WebOntologyLanguage/hayes.htm
-Harry
On Mon, 27 Sep 2004, Peter wrote:
>
> dear all,
>
> given a sentence like this
> "book has color red"
>
> how can i map it into FOL format
> subject, object, property and property value
> which is which. thank u
> sorry for newbie quesiton.
>
> yours
> peter.
>
>
Received on Monday, 27 September 2004 19:38:20 UTC