The world of the Semantic Web includes many inconsistent knowledge bases, whose axioms are often unreliable and can therefore be naturally interpreted as defaults. In this article we introduce an extension of Sengupta et. al.'s semantics  with a preference order on the defaults with respect to satisfaction. In particular, the semantics we propose is an improved version of Heymans et. al.'s semantics  for a defeasible ontology language. One crucial difference we adopt is that the preference relation between interpretations is not only defined with respect to the same individuals, but any. We provide an algorithm to translate the entailment problem with respect to ordered default knowledge bases to the one for classical knowledge bases, and show its soundness and completeness. As a practical application scenario, we test our algorithm on various subsets of LOD Cloud, and report on our result.