Content deleted Content added
m →Implementations: {{Free}} |
|||
Line 94:
== Implementations ==
Caveat: Reasoners do not support the full specification because the reasoning becomes undecidable.
There can be three types of approach: # translate SWRL into First Order Logic (Hoolet) and demonstrate reasoning tasks with a theorem prover; # translate OWL-DL into rules and give the rules to a forward chaining engine (Bossam) (this approach cannot cover the full expressivity of OWL-DL due to many incompatibilities between Description Logic and Horn Rule formalisms) # expand an existing OWL-DL reasoner based on the tableaux algorithm (Pellet). {{Expand section|date=January 2007}}
|