Orthopairs: A Simple and Widely UsedWay to Model Uncertainty
Fundamenta InformaticaePublished 1 January 2011Open access
Davide Ciucci
Citations70
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Some orthopair models dealing with uncertainty are analyzed both from a mathematical and semantical point of view, outlining similarities and differences among them.
Abstract
The term orthopair is introduced to group under a unique definition different ways used to denote the same concept. Some orthopair models dealing with uncertainty are analyzed both from a mathematical and semantical point of view, outlining similarities and differences among them. Finally, lattice operations on orthopairs are studied and a survey on algebraic structures is provided.
Keywords
ChemistryComputer Science
Fuzzy Sets and SystemsIntuitionistic fuzzy sets
16,153 Citations1986Krassimir Atanassov
Various properties are proved, which are connected to the operations and relations over sets, and with modal and topological operators, defined over the set of IFS's.
Trends in logicMetamathematics of Fuzzy Logic
3,973 Citations1998Petr Hájek
This paper presents a meta-analysis of many-Valued Propositional Logic, focusing on the part of Lukasiewicz's Logic that deals with Complexity, Undecidability and Generalized Quantifiers and Modalities.
Studies in fuzziness and soft computingIntuitionistic Fuzzy Sets
2,163 Citations1999Krassimir Atanassov
Information SciencesRudiments of rough sets
2,036 Citations2006Zdzisław Pawlak, Andrzej Skowron
The basic concepts of rough set theory are presented and some rough set-based research directions and applications are pointed out, indicating that the rough set approach is fundamentally important in artificial intelligence and cognitive sciences.
Journal of Computer and System SciencesVariable precision rough set model
2,024 Citations1993Wojciech Ziarko
A generalized model of rough sets called variable precision model (VP-model), aimed at modelling classification problems involving uncertain or imprecise information, is presented and the main concepts are introduced formally and illustrated with simple examples.
Information SciencesRelational interpretations of neighborhood operators and rough set approximation operators
1,025 Citations1998Yiyu Yao
This paper presents a framework for the formulation, interpretation, and comparison of neighborhood systems and rough set approximations using the more familiar notion of binary relations, and introduces a special class of neighborhood system, called 1-neighborhood systems.
Information SystemsInformation systems theoretical foundations
669 Citations1981Zdzisław Pawlak
The presented approach leads to a new information systems organization and the implementation shows many advantages compared with other methods.
International Journal of Approximate ReasoningProbabilistic rough set approximations
591 Citations2007Yiyu Yao
Based on rough membership functions and rough inclusion functions, the Bayesian decision-theoretic analysis is adopted to provide a systematic method for determining the precision parameters by using more familiar notions of costs and risks.
Information SciencesExtensions and intentions in the rough set theory
575 Citations1998Zbigniew Bonikowski, Edward Bryniarski +1 more
The approach to rough set theory proposed in this paper is based on the mutual correspondence of the concepts of extension and intension, which makes it possible to formulate necessary and sufficient conditions for the existence of operations on rough sets, which are analogous to classical operations on sets.
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Shadowed sets: representing and processing fuzzy sets
424 Citations1998Witold Pedrycz
A new concept of shadowed sets is introduced that can be regarded as a certain operational framework simplifying processing carried out with the aid of fuzzy sets and enhancing interpretation of results obtained therein.
Information SciencesOn the position of intuitionistic fuzzy set theory in the framework of theories modelling imprecision
226 Citations2006Glad Deschrijver, Etienne Kerre
This paper discusses the mathematical relationship between intuitionistic fuzzy sets and other models of imprecision.
International Journal of Intelligent SystemsAn introduction to bipolar representations of information and preference
223 Citations2008Didier Dubois, Henri Prade
Three forms of bipolarity are laid bare: symmetric univariate, dual bivariate, and asymmetric (or heterogeneous) bipolarity, which can be instrumental in the logical handling of incompleteness and inconsistency, rule representation and extraction, argumentation, learning, and decision analysis.
Fuzzy Sets and SystemsTwofold fuzzy sets and rough sets—Some issues in knowledge representation
214 Citations1987Didier Dubois, Henri Prade
Twofold fuzzy sets are compared from a frontal and from a semantical point of view with other proposals and particularly with the notion of a rough set recently introduced by Pawlak.
Fundamenta InformaticaeRough Sets Through Algebraic Logic
140 Citations1996Mohua Banerjee, Mihir K. Chakraborty
It is observed that rough algebra is more structured than a tqBa, and two more structures, viz. pre-rough algebra and rough algebra, are denned.
IEEE Transactions on Systems Man and CyberneticsConditional objects as nonmonotonic consequence relationships
131 Citations1994D. Dubois, H. Prade
This paper investigates the relationship between conditional objects obtained as a qualitative counterpart to conditional probabilities, and nonmonotonic reasoning, and proposes a logic of conditional objects that is more elementary and intuitive than the preferential semantics of Lehmann and colleagues and does not require probabilistic semantics.
Interval-set algebra for qualitative knowledge representation
122 Citations2002Yiyu Yao
The notion of interval sets is introduced as a new kind of sets represented by a pair of sets, namely, the lower and upper bounds, and operations on interval sets are defined, based on the corresponding set-theoretic operations on their members.
Cambridge University Press eBooksInfinite-valued G?del Logics with 0-1-Projections and Relativizations
114 Citations2017Matthias Baaz
Fuzzy Sets and SystemsDitopological texture spaces and intuitionistic sets
103 Citations1998L. M. Brown, Murat Diker
It is shown that the lattice of intuitionistic subsets of a set X in the sense of D may be represented as a special type of texture space, called an intuitionistic texture on X, and various characterizations are given.
Fuzzy Sets and SystemsBrouwer-Zadeh posets and three-valued Łukasiewicz posets
101 Citations1989Gianpiero Cattaneo, Giuseppe Nisticò
International Journal of Intelligent SystemsGranular computing with shadowed sets
85 Citations2002Witold Pedrycz, George Vukovich
This article includes a number of detailed calculations concerning two commonly exploited classes of triangular and Gaussian fuzzy sets and elaborate on the exploration of shadowed sets as an algorithmic realization of the least commitment principle advocated by Marr.
Fundamenta InformaticaeVARIABLE PRECISION EXTENSION OF ROUGH SETS
84 Citations1996J.D. Katzberg, Wojciech Ziarko
A generalization of the original idea of rough sets as introduced by Pawlak, called the Variable Precision Rough Sets Model with Asymmetric Bounds, is aimed at modeling decision situations characterized by uncertain information expressed in terms of probability distributions estimated form frequency distributions observed in empirical data.
Cognitive technologiesAlgebras from Rough Sets
83 Citations2004Mohua Banerjee, Mihir K. Chakraborty
An attempt is made here to present the various relationships and to discuss the representation results of rough set theory instances of various algebraic structures.
Studia LogicaGeneralized Rough Sets (Preclusivity Fuzzy-Intuitionistic (BZ) Lattices)
76 Citations1997Gianpiero Cattaneo
The standard Pawlak approach to rough set theory, as an approximation space consisting of a universe U and an equivalence relation R, can be equivalently described by the induced preclusivity ("discernibility") relation U x U \ R, which is irreflexive and symmetric.
Fundamenta InformaticaeCOMPARISON OF ROUGH-SET AND INTERVAL-SET MODELS FOR UNCERTAIN REASONING
66 Citations1996Yiyu Yao, Xining Li
It is argued that the rough-set model corresponds to the modal logic system S 5, while the interval-set models extend set theory in the same manner as the logic systems S 5 and K 3 extend standard propositional logic.
Notre Dame Journal of Formal LogicA certain conception of the calculus of rough sets.
52 Citations1992Zbigniew Bonikowski
It is proved that the family of rough sets, determined by the unions of equivalence classes of the relation R with the operations of rough addition, rough multiplication, and complement, is a complete atomic Boolean algebra.
Interval sets and interval-set algebras
50 Citations2009Yiyu Yao
Interval sets and interval-set algebras provide a tool for modeling and processing partially known concepts and for approximating undefinable or complex concepts.
Fundamenta InformaticaeContributions to the Theory of Rough Sets
48 Citations1999Victor W. Marek, Mirosław Truszczyński
It is shown that for any consistent theory T in the language of inclusion-exclusion there exists a kn-greatest rough set approximating all sets X that satisfy T, and provided algorithmic ways to find this best approximation.
Fuzzy Sets and SystemsBZMVdM algebras and stonian MV-algebras (applications to fuzzy sets and rough approximations)
39 Citations1999Gianpiero Cattaneo, Roberto Giuntini +1 more
It is proved that BZMV dM - algebras (which are equationally characterized) are the same as the Stonian MV- algeBRas and a rst representation theorem is proved.
IEEE Transactions on Systems Man and CyberneticsStone algebras, conditional events, and three valued logic
37 Citations1994Elbert A. Walker
There are many ways to extend the operations on events to operations on conditional events, but it is shown that there is only one way to make such extensions so that the resulting structure is a bounded lattice extension of the space of events.
Lecture notes in computer scienceGeneralizations of Rough Sets and Rule Extraction
25 Citations2004Masahiro Inuiguchi
Two kinds of generalizations of rough sets are proposed based on two different interpretations of rough set: one is an interpretation of roughsets as approximation of a set by means of elementary sets and the other is an interpretations ofrough sets as classification of objects into three different classes, i.e., positive objects, negative objects and boundary objects.
Fundamenta InformaticaeAlgebraic Structures Related to Many Valued Logical Systems. Part I: Heyting Wajsberg Algebras
24 Citations2004Gianpiero Cattaneo, Davide Ciucci +2 more
A bottom-up investigation of algebraic structures corresponding to many valued logical systems is made, with particular attention to the unit interval as a prototypical model of these kind of structures.
Lecture notes in computer scienceGranular Computing with Shadowed Sets
19 Citations2005Witold Pedrycz
Elsevier eBooksAN INFORMATION-BASED DISCUSSION OF VAGUENESS: SIX SCENARIOS LEADING TO VAGUENESS**This chapter is a fully revised and expanded version of a conference paper with the same title, presented at the 10th IEEE International Conference on Fuzzy Systems, Melbourne, Australia, December 2–5, 2001.
17 Citations2005Didier Dubois, Henri Prade +2 more
Fundamenta InformaticaeAlgebraic Structures Related to Many Valued Logical Systems. Part II: Equivalence Among some Widespread Structures
14 Citations2004Gianpiero Cattaneo, Davide Ciucci +2 more
Four propositional calculi whose Lindenbaum-Tarski algebra corresponds to the four equivalent algebraic structures are axiomatized and their semantical completeness is given.
Theoretical Aspects of Shadowed Sets
14 Citations2008Gianpiero Cattaneo, Davide Ciucci
Truth-Functionality, Rough Sets and Three-Valued Logics
10 Citations2010Davide Ciucci, Didier Dubois
This paper investigates the significance of truth-functional three valued logics of ill-known sets described by pairs of disjoint (or pairs of nested) subsets, showing that, while the mathematical underpinnings are sound, the relevance of these logics for reasoning about data-tables containing incomplete descriptions of objects is questionable.
Journal of Mathematical Analysis and ApplicationsGeneralized Fuzzy Connectives onMV-Algebras
9 Citations1997L. P. Belluce
HAL (Le Centre pour la Communication Scientifique Directe)On degrees of truth, partial ignorance and contradiction
7 Citations2008Didier Dubois
BOA (University of Milano-Bicocca)Rough sets and three valued connectives - Extended Abstract
1 Citations2010Davide Ciucci, Didier Dubois