Three-valued logics, uncertainty management and rough sets

This paper is a survey of the connections between three-valued logics and rough sets from the point of view of incomplete information management. Based on the fact that many three-valued logics can be put under a unique algebraic umbrella, we show how to translate three-valued conjunctions and implications into operations on ill-known sets such as rough sets. We then show that while such translations may provide mathematically elegant algebraic settings for rough sets, the interpretability of these connectives in terms of an original set approximated via an equivalence relation is very limited, thus casting doubts on the practical relevance of truth-functional logical renderings of rough sets

Algebraic Models for Qualified Aggregation in General Rough Sets, and Reasoning Bias Discovery

In the context of general rough sets, the act of combining two things to form another is not straightforward. The situation is similar for other theories that concern uncertainty and vagueness. Such acts can be endowed with additional meaning that go beyond structural conjunction and disjunction as in the theory of $*$-norms and associated implications over $L$-fuzzy sets. In the present research, algebraic models of acts of combining things in generalized rough sets over lattices with approximation operators (called rough convenience lattices) is invented. The investigation is strongly motivated by the desire to model skeptical or pessimistic, and optimistic or possibilistic aggregation in human reasoning, and the choice of operations is constrained by the perspective. Fundamental results on the weak negations and implications afforded by the minimal models are proved. In addition, the model is suitable for the study of discriminatory/toxic behavior in human reasoning, and of ML algorithms learning such behavior.Comment: 15 Pages. Accepted. IJCRS-202

Borderline vs. unknown: comparing three-valued representations of imperfect information

International audienceIn this paper we compare the expressive power of elementary representation formats for vague, incomplete or conflicting information. These include Boolean valuation pairs introduced by Lawry and González-Rodríguez, orthopairs of sets of variables, Boolean possibility and necessity measures, three-valued valuations, supervaluations. We make explicit their connections with strong Kleene logic and with Belnap logic of conflicting information. The formal similarities between 3-valued approaches to vagueness and formalisms that handle incomplete information often lead to a confusion between degrees of truth and degrees of uncertainty. Yet there are important differences that appear at the interpretive level: while truth-functional logics of vagueness are accepted by a part of the scientific community (even if questioned by supervaluationists), the truth-functionality assumption of three-valued calculi for handling incomplete information looks questionable, compared to the non-truth-functional approaches based on Boolean possibility–necessity pairs. This paper aims to clarify the similarities and differences between the two situations. We also study to what extent operations for comparing and merging information items in the form of orthopairs can be expressed by means of operations on valuation pairs, three-valued valuations and underlying possibility distributions

Sur les uninormes discrètes idempotentes

National audienceDans cet article, nous donnons deux axiomatisations de la classe des uninormes discrètes idempotentes en tant qu'opérations binaires conservatives, où une opération est conservative si elle renvoie toujours la valeur prise par l'une de ses variables. Plus précisément, nous montrons d'abord que les uninormes discrètes idempotentes sont exactement les opérations qui sont conservatives, symétriques and non décroissantes. Ensuite, nous montrons que dans cette caractérisation la symétrie peut être remplacée par la bisymétrie et l'existence d'un élément neutre

A T-partial order obtained from T-norms

summary:A partial order on a bounded lattice $L$ is called t-order if it is defined by means of the t-norm on $L$. It is obtained that for a t-norm on a bounded lattice $L$ the relation $a\preceq_{T}b$ iff $a=T(x,b)$ for some $x\in L$ is a partial order. The goal of the paper is to determine some conditions such that the new partial order induces a bounded lattice on the subset of all idempotent elements of $L$ and a complete lattice on the subset $A$ of all elements of $L$ which are the supremum of a subset of atoms

Implication operators generating pairs of weak negations and their algebraic structure

Negations operators have been developed and applied in many fields such as image processing, decision making, mathematical morphology, fuzzy logic, etc. One of the most effective non-monotonic operators are weak negations. This paper studies the algebraic structure and the characterization of the adjoint triples and Galois implication pairs which provides a fixed pair of weak negations. The obtained results allow the user to select the best conjunctor and implications associated with the most suitable negation to be used in the computations of the problem to be solved.Partially supported by the State Research Agency (AEI) and the European Regional Development Fund (ERDF) project TIN2016-76653-P, European Cooperation in Science & Technology (COST) Action CA17124

Bounded-analytic sequent calculi and embeddings for hypersequent logics

A sequent calculus with the subformula property has long been recognised as a highly favourable starting point for the proof theoretic investigation of a logic. However, most logics of interest cannot be presented using a sequent calculus with the subformula property. In response, many formalisms more intricate than the sequent calculus have been formulated. In this work we identify an alternative: retain the sequent calculus but generalise the subformula property to permit specific axiom substitutions and their subformulas. Our investigation leads to a classification of generalised subformula properties and is applied to infinitely many substructural, intermediate, and modal logics (specifically: those with a cut-free hypersequent calculus). We also develop a complementary perspective on the generalised subformula properties in terms of logical embeddings. This yields new complexity upper bounds for contractive-mingle substructural logics and situates isolated results on the so-called simple substitution property within a general theory