Rough Description Logic Programs

Abstract

The Semantic Web is an extension of the current World Wide Web, and aims to help computers to understand and process web information automatically. In recent years, the integration ontologies and rules has become a central topic in the Semantic Web. Therefore, many researchers have focused their study on investigating the combination of answer set programming with description logics for the semantic web. However, these can not deal with uncertainty and inexactness. To address this problem, we propose tightly coupled rough description logic programs (or simply rough dl-programs) under the answer set semantics, which can model uncertain, inexact information, and can deal with non monotonic reasoning at the same time. To our knowledge, this is the first such approach. First of all, we define the syntax and semantics of rough dl-program KB= ( L,P ), which is a tight integration of disjunctive logic program under the answer set semantics, rough set theory and rough description logic. Then, we present some reasoning problems of rough dl-program. Finally, we show some semantic properties of rough dl-program under the answer set semantics.