A Paraconsistent Semantics with Contradiction Support Detection

@inproceedings{Damsio1997APS,
  title={A Paraconsistent Semantics with Contradiction Support Detection},
  author={Carlos Viegas Dam{\'a}sio and Lu{\'i}s Moniz Pereira},
  booktitle={LPNMR},
  year={1997}
}
We begin by motivating the use of paraconsistency and the detection of contradiction supported conclusions by recourse to examples. Next we overview WFSXP and present its embedding into WFS. We then address the problem of detecting contradiction support and relate it to WFSXp's intrinsic properties. Afterwards, we show how to implement two recent modal contradiction related constructs in the language of extended logic programs in order to gain explicit control of contradiction propagation. We… 
A survey of paraconsistent semantics for logic programs
TLDR
The semantics the authors cover will touch several aspects of implementing reasoning in the presence of contradiction, in preparation for an applicational and implementational role of great potential, now emerging.
Handling Locally Stratified Inconsistent Knowledge Bases
TLDR
This paper investigates the idea of reasoning, in a local (or contextual) way, under prioritized and possibly inconsistent knowledge bases, and proposes natural approaches to restore the coherence of a knowledge base on the basis of influence relations between locally-stratified conflicts.
Efficient paraconsistent reasoning with rules and ontologies for the semantic web
TLDR
A new six-valued semantics for hybrid MKNF knowledge bases is introduced, extending the three-valued approach by Knorr et al., which is based on the wellfounded semantics for logic programs.
Revision based total semantics for extended normal logic programs
Dissertacao para obtencao do Grau de Doutor em Matematica - Logica e Fundamentos da Matematica
Negation and negative information in the W3C resource description framework
TLDR
Any practical knowledge representation formalism, especially for the Web, has to be able to deal with knowledge items involving partial predicates for which negative information is as informative as positive information, and which may havetruth-value gaps and truth-value clashes.
Paraconsistent OWL and related logics
TLDR
Four-valued paraconsistent description logics which can reason over inconsistencies are presented and the general framework described here has the distinct advantage of allowing classical reasoners to draw sound but nontrivial conclusions from even inconsistent knowledge bases.
Semantic Web Logic Programming Tools
The last two decades of research in Logic Programming, both at the theoretical and practical levels, have addressed several topics highly relevant for the Semantic Web effort, providing very concrete
Revising Undefinedness in the Well-Founded Semantics of Logic Programs

References

SHOWING 1-10 OF 49 REFERENCES
Extended Well-Founded Semantics for Paraconsistent Logic Programs
TLDR
A declarative semantics of logic programs which possibly contain inconsistent information is presented and the extended well-founded semantics for paraconsistent logic programs is extended to disjunctive paracons consistent logic programs.
Contradiction Removal within Well Founded Semantics
TLDR
The purpose is to deene 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 through making their truth value become undeened, and thus permiting noncontradictory models to appear.
Diagnosis and Debugging as Contradiction Removal in Logic Programs
We apply to normal logic programs with integrity rules a contradiction removal approach, and use it to uniformly treat diagnosis and debugging, and as a matter of fact envisage programs as artifacts
Paraconsistent Stable Semantics for Extended Disjunctive Programs
TLDR
The paraconsistent minimal and stable model semantics for extended disjunctive programs, which can distinguish inconsistent information from other information in a program, are introduced.
Reasoning with Inconsistency in Extended Deductive Databases
TLDR
It is shown that there are at least three different neutralization-based calculi for XDBs with varying degree of skepticism towards the reliability of possibly inconsistent information, called skeptical, conservative and credulous, which constitute interesting options in database reasoning.
Paraconsistent logics
TLDR
This chapter discusses the need to derive reasonable inferences without deriving the trivial inferences that follow the ex falso quodlibet proof rule that holds in classical logic.
Reasoning with Negative Information, II: Hard Negation, Strong Negation and Logic Programs
  • David Pearce
  • Computer Science, Philosophy
    Nonclassical Logics and Information Processing
  • 1990
TLDR
It is shown that a certain system of constructive logic with strong negation, due to Lopez-Escobar (1972) and Almukdad & Nelson (1984), fulfils this criterion, as do several recent systems of logic programming, including that of Gelfond & Lifschitz (1990).
A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties
  • J. Dix
  • Computer Science
    Fundam. Informaticae
  • 1995
TLDR
This article presents a method for classifying and characterizing the various different semantics of logic programs with negation and shows that the 3-valued version COMP 3 of Clark's completion, the stratified semantics M supp P as well as the well-founded semantics WFS and two extensions of it behave very regular.
Well-Founded Semantics, Generalized
TLDR
It is shown how the well-founded approach also extends naturally to the same family of bilattice-based programming languages that the earlier fixpoint approaches extended to, and provides a natural semantics for logic programming systems that have already been proposed.
Reasoning with Logic Programming
TLDR
WFSX is a new semantics for extended logic programs that combines LP semantics with two negations, and autoepistemic logics to deal with contradiction.
...
...