Although several proposals to combine description logics with logic programming rules have been brought forward, hardly any of these approaches capture the dymic ture of the Semantic Web. In this paper, we look at an expressive combition formalism, normal DL logic programs, and address changes to the rule component from the viewpoint of belief revision. To deal with inconsistency caused in revising normal DL logic programs, we first introduce a three-valued answer set semantics and present some useful properties. We then develop a revision operator for normal DL logic programs and show that our revision satisfies major postulates for logic program revision.
Web reasoning and rule systems (RR) 2013 (2013)
Unless otherwise indicated, works by Griffith University Scholars are © Griffith University. For further details please refer to the University Intellectual Property Policy.