Single axiomatic characterization of a hesitant fuzzy generalization of rough approximation operators

2021 ◽  
Author(s):  
Wen Liu ◽  
Ju-Sheng Mi ◽  
Yan Sun
Keyword(s):  
Axiomatic Characterization ◽  
Approximation Operators ◽  
Rough Approximation

Aximatics for Rough Set Model Based on Vague Relations

2011 ◽  
Vol 282-283 ◽  
pp. 283-286
Author(s):  
Hai Dong Zhang ◽  
Yan Ping He
Keyword(s):  
Rough Set ◽  
Rough Sets ◽  
General Framework ◽  
Axiomatic Approach ◽  
Constructive Approach ◽  
Approximation Operators ◽  
Rough Approximation ◽  
Axiomatic Approaches ◽  
Set Approximation

This paper presents a general framework for the study of rough set approximation operators in vague environment in which both constructive and axiomatic approaches are used. In constructive approach, by means of a vague relation defined by us, a new pair of vague rough approximation operators is first defined. Also some properties about the approximation operators are then discussed. In axiomatic approach, an operator-oriented characterization of vague rough sets is proposed, that is, vague rough approximation operators are defined by axioms.

On characterization of $$(\mathcal {I},{\mathcal {N}})$$ ( I , N ) -single valued neutrosophic rough approximation operators

2018 ◽  
Vol 23 (15) ◽  
pp. 6065-6084 ◽  
Author(s):  
Yan-Ling Bao ◽  
Hai-Long Yang ◽  
Sheng-Gang Li
Keyword(s):  
Approximation Operators ◽  
Rough Approximation

An Axiomatic Characterization of a Class of Petri Nets

1991 ◽  
Vol 14 (4) ◽  
pp. 477-491
Author(s):  
Waldemar Korczynski
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Axiomatic Characterization ◽  
Algebraic Characterization

In this paper an algebraic characterization of a class of Petri nets is given. The nets are characterized by a kind of algebras, which can be considered as a generalization of the concept of the case graph of a (marked) Petri net.

scholarly journals Rough Approximation Operators on a Complete Orthomodular Lattice

Axioms ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 164
Author(s):  
Songsong Dai
Keyword(s):  
Boolean Algebra ◽  
Orthomodular Lattice ◽  
Orthomodular Lattices ◽  
Approximation Operators ◽  
Rough Approximation ◽  
Distributive Law ◽  
Complete Orthomodular Lattice ◽  
The Relationship

This paper studies rough approximation via join and meet on a complete orthomodular lattice. Different from Boolean algebra, the distributive law of join over meet does not hold in orthomodular lattices. Some properties of rough approximation rely on the distributive law. Furthermore, we study the relationship among the distributive law, rough approximation and orthomodular lattice-valued relation.

An axiomatic characterization of Bayes' Rule

2004 ◽  
Vol 47 (3) ◽  
pp. 261-273 ◽  
Author(s):  
Dipjyoti Majumdar
Keyword(s):  
Axiomatic Characterization ◽  
Bayes Rule
Sign in / Sign up

Export Citation Format

Share Document