Rules with Contextually Scoped Negation

Knowledge representation formalisms used on the Semantic Web adhere to a strict open world assumption. Therefore, nonmonotonic reasoning techniques are often viewed with scepticism. Especially negation as failure, which intuitively adopts a closed world view, is often claimed to be unsuitable for the Web where knowledge is notoriously incomplete. Nonetheless, it was suggested in the ongoing discussions around rules extensions for languages like RDF(S) or OWL to allow at least restricted forms of negation as failure, as long as negation has an explicitly defined, finite scope. Yet clear definitions of such "scoped negation" as well as formal semantics thereof are missing. We propose logic programs with contexts and scoped negation and discuss two possible semantics with desirable properties. We also argue that this class of logic programs can be viewed as a rule extension to a subset of RDF(S).

• Type: Conference
• Year: 2006
• Where: ESWS
• Authors: Axel Polleres, Cristina Feier, Andreas Harth
• Keywords: ESWS 2006, Internet Technology, Negation, Nonmonotonic Reasoning Techniques, Scoped Negation