Contradiction: When avoidance equals removal part II

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)


This paper is the continuation of [1] in this volume. There we present a sceptical semantics which avoids contradiction for extended logic programs plus integrity contraints in the form of denials, based on the notion of optative hypotheses -an abductive approach. In this part we define a program revision method for removing contradiction from contradictory programs under WFSX, based on the notion of revisable hypotheses -a belief revision approach- and show the equivalence be­tween the contradiction avoidance semantics and the WFSX of revised programs obtained by contradiction removal. The motivation, as well as some preliminary definitions can be found in [1], Proofs of all theorems are omitted for brevity, but exist in an extended version of this work.

Original languageEnglish
Title of host publicationExtensions of Logic Programming - 4th International Workshop, ELP 1993, Proceedings
EditorsRoy Dyckhoff
Place of PublicationBerlin, Heidelberg
Number of pages14
ISBN (Electronic)978-3-540-48417-2
ISBN (Print)978-3-540-58025-6
Publication statusPublished - 1994
Event4th International Workshop on Extensions of Logic Programming, ELP 1993 - St Andrews, United Kingdom
Duration: 29 Mar 19931 Apr 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher Springer
Volume798 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference4th International Workshop on Extensions of Logic Programming, ELP 1993
Country/TerritoryUnited Kingdom
CitySt Andrews


Dive into the research topics of 'Contradiction: When avoidance equals removal part II'. Together they form a unique fingerprint.

Cite this