Bibliographic record
Abstract
As one of important parts of fuzzy logic, fuzzy inference plays a vital role in the fields of fuzzy control, artificial intelligence, affective computing, image processing and so forth. Two key problems of fuzzy inference are FMP (fuzzy modus ponens) and FMT (fuzzy modus tollens). How to get the ideal solution for FMP and FMT is a difficult problem in the area of fuzzy logic. Aiming at such problem, from the idea of symmetric implicational reasoning, triple I* method and restriction theory, we put forward and investigate the α-symmetric I* restriction method, and then generalize it to the α(x,y)-symmetric I* restriction method. To begin with, the α-symmetric I* restriction principle and the α(x,y)-symmetric I* restriction principle are established. Furthermore, the equivalent condition to let a basic restriction solution exist is given. Then the unified solutions of the α-symmetric I* restriction method and the α(x,y)-symmetric I* restriction method are achieved for R-implications and (S, N)-implications. Besides, some special cases of optimal solutions are shown. Finally, the corresponding conclusions are provided when the two methods degenerate into the α-triple I* restriction method and α(x,y)-triple I* restriction method. These research results would be an important improvement for the fields of fuzzy inference, fuzzy logic and related applications.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.008 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".