Orthopairs in the 1960s: Historical Remarks and New Ideas
Lecture notes in computer sciencePublished 1 January 2014
Davide Ciucci
Citations11
SJR quartileQ2
SJR score0.35
SNIP0.55
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
Before the advent of fuzzy and rough sets, some authors in the 1960s studied three-valued logics and pairs of sets with a meaning similar to those the authors can encounter nowadays in modern theories such as rough Set Theory, decision theory and granular computing.
Abstract
Before the advent of fuzzy and rough sets, some authors in the 1960s studied three-valued logics and pairs of sets with a meaning similar to those we can encounter nowadays in modern theories such as rough sets, decision theory and granular computing. We revise these studies using the modern terminology and making reference to the present literature. Finally, we put forward some future directions of investigation
Keywords
Computer ScienceDecision Sciences
Cambridge University Press eBooksAggregation Functions
1,567 Citations2009Michel Grabisch, Jean‐Luc Marichal +2 more
A Useful Four-Valued Logic
1,419 Citations1977Nuel Belnap
It is argued that a sophisticated question-answering machine that has the capability of making inferences from its data base should employ a certain four-valued logic, the motivating consideration being that minor inconsistencies in its data should not be allowed to lead to irrelevant conclusions.
Lecture notes in computer scienceRough Sets and Current Trends in Computing
1,099 Citations2008Carbonell, Jaime G, Wojciech Ziarko +3 more
Lecture notes in computer scienceAn Outline of a Theory of Three-Way Decisions
497 Citations2012Yiyu Yao
A theory of three-way decisions is constructed based on the notions of acceptance, rejection and noncommitment, an extension of the commonly used binary-decision model with an added third option.
”Aggregation Functions”, Cambridge University Press
448 Citations2008Michel Grabisch, Jean‐Luc Marichal +2 more
There is given a short overview of the monograph rdquoAgg functionsrdquo (M. Grabisch, J. L. Marichal, R. Mesiar, E. Pap).
Lecture notes in computer scienceGranular Computing and Sequential Three-Way Decisions
153 Citations2013Yiyu Yao
Real-world decision making typically involves the three options of acceptance, rejection and non-commitment, and multiple levels of granularity lead naturally to sequential three-way decisions.
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.
Information SciencesA map of dependencies among three-valued logics
103 Citations2013Davide Ciucci, D. Dubois
It turns out that all reasonable connectives can be defined from a few of them and so all known three-valued logics appear as a fragment of only one logic, which can be instrumental when choosing the appropriate fragment for each application context, based on the appropriate meaning of the third truth-value.
Logica UniversalisFrom Blanché’s Hexagonal Organization of Concepts to Formal Concept Analysis and Possibility Theory
99 Citations2012Didier Dubois, Henri Prade
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.
A Geometry of Approximation
77 Citations2008Piero Pagliani, Mihir K. Chakraborty +1 more
Fundamenta InformaticaeOrthopairs: A Simple and Widely UsedWay to Model Uncertainty
70 Citations2011Davide Ciucci
Some orthopair models dealing with uncertainty are analyzed both from a mathematical and semantical point of view, outlining similarities and differences among them.
International Journal of Approximate ReasoningGranular computing applied to ontologies
61 Citations2009Silvia Calegari, Davide Ciucci
This paper proposes four operations in order to have several granular perspectives for a specific ontological commitment and introduces a rough methodology to construct a specific granular view of an ontology.
International Journal of Approximate ReasoningBorderline vs. unknown: comparing three-valued representations of imperfect information
59 Citations2014Davide Ciucci, Didier Dubois +1 more
The expressive power of elementary representation formats for vague, incomplete or conflicting information, including Boolean valuation pairs introduced by Lawry and Gonzalez-Rodriguez, orthopairs of sets of variables, Boolean possibility and necessity measures, three-valued valuations, supervaluations are compared.
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.
Lecture notes in computer scienceThree-Valued Logics, Uncertainty Management and Rough Sets
47 Citations2014Davide Ciucci, Didier Dubois
This paper shows how to translate three-valued conjunctions and implications into operations on ill-known sets such as rough sets and shows 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.
Transactions on rough setsPropositional Logics from Rough Set Theory
46 Citations2007Mohua Banerjee, Md. Aquil Khan
An attempt is made to place the gamut of work on propositional logics with semantics based on rough sets, spread over the last 20 years, in one platform, and present the various relationships that emerge and indicate questions that surface.
Lecture notes in computer scienceOppositions in Rough Set Theory
40 Citations2012Davide Ciucci, Didier Dubois +1 more
The role of opposition in rough set theory is laid bare and a classical square of oppositions is defined and also a tetrahedron when considering the standpoint of two agents.
Lecture notes in computer scienceGeneralized Rough Sets and Implication Lattices
24 Citations2011Pulak Samanta, Mihir K. Chakraborty
This paper consists of an extensive survey of various generalized approaches to the lower and upper approximation of a set, the two approximations being first defined by Pawlak while introducing rough set theory.
Artificial IntelligenceOn truth-gaps, bipolar belief and the assertability of vague propositions
22 Citations2012Jonathan Lawry, Yongchuan Tang
An integrated approach to indeterminacy and epistemic uncertainty is proposed in order to model an intelligent agent's decision making about the assertability of vague statements to understand how the use of vague expressions can help to mitigate the risk associated with making forecasts or promises.
Soft ComputingReasoning about ignorance and contradiction: many-valued logics versus epistemic logic
21 Citations2012Didier Dubois
Journal of Applied Non-Classical LogicsA modal theorem-preserving translation of a class of three-valued logics of incomplete information
16 Citations2013Davide Ciucci, D. Dubois
This work enables the precise expressive power of three-valued logics to be laid bare for the purpose of uncertainty management.
Lecture notes in computer scienceTransactions on Rough Sets XVII
15 Citations2014James F. Peters, Andrzej Skowron
This work presents Proximity System, a Description-Based System for Quantifying the Nearness or Apartness of Visual Rough Sets, and Algorithms for Similarity Relation Learning from High Dimensional Data.
HAL (Le Centre pour la Communication Scientifique Directe)A Bipolar Framework for Combining Beliefs about Vague Propositions
12 Citations2012Jonathan Lawry, Didier Dubois
This approach exploits the truth-gaps inherent to propositions involving vague concepts, by allowing agents to soften directly conflicting opinions by adopting a bipolar truth-model for propositional logic characterised by lower and upper valuations on the sentences of the language.
Journal of Logic Language and InformationInformation Gaps as Communication Needs: A New Semantic Foundation for Some Non-Classical Logics
8 Citations1997Piero Pagliani
An intuitive model based on the notion of ’’passage of information‘‘ is obtained showing that Kleene algebras, semi-simple Nelson alge Bras, three-valued Łukasiewicz alge bras and Post algeBRas of order three are, in a sense, directly connected to partially defined information systems.