Typed Unification based on OWL

Abstract

Unification is an elemental technique that is commonly used for reasoning in First-Order Logic systems, logic\nlanguages, and planners, etc. When we develop applications equipped with ontologies described in OWL, the\nunification between variables and individuals typed to OWL classes is required. In this paper, we extend conventional\ntype-less unification to OWL typed unification. Since the data structure and variable binding mechanism is\nshared by tableau, satisfiability checking by tableau in OWL is naturally and intrinsically realized in the unification\nprocess. This technique will be useful to logics on top of the OWL layer.