MétaCan
Menu
Back to cohort
Record W1977983630 · doi:10.4018/ijssci.2013040103

A Formal Knowledge Retrieval System for Cognitive Computers and Cognitive Robotics

2013· article· en· W1977983630 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Journal of Software Science and Computational Intelligence · 2013
Typearticle
Languageen
FieldComputer Science
TopicCognitive Computing and Networks
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsComputer scienceKnowledge baseCognitive roboticsArtificial intelligenceProcess (computing)CognitionSet (abstract data type)Cognitive modelRoboticsKnowledge retrievalCognitive computingHuman–computer interactionKnowledge extractionRobotProgramming language

Abstract

fetched live from OpenAlex

Intelligent knowledge base theories and technologies are fundamentally centric in machine learning and cognitive robotics. This paper presents the design of a formal knowledge retrieval system (FKTS) for intelligent knowledge base modeling and manipulations based on concept algebra. In order to rigorously design and implement FKTS, real-time process algebra (RTPA) is adopted to formally describe the architectures and behaviors of FKTS. The architectural model of FKTS in the form of a set of unified structure models (USMs) is rigorously described. On the basis of USMs, functional models of FKTS are hierarchically refined by a set of unified process models (UPMs). The UPMs of FFTS are divided into two subsystems known as those of the knowledge visualization and knowledge base retrieval subsystems where the content-addressed searching mechanism is implemented in knowledge bases manipulations. The FKTS system is design and implemented as a part of the cognitive learning engine (CLE) for cognitive computers and cognitive robots.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.950
Threshold uncertainty score0.739

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.024
GPT teacher head0.303
Teacher spread0.278 · 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