MétaCan
Menu
Back to cohort
Record W2093147846 · doi:10.4018/jcini.2007100106

The Cognitive Processes of Formal Inferences

2007· article· en· W2093147846 on OpenAlexaff
Yingxu Wang

Bibliographic record

VenueInternational Journal of Cognitive Informatics and Natural Intelligence · 2007
Typearticle
Languageen
FieldComputer Science
TopicCognitive Computing and Networks
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsComputer scienceInferenceAbstractionProcess (computing)CognitionSet (abstract data type)Artificial intelligenceCognitive scienceCausal inferencePropositional calculusTheoretical computer scienceMachine learningProgramming languageEpistemologyMathematics

Abstract

fetched live from OpenAlex

Theoretical research is predominately an inductive process; while applied research is mainly a deductive process. Both inference processes are based on the cognitive process and means of abstraction. This article describes the cognitive processes of formal inferences such as deduction, induction, abduction, and analogy. Conventional propositional arguments adopt static causal inference. This article introduces more rigorous and dynamic inference methodologies, which are modeled and described as a set of cognitive processes encompassing a series of basic inference steps. A set of mathematical models of formal inference methodologies is developed. Formal descriptions of the four forms of cognitive processes of inferences are presented using Real-Time Process Algebra (RTPA). The cognitive processes and mental mechanisms of inferences are systematically explored and rigorously modeled. Applications of abstraction and formal inferences in both the revilement of the fundamental mechanisms of the brain and the investigation of next generation cognitive computers are explored.

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.020
metaresearch head score (Gemma)0.055
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.020
Threshold uncertainty score0.107

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0200.055
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0040.002
Science and technology studies0.0020.019
Scholarly communication0.0090.018
Open science0.0030.004
Research integrity0.0020.005
Insufficient payload (model declined to judge)0.0060.001

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.017
GPT teacher head0.309
Teacher spread0.292 · 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

Citations63
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Cognitive Informatics and Natural IntelligenceSame topicCognitive Computing and NetworksFrench-language works237,207