Min and Max are the Only Continuous $\&$- and $\vee$-Operations for Finite Logics
Experts usually express their degrees of belief in their statements by the words of a natural language (like ``maybe'', ``perhaps'', etc.) If an expert system contains the degrees of beliefs $t(A)$ and $t(B)$ that correspond to the statements $A$ and $B$, and a user a...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Islamic Azad University, Bandar Abbas Branch
2022-05-01
|
| Series: | Transactions on Fuzzy Sets and Systems |
| Subjects: | |
| Online Access: | https://tfss.journals.iau.ir/article_690743_8e7d554486b7f55c771516eb4f6147dc.pdf |
| _version_ | 1797827888303570944 |
|---|---|
| author | Vladik Kreinovich |
| author_facet | Vladik Kreinovich |
| author_sort | Vladik Kreinovich |
| collection | DOAJ |
| description | Experts usually express their degrees of belief in their statements by the words of a natural language (like ``maybe'', ``perhaps'', etc.) If an expert system contains the degrees of beliefs $t(A)$ and $t(B)$ that correspond to the statements $A$ and $B$, and a user asks this expert system whether ``$A\,\&\,B$'' is true, then it is necessary to come up with a reasonable estimate for the degree of belief of $A\,\&\,B$. The operation that processes $t(A)$ and $t(B)$ into such an estimate $t(A\,\&\,B)$ is called an $\&$-operation. Many different $\&$-operations have been proposed. Which of them to choose? This can be (in principle) done by interviewing experts and eliciting a $\&$-operation from them, but such a process is very time-consuming and therefore, not always possible. So, usually, to choose a $\&$-operation, we extend the finite set of actually possible degrees of belief to an infinite set (e.g., to an interval [0,1]), define an operation there, and then restrict this operation to the finite set. In this paper, we consider only this original finite set. We show that a reasonable assumption that an $\&$-operation is continuous (i.e., that gradual change in $t(A)$ and $t(B)$ must lead to a gradual change in $t(A\,\&\,B)$), uniquely determines $\min$ as an $\&$-operation. Likewise, $\max$ is the only continuous $\vee$-operation. These results are in good accordance with the experimental analysis of ``and'' and ``or'' in human beliefs. |
| first_indexed | 2024-04-09T12:55:36Z |
| format | Article |
| id | doaj.art-0d2c75e0865349dda73b74be8416093f |
| institution | Directory Open Access Journal |
| issn | 2821-0131 |
| language | English |
| last_indexed | 2024-04-09T12:55:36Z |
| publishDate | 2022-05-01 |
| publisher | Islamic Azad University, Bandar Abbas Branch |
| record_format | Article |
| series | Transactions on Fuzzy Sets and Systems |
| spelling | doaj.art-0d2c75e0865349dda73b74be8416093f2023-05-13T17:23:32ZengIslamic Azad University, Bandar Abbas BranchTransactions on Fuzzy Sets and Systems2821-01312022-05-011117018010.30495/tfss.2022.1957194.1025690743Min and Max are the Only Continuous $\&$- and $\vee$-Operations for Finite LogicsVladik Kreinovich0Department of Computer Science University of Texas at El Paso El Paso, Texas, USAExperts usually express their degrees of belief in their statements by the words of a natural language (like ``maybe'', ``perhaps'', etc.) If an expert system contains the degrees of beliefs $t(A)$ and $t(B)$ that correspond to the statements $A$ and $B$, and a user asks this expert system whether ``$A\,\&\,B$'' is true, then it is necessary to come up with a reasonable estimate for the degree of belief of $A\,\&\,B$. The operation that processes $t(A)$ and $t(B)$ into such an estimate $t(A\,\&\,B)$ is called an $\&$-operation. Many different $\&$-operations have been proposed. Which of them to choose? This can be (in principle) done by interviewing experts and eliciting a $\&$-operation from them, but such a process is very time-consuming and therefore, not always possible. So, usually, to choose a $\&$-operation, we extend the finite set of actually possible degrees of belief to an infinite set (e.g., to an interval [0,1]), define an operation there, and then restrict this operation to the finite set. In this paper, we consider only this original finite set. We show that a reasonable assumption that an $\&$-operation is continuous (i.e., that gradual change in $t(A)$ and $t(B)$ must lead to a gradual change in $t(A\,\&\,B)$), uniquely determines $\min$ as an $\&$-operation. Likewise, $\max$ is the only continuous $\vee$-operation. These results are in good accordance with the experimental analysis of ``and'' and ``or'' in human beliefs.https://tfss.journals.iau.ir/article_690743_8e7d554486b7f55c771516eb4f6147dc.pdffinite logiccontinuous logical operation“and”-operation“or”-operationminmax |
| spellingShingle | Vladik Kreinovich Min and Max are the Only Continuous $\&$- and $\vee$-Operations for Finite Logics Transactions on Fuzzy Sets and Systems finite logic continuous logical operation “and”-operation “or”-operation min max |
| title | Min and Max are the Only Continuous $\&$- and $\vee$-Operations for Finite Logics |
| title_full | Min and Max are the Only Continuous $\&$- and $\vee$-Operations for Finite Logics |
| title_fullStr | Min and Max are the Only Continuous $\&$- and $\vee$-Operations for Finite Logics |
| title_full_unstemmed | Min and Max are the Only Continuous $\&$- and $\vee$-Operations for Finite Logics |
| title_short | Min and Max are the Only Continuous $\&$- and $\vee$-Operations for Finite Logics |
| title_sort | min and max are the only continuous and vee operations for finite logics |
| topic | finite logic continuous logical operation “and”-operation “or”-operation min max |
| url | https://tfss.journals.iau.ir/article_690743_8e7d554486b7f55c771516eb4f6147dc.pdf |
| work_keys_str_mv | AT vladikkreinovich minandmaxaretheonlycontinuousandveeoperationsforfinitelogics |