Intuitionistic Fuzzy Multivalued Dependency and Intuitionistic Fuzzy Fourth Normal Form

2015 ◽  
pp. 393-404
Author(s):  
Asma R Shora ◽  
Afshar Alam ◽  
Ranjit Biswas
Keyword(s):  
Normal Form ◽  
Intuitionistic Fuzzy ◽  
Multivalued Dependency

scholarly journals On Intuitionistic Fuzzy Context-Free Languages

2013 ◽  
Vol 2013 ◽  
pp. 1-16
Author(s):  
Jianhua Jin ◽  
Qingguo Li ◽  
Chunquan Li
Keyword(s):  
Normal Form ◽  
Fuzzy Sets ◽  
Intuitionistic Fuzzy Sets ◽  
Automata Theory ◽  
Algebraic Characterization ◽  
Step Functions ◽  
Intuitionistic Fuzzy ◽  
Pumping Lemma ◽  
Context Free ◽  
Pushdown Automata

Taking intuitionistic fuzzy sets as the structures of truth values, we propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs, for short) and pushdown automata with final states (IFPDAs). Then we investigate algebraic characterization of intuitionistic fuzzy recognizable languages including decomposition form and representation theorem. By introducing the generalized subset construction method, we show that IFPDAs are equivalent to their simple form, called intuitionistic fuzzy simple pushdown automata (IF-SPDAs), and then prove that intuitionistic fuzzy recognizable step functions are the same as those accepted by IFPDAs. It follows that intuitionistic fuzzy pushdown automata with empty stack and IFPDAs are equivalent by classical automata theory. Additionally, we introduce the concepts of Chomsky normal form grammar (IFCNF) and Greibach normal form grammar (IFGNF) based on intuitionistic fuzzy sets. The results of our study indicate that intuitionistic fuzzy context-free languages generated by IFCFGs are equivalent to those generated by IFGNFs and IFCNFs, respectively, and they are also equivalent to intuitionistic fuzzy recognizable step functions. Then some operations on the family of intuitionistic fuzzy context-free languages are discussed. Finally, pumping lemma for intuitionistic fuzzy context-free languages is investigated.

REDUNDANCY AND THE JUSTIFICATION FOR FOURTH NORMAL FORM IN RELATIONAL DATABASES

1993 ◽  
Vol 04 (04) ◽  
pp. 355-365 ◽  
Author(s):  
MILLIST W. VINCENT ◽  
BALA SRINIVASAN
Keyword(s):  
Normal Form ◽  
Relational Databases ◽  
Functional Dependency ◽  
Legal Relation ◽  
Different Types ◽  
Relation Scheme ◽  
Multivalued Dependency ◽  
The Relationship

The relationship between the absence of redundancy in relational databases and fourth normal form (4NF) is investigated. A relation scheme is defined to be redundant if there exists a legal relation defined over it which has at least two tuples that are identical on the attributes in a functional dependency (FD) or multivalued dependency (MVD) constraint. Depending on whether the dependencies in a set of constraints or the dependencies in the closure of the set is used, two different types of redundancy are defined. It is shown that the two types of redundancy are equivalent and their absence in a relation scheme is equivalent to the 4NF condition.

Closing the GAP—A 5Å Scanning Microscope

1969 ◽  
Vol 27 ◽  
pp. 6-7
Author(s):  
A. V. Crewe
Keyword(s):  
Normal Form ◽  
The Other ◽  
Resolving Power ◽  
Scanning Microscope ◽  
Conventional Microscope ◽  
Other Hand ◽  
Closing The Gap ◽  
Thermal Sources ◽  
Better Than ◽  
Transmission Microscope

We have become accustomed to differentiating between the scanning microscope and the conventional transmission microscope according to the resolving power which the two instruments offer. The conventional microscope is capable of a point resolution of a few angstroms and line resolutions of periodic objects of about 1Å. On the other hand, the scanning microscope, in its normal form, is not ordinarily capable of a point resolution better than 100Å. Upon examining reasons for the 100Å limitation, it becomes clear that this is based more on tradition than reason, and in particular, it is a condition imposed upon the microscope by adherence to thermal sources of electrons.

Decision making based on intuitionistic fuzzy preference relations with additive approximate consistency

2020 ◽  
Vol 39 (3) ◽  
pp. 4041-4058
Author(s):  
Fang Liu ◽  
Xu Tan ◽  
Hui Yang ◽  
Hui Zhao
Keyword(s):  
Decision Making ◽  
Decision Makers ◽  
Real Interval ◽  
Preference Relations ◽  
Intuitionistic Fuzzy ◽  
Proposed Model ◽  
Fuzzy Preference Relations ◽  
Novel Concept ◽  
Fuzzy Weights ◽  
Fuzzy Preference

Intuitionistic fuzzy preference relations (IFPRs) have the natural ability to reflect the positive, the negative and the non-determinative judgements of decision makers. A decision making model is proposed by considering the inherent property of IFPRs in this study, where the main novelty comes with the introduction of the concept of additive approximate consistency. First, the consistency definitions of IFPRs are reviewed and the underlying ideas are analyzed. Second, by considering the allocation of the non-determinacy degree of decision makers’ opinions, the novel concept of approximate consistency for IFPRs is proposed. Then the additive approximate consistency of IFPRs is defined and the properties are studied. Third, the priorities of alternatives are derived from IFPRs with additive approximate consistency by considering the effects of the permutations of alternatives and the allocation of the non-determinacy degree. The rankings of alternatives based on real, interval and intuitionistic fuzzy weights are investigated, respectively. Finally, some comparisons are reported by carrying out numerical examples to show the novelty and advantage of the proposed model. It is found that the proposed model can offer various decision schemes due to the allocation of the non-determinacy degree of IFPRs.

METHODS OF REDUCING OF LARGE BOOLEAN FORMULAS REPRESENTED IN A CONJUNCTIVE NORMAL FORM FOR DETERMINING THEIR SATISFIABILITY

2020 ◽  
Author(s):  
N.I. Gdansky ◽  
◽  
A.A. Denisov ◽  
Keyword(s):  
Normal Form ◽  
Normal Forms ◽  
Conjunctive Normal Form ◽  
Boolean Formulas

The article explores the satisfiability of conjunctive normal forms used in modeling systems.The problems of CNF preprocessing are considered.The analysis of particular methods for reducing this formulas, which have polynomial input complexity is given.

Sign in / Sign up

Export Citation Format

Share Document