Merging and Aligning Ontologies in dl-Programs

Abstract. The language of dl-programs is a latest effort in developing an expressive representation for Web-based ontologies. It allows to build answer set programming (ASP) on top of description logic and thus some attractive features of ASP can be employed in the design of the Semantic Web architecture. In this paper we first generalize dl-programs by allowing multiple knowledge bases and then accordingly, define the answer set semantics for the dl-programs. A novel technique called forgetting is developed in the setting of dl-programs and applied to ontology merging and aligning.

• Type: Conference
• Year: 2005
• Where: RULEML
• Authors: Kewen Wang, Grigoris Antoniou, Rodney W. Topor, Abdul Sattar
• Keywords: Answer Set, Answer Set Programming, Answer Set Semantics, RULEML 2005