Contradiction removal within well founded semantics

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Downloads (Pure)

Abstract

Our purpose is to define a semantics that extends Well Founded Semantics for programs with classical negation, and which avoids the absence of models caused by contradictions brought about by closed world assumptions. This extension relies on allowing to take back such closed world assumptions, through making their truth value become undefined, and thus permiting noncontradictory models to appear. We take back such assumptions in a minimal way for all alternative ways of removing contradictions, by means of simple transformations of the original program. The transformed programs have contradiction free Well Founded Models. Moreover, we identify a unique model that defines the semantics of the original program, which is included in all the alternative contradiction free models. This unique model coincides with the Well Founded Model when the latter is noncontradictory. The notions of minimality and contradiction removal employed are useful for dealing with Belief Revision. These techniques for removing contradiction in the sense of integrity constraints violation. Another important result is that our removal semantics (the contradiction removal semantivs) is defined as the Well Founded Model of a derived program obtained by simple transformation from the original one. Thus no new model determining algorithms are needed. For noncontradictory programs the two programs coincide.
Original languageEnglish
Title of host publicationMIT Press
Pages105-119
Number of pages15
Publication statusPublished - Apr 1999
EventLOGIC PROGRAMMING AND NON-MONOTONIC REASONING -
Duration: 1 Jan 1991 → …

Conference

ConferenceLOGIC PROGRAMMING AND NON-MONOTONIC REASONING
Period1/01/91 → …

Fingerprint Dive into the research topics of 'Contradiction removal within well founded semantics'. Together they form a unique fingerprint.

  • Cite this