Granular Logic with Closeness Relation $``\sim_{\lambda}"$ and Its Reasoning
Lecture notes in computer sciencePublished 1 January 2005
Qing Liu, Qianying Wang
Citations8
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
Significance of granular logic, including the operational rules, studying background, is presented, and the granular logical reasoning systems with the closeness relation ~λ are established.
Abstract
Significance of granular logic, including the operational rules, studying background, is presented in this paper. This closeness relation \(``\sim_{\lambda}"\) is quoted in granular logic,and the closeness relation \(``\sim_{\lambda}"\) quoted in granular logic is defined via logical truth values. Hence, we induce several new relative properties and inference rules in the granular logic with the closeness relation. The granular logical reasoning systems with the closeness relation \(``\sim_{\lambda}"\) are also established. And this paper proves a few real examples by deductive reasoning in the systems. Significance of granular logic with closeness relation ~ λ is also described in the paper.
Keywords
Computer Science
Rough Sets: Theoretical Aspects of Reasoning about Data
8,416 Citations1991Zdzisław Pawlak
Fuzzy Sets and SystemsToward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic
2,875 Citations1997Lotfi A. Zadeh
M Modes of information granulation (IG) in which the granules are crisp (c-granular) play important roles in a wide variety of methods, approaches and techniques, but this does not reflect the fact that in almost all of human reasoning and concept formation thegranules are fuzzy (f- Granular).
Lecture notes in computer scienceRough Sets and Current Trends in Computing
1,099 Citations2008Carbonell, Jaime G, Wojciech Ziarko +3 more
Lecture notes in computer scienceRough Sets, Fuzzy Sets, Data Mining and Granular Computing
573 Citations2007Aijun An, Guoyin Wang +4 more
14th International Conference, RSFDGrC 2013, Halifax, NS, Canada, October 11-14, 2013.
Introduction to Mathematical Logic
545 Citations1987Elliott Mendelson
This long-established text continues to expose students to natural proofs and set-theoretic methods and offers enough material for either a one- or two-semester course on mathematical logic.
International Journal of Intelligent SystemsInformation granulation and rough set approximation
527 Citations2000Yiyu Yao
The granulation structures used by standard rough set theory and the corresponding approximation structures are reviewed and the notion of neighborhood systems is also explored.
Studies in fuzziness and soft computingData Mining, Rough Sets and Granular Computing
229 Citations2002Tsau Young Lin, Yiyu Yao +1 more
This book discusses Granular Computing in Data Mining, Granular computing with Closeness and Negligibility Relations, and the application of Granularity Computing to Confirm Compliance with Non-Proliferation Treaty.
Logic for Mathematicians
152 Citations1978Arran Hamilton
Lecture notes in computer scienceThe Quotient Space Theory of Problem Solving
143 Citations2007Ling Zhang, Bo Zhang
A framework of quotient space theory of problem solving, in which a problem (or problem space) is represented as a triplet, including the universe, its structure and attributes, is introduced.
Studies in fuzziness and soft computingGranular Computing: Fuzzy Logic and Rough Sets
137 Citations1999Tzu‐Yu Lin
Table processing techniques of rough set theory may be used to simplify these tables and their transformations of fuzzy logic designs; the complexity of large scaled fuzzy systems may be reduced.
Lecture notes in computer scienceToward Intelligent Systems: Calculi of Information Granules
116 Citations2001Andrzej Skowron
An approach based on calculi of information granules as a basis for approximate reasoning in intelligent systems and problems of learning in rough neural networks from experimental data and background knowledge are discussed.
Lecture notes in computer scienceInduction of Classification Rules by Granular Computing
110 Citations2002JingTao Yao, Yiyu Yao
For the design of granule selection heuristics, several measures on granules are suggested and a classification rule induction method is proposed that leads to finding a covering of the universe, which is more general than partition based methods.
Studies in fuzziness and soft computingGranular Computing Using Information Tables
99 Citations2002Yiyu Yao, Ning Zhong
This paper reviews the pertinent existing results and presents their generalizations and applications and develops a simple and more concrete granular computing model using the notion of information tables.
Granular Computing as a Basis for Consistent Classification Problems
69 Citations2002Yiyu Yao, JingTao Yao
Within a granular computing model of data mining, the consistent classification problems are reformulated to precisely and concisely define many notions, and to present a more general framework for classification.
Granular Computing on Binary Relations
68 Citations2002Tsau Young Lin
Lecture notes in computer scienceA Generalized Decision Logic in Interval-Set-Valued Information Tables
60 Citations1999Yiyu Yao, Qing Liu
A generalized decision logic in interval-set-valued information tables is introduced, which is an extension of decision logic studied by Pawlak and a semantics model of the proposed logic language is studied.
Lecture notes in computer scienceGranular Computing on Binary Relations Analysis of Conflict and Chinese Wall Security Policy
47 Citations2002Tsau Young Lin
The granular computing on binary relations is presented and the result is applied to the analysis of conflict of interests relation (CIR) and the Chinese wall security policy (CWSP).
Fundamenta InformaticaeFIRST-ORDER ROUGH LOGIC I: APPROXIMATE REASONING VIA ROUGH SETS
41 Citations1996Tzu-Yu Lin, Qing Liu
A new formal logic system based on axioms of rough logic, called First-Order Logic for Rough Approximation or simply Rough Logic, is proposed, which integrates imperfect observations into an approximation of actual world.
G-Logic and Its Resolution Reasoning
28 Citations2004Qing Liu
This paper proposes a granular logic that defines the G -formula, G -clause and G -literal, and to give the methods of G -resolution in the logic, and the soundness and completeness of the theorem for G - Resolution refutation are discussed.
Lecture notes in computer scienceAbout Tolerance and Similarity Relations in Information Systems
26 Citations2002Jacek Pomykała
The tolerance and similarity relations in information systems are considered and a new definition of similarity dependency of attributes is formulated.
Lecture notes in computer scienceGranules and Reasoning Based on Granular Computing
22 Citations2007Qing Liu
The granule of decision rules is defined, the inclusion and closeness degree between granules are defined, and a new reasoning model is proposed that may be used in reasoning of expert systems.
Granules and Applications of Granular Computing in Logical Reasoning
21 Citations2004Qing Liu
The structure and real examples of information granules are discussed in this paper and the validity and feasibility of the reasoning are illustrated with real examples.
Approximate reasoning based on granular computing in granular logic
18 Citations2003Qing Liu, Qun Liu
The paper proposes a granular logic which defines the syntax and semantics of the logic, and the formula in the logic is a granule or any Boolean combination of the granules.
Lecture notes in computer scienceThe OI-Resolution of Operator Rough Logic
13 Citations1998Qing Liu
This paper establishes operator space [ξ*, ξ*], and proves the soundness theorem of the logic resolution, where OI is an abbreviation of Operator Interval.
Lecture notes in computer scienceMany-Valued Dynamic Logic for Qualitative Decision Theory
13 Citations1999Churn‐Jung Liau
This paper presents an integration of the dynamic logic semantics and rational decision theory, where the well-formed formulas of the logics are viewed as the possible goals to be achieved by the decision maker and the truth values of the formulas are considered as the utilities of the goals.
Lecture notes in computer scienceExtracting Patterns Using Information Granules: A Brief Introduction
10 Citations2001Andrzej Skowron, Jarosław Stepaniuk +1 more
The paper realizes a step in developing a foundation for approximate reasoning from experimental data to conclusions in natural language by outlining Granule decomposition strategies based on background knowledge.
Lecture notes in computer scienceMeasures of Inclusion and Closeness of Information Granules: A Rough Set Approach
9 Citations2002James F. Peters, Andrzej Skowron +3 more
The introduction of measures of granule inclusion and closeness based on an indistinguishability relation that partitions real-valued universes into subintervals (equivalence classes) are useful in measuring closeness and inclusion of granules containing sample signal values.
Lecture notes in computer scienceBelief Reasoning, Revision and Fusion by Matrix Algebra
9 Citations2004Churn‐Jung Liau
A matrix representation for ordered belief states is developed and it is shown that belief reasoning, revision and fusion can all be interpreted as operations of matrix algebra.
Lecture notes in computer scienceInformation Granules for Intelligent Knowledge Structures
9 Citations2007Patrick Doherty, Witold Łukaszewicz +1 more
The novelty of this paper is that it provides a concise and formal definition of a particular view of information granule and its associated operators, as required in advanced knowledge representation applications.
Lecture notes in computer scienceApproximation of Information Granule Sets
9 Citations2001Andrzej Skowron, Jarosław Stepaniuk +1 more
Basic notions related to granular computing, namely the information granule syntax and semantics as well as the inclusion and closeness (similarity) relations of granules are presented.
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE<title>Granular language and its reasoning</title>
3 Citations2003Qing Liu
This paper examines many real world examples of information granules, and construct a granular deductive reasoning system for these domains, and establishes the evaluation of truth values and the computation rule of granular formulas.
Lecture notes in computer scienceλ-Level Rough Equality Relation and the Inference of Rough Paramodulation
3 Citations2001Qing Liu
A λ-level rough equality relation in rough logic is defined and a rough sets on real-valued information systems with it is established and it is proved that λ -level rough paramodulant reasoning is sound.