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.

URL:
http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2005-102

BibTeX:

@inproceedings{REWERSE-RP-2005-102,
	author = {Kewen Wang and Grigoris Antoniou and Rodney Topor and Abdul Sattar},
	title = {Merging and aligning ontologies in dl-Programs},
	booktitle = {Proceedings of International Conference on Rules and Rule Markup Languages for the Semantic Web, Galway, Ireland (10th--12th November 2005)},
	year = {2005},
	volume = {3791},
	series = {LNCS},
	pages = {160--171},
	url = {http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2005-102}
}