MétaCan
Menu
Back to cohort
Record W4205963486 · doi:10.22215/etd/2021-14636

Performance Analysis of the Jason Reasoning Cycle

2021· dissertation· en· W4205963486 on OpenAlexafffund
Jason Miller

Bibliographic record

Venuenot available
Typedissertation
Languageen
FieldComputer Science
TopicMulti-Agent Systems and Negotiation
Canadian institutionsCarleton University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceInterpreterRobotMeasure (data warehouse)Execution timeArtificial intelligenceOrder (exchange)Programming languageData mining

Abstract

fetched live from OpenAlex

Jason is a popular interpreter of AgentSpeak(L) that provides an environment to develop and run autonomous agents. We are interested in determining if Jason can be used to develop autonomous robots that can be run on modern hardware. To this end, we determined the time complexity of each of the ten steps of the Jason reasoning cycle and used that complexity to help us identify what parameters could be changed to have the biggest effect on the execution time of the reasoning cycle.

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 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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.467
Threshold uncertainty score0.298

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
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.010
GPT teacher head0.246
Teacher spread0.237 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designObservational
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

Citations2
Published2021
Admission routes2
Has abstractyes

Explore more

Same topicMulti-Agent Systems and NegotiationFrench-language works237,207