Dear Scientific Community;
I would appreciate your explanation regarding the below questions. Appreciate your advice.
Are there any online/offline tools available to convert RDF or OWL ontology to First-Order Logic Format (FOL)?
There are lots of papers on using FOL for reasoning purposes even in the semantic web. How this is done without converting RDF or OWL to FOL representations?
Is there any mechanism available to do this conversion directly?
Thanking all of you in advance.
Kind Regards
Dear Kaneeka,
RDF is just a representation format. Each triple could be represented as a Predicate(Subject,Object), but that's it already. There is neither a model-theoretical interpretation nor an reasoning procedure.
For RDFS there exist reasoning procedures and it should have some translation into a subset of FOL. But I am not aware of a translation procedure.
OWL can be translated into a subset of FOL. It has a model-theroretic interpretation in set-theory and there exists, specialized reasoning procedures for: classification, consistency checking and instance realization (finding the concept an instance belongs too).
Hope this helps a bit
Thomas
Dear Kaneeka,
RDF is just a representation format. Each triple could be represented as a Predicate(Subject,Object), but that's it already. There is neither a model-theoretical interpretation nor an reasoning procedure.
For RDFS there exist reasoning procedures and it should have some translation into a subset of FOL. But I am not aware of a translation procedure.
OWL can be translated into a subset of FOL. It has a model-theroretic interpretation in set-theory and there exists, specialized reasoning procedures for: classification, consistency checking and instance realization (finding the concept an instance belongs too).
Hope this helps a bit
Thomas
Hi,
Actually, there's no need for conversions.
As for RDF reasoning rules can be provided to reason with that data model.
E.g. see https://www.w3.org/standards/semanticweb/inference
OWL is backed by Description Logics. Hence. there are DL reasoners, generally based on tableaux algorithms, and endowed with specific optimizations, that one may use.
See the DL Home http://www.dl.kr.org/
Note that some constructs have no FOL correspondence (e.g. TransitiveObjectProperty)
all the best
- Badges
- Science topic
- Similar topics
- Papers