From Ifigenia, the wiki for intuitionistic fuzzy sets and generalized nets
Jump to navigation
Jump to search
|
|
Line 23: |
Line 23: |
| {{issue/data | | {{issue/data |
| | conference = | | | conference = |
| | issue = [[Notes on Intuitionistic Fuzzy Sets/01/1|"Notes on IFS", Volume 1 (1995) Number 1]], pages 1—4 | | | issue = [[Notes on Intuitionistic Fuzzy Sets/01/1|"Notes on Intuitionistic Fuzzy Sets", Volume 1 (1995) Number 1]], pages 1—4 |
| | file = NIFS-01-1-01-04.pdf | | | file = NIFS-01-1-01-04.pdf |
| | format = PDF | | | format = PDF |
Latest revision as of 11:06, 29 August 2024
shortcut
|
http://ifigenia.org/wiki/issue:nifs/1/1/01-04
|
Title of paper:
|
On the intuitionistic fuzzy logic operations
|
Author(s):
|
George Gargov
|
Linguistic Modelling Laboratory - CICT, Sofia, Bulgaria
|
|
Krassimir Atanassov
|
Central Lab. on Biomedical Engineering - Bulgarian Academy of Sciences, Acad G. Bonchev Str., bl. 105, Sofia - 1113
|
krat@bgcict.bitnet (current: krat@bas.bg)
|
|
Published in:
|
"Notes on Intuitionistic Fuzzy Sets", Volume 1 (1995) Number 1, pages 1—4
|
Download:
|
PDF (157 Kb, File info)
|
Abstract:
|
Some operations of the Intuitionistic Fuzzy Logic (IFL) are introduced in [1,2] and their basic properties are studied. While operations ¬ (negation), & (conjunction), and ∨ (disjunction) are defined in one form, the operation ⊃ has ten ones. Here, we shall introduce other variants of the binary (i.e. without the unary operation ¬) operations and shall show some of their properties.
|
References:
|
- Atanassov K., Two variants of intuitionistic fuzzy propositional calculus. Preprint IM-MFAIS-5-88, Sofia, 1988
- Atanassov K., Gargov G., Georgiev Ch., Remark on intuitionistic fuzzy Modus Ponens, Second Sci. Session of the "Mathematical Foundation of Artificial Intelligence" Seminar, Sofia, March 30, 1990, Preprint IM-MFAIS-1-90, 10-13
- Mendelson E., Introduction to mathematical logic, Princeton, NJ: D. Van Nostrand, 1964
|
Citations:
|
The list of publications, citing this article may be empty or incomplete. If you can provide relevant data, please, write on the talk page.
|
|