## Typed Hybrid Description Logic Programs with Order-Sorted Semantic Web Type Systems based on (2006)

Venue: | University Munich |

Citations: | 13 - 6 self |

### BibTeX

@TECHREPORT{Paschke06typedhybrid,

author = {Adrian Paschke},

title = {Typed Hybrid Description Logic Programs with Order-Sorted Semantic Web Type Systems based on},

institution = {University Munich},

year = {2006}

}

### OpenURL

### Abstract

Abstract. In the recent years rule-based programming in terms of declarative logic programming has formed the basis for many Artificial Intelligence (AI) applications and is well integrated in the mainstream information technology capturing higher-level decision logics. Typically, the standard rule systems and rule-based logic programming languages such as Prolog derivatives are based on the untyped theory of predicate calculus with untyped logical objects (untyped terms), i.e. the logical reasoning algorithms apply pure syntactical reasoning. From a rule engineering perspective this is a serious restriction which lacks major Software Engineering principles such as data abstraction or modularization, which become more and more important when rule applications grow larger and more complex. To support such principles in logic programming and capture the rule engineer’s intended meaning of a logic program, types and typed objects play an important role. Moreover, from a computational point of view, the use of types drastically reduces the search space, i.e. proofs can be kept at a more abstract level and it offers the option to restrict the application of rules and to