Abstract
In this paper general mechanisms and syntactic restrictions are explored in order to specify and merge rule bases in the Semantic Web. Rule bases are expressed by extended logic programs having two forms of negation, namely strong (or explicit) and weak (also known as default negation or negation-as-failure). The proposed mechanisms are defined by very simple modular program transformations, and integrate both open and closed world reasoning. These program transformations are shown to be appropriate for the two major semantics for extended logic programs: answer set semantics and well-founded semantics with explicit negation. Moreover, the results obtained by both semantics are compared.

URL:
http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2006-051

BibTeX:

@inproceedings{REWERSE-RP-2006-051,
	author = {Carlos Viegas Damásio and Anastasia Analyti and Grigoris Antoniou and Gerd Wagner},
	title = {Supporting Open and Closed World Reasoning on the Web},
	booktitle = {Proceedings of 4th Workshop on Principles and Practice of Semantic Web Reasoning, Budva, Montenegro (10th--11th June 2006)},
	year = {2006},
	volume = {4187},
	organization = {REWERSE},
	series = {LNCS},
	pages = {149--163},
	url = {http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2006-051}
}