This paper investigates the satisfaction of the Non-Contradiction Law (NC) within the domain of aggregation operators. It provides characterizations both for those aggregation operators that satisfy NC with respect to (w.r.t.) some given strong negation, as well as for those satisfying the law w.r.t. any strong negation. The results obtained are applied to some of the most important known class...

For inference purposes in both classical and fuzzy logic, neither the information itself should be contradictory, nor should any of the items of available information contradict each other. In order to avoid these troubles in fuzzy logic, a study about contradiction was initiated by Trillas et al. in [5] and [6]. They introduced the concepts of both self-contradictory fuzzy set and contradictio...

Access-Limited Logic (ALL) is a language for knowledge representation which formalizes the access limitations inherent in a network structured knowledge-base. Where a deductive method such as resolution would retrieve all assertions that satisfy a given pattern, an access-limited logic retrieves all assertions reachable by following an available access path. In this paper, we extend previous wo...

Solving conflicts between overlapping databases requires an understanding of the reasons that lead to the inconsistencies. Provided that conflicts do not occur randomly but follow certain regularities, patterns in the form of ”If condition Then conflict” provide a valuable means to facilitate their understanding. In previous work, we adopt existing association rule mining algorithms to identify...

In most expert systems, efforts are made to keep the rules in the knowledge base free from contradictions., because a logical system that generates even a single contradiction may collapse. We argue that not only can contradictions be tolerated, but in fact they are useful. An excellent test of an argument is to compare it with the best argument for the opposing view. Accordingly, we propose a ...

We present a theory of argumentation that can deal with contradiction within an argumentation framework, thus solving a problem posed in [1]. By representing logic programs as sets of interacting arguments, we can apply our results for general argumentation frameworks to logicprogramming semantics. This yields a new semantics for logic programs that properly extends traditional approaches such ...