Logic Programming for Non-monotonic Reasoning

Our purpose is to exhibit a modular systematic method of representing nonmonotonic reasoning problems with the Well Founded Semantics of extended logic programs aumented with eXplicit negation (WFSX ), augmented by its Contradiction Removal Semantics (CRSX ) when needed. We show how to cast in the language of such logic programs forms of non-monotonic reasoning like defeasible reasoning and hypothetical reasoning and apply them to different domains of knowledge representation, for instance hierarchies and reasoning about actions. We then abstract a modular systematic method of representing non-monotonic problems in logic programming