@inproceedings{ac52c30af31b4c7ab6f3d2c32ea58d57,
title = "Contradiction: When avoidance equals removal part II",
abstract = "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 between 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.",
author = "Pereira, {Lu{\'i}s Moniz} and Alferes, {Jos{\'e} J{\'u}lio}",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 4th International Workshop on Extensions of Logic Programming, ELP 1993 ; Conference date: 29-03-1993 Through 01-04-1993",
year = "1994",
doi = "10.1007/3-540-58025-5_61",
language = "English",
isbn = "978-3-540-58025-6",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "268--281",
editor = "Roy Dyckhoff",
booktitle = "Extensions of Logic Programming - 4th International Workshop, ELP 1993, Proceedings",
address = "Netherlands",
}