MétaCan
Menu
Back to cohort
Record W1904353654 · doi:10.1109/fuzzy.1992.258784

Rule break up with compositional rule of inference

2003· article· en· W1904353654 on OpenAlexaff
Kudret Demirli, İ.B. Türkşen

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRough Sets and Fuzzy Logic
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsRule of inferenceGödelComputer scienceFunction (biology)Simple (philosophy)InferenceComposition (language)Mechanism (biology)Artificial intelligenceMathematical economicsMathematicsPhilosophyEpistemologyLinguistics

Abstract

fetched live from OpenAlex

It is shown that complex rules can be broken up into simple rules when the rules are represented with any S-implication or any R-implication. It is emphasized that the Godel implication is the only meaningful implication function to be used with the max-min composition if the inferencing mechanism is to satisfy certain properties. It is also shown that the rule breakup with max-min composition and Godel implication provides a very efficient and meaningful inferencing mechanism.>

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 imitation

Not 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.

metaresearch head score (Codex)0.005
metaresearch head score (Gemma)0.017
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.027

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.017
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.004
Bibliometrics0.0020.001
Science and technology studies0.0020.003
Scholarly communication0.0030.006
Open science0.0030.005
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0080.004

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.

Opus teacher head0.015
GPT teacher head0.234
Teacher spread0.219 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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".

Quick stats

Citations21
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicRough Sets and Fuzzy LogicFrench-language works237,207