MétaCan
Menu
Back to cohort
Record W2512497766

Deliberation in agent programming languages

2005· article· en· W2512497766 on OpenAlexaff
Sebastian Sardiña

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicLogic, Reasoning, and Knowledge
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsDeliberationComputer scienceSituation calculusRotation formalisms in three dimensionsArtificial intelligenceAction (physics)Cognitive scienceProgramming languageSoftware engineeringMathematics
DOInot available

Abstract

fetched live from OpenAlex

Research in AI field of Cognitive Robotics is concerned with integrating reasoning, perception, and action within a uniform theoretical and implementation framework. With the flourishing of many formal and powerful formalisms for reasoning about action and change, the next step has been to develop precise specifications of rational agent behaviour and agent deliberation---a formal account of agent activity will make it possible to validate the actual software implementing the behaviour; it will allow us to prove properties of such behaviour; and, ultimately, it will help us understand the whole problem of acting intelligently. This thesis gives a logical foundation for an interleaved agent architecture of perception, deliberation, and execution in the context of the situation calculus, one of the most widely used logical formalism for reasoning about dynamical systems. Special emphasis is placed on the deliberation part and its role within the general framework. We first investigate the expressive power of basic action theories, a well-known axiomatization of the dynamics of the world in the situation calculus, and show that it can accommodate incomplete causal laws and a passive account of sensing. We then pursue an investigation of plan executability/adequacy that is related to both planning and agent programming languages. After that, we develop an integrated architecture of agency where high-level deliberation is just one module. We propose two new planning modules and explain how deliberated plans can be monitored and replanned while executing within the architecture. Finally, we investigate a semantic characterization of the process of deliberation by capturing the class of simple epistemically feasible plans, defining planning modules in terms of these plans, and singling out syntactic sufficient conditions.

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: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.879
Threshold uncertainty score0.205

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.014
GPT teacher head0.266
Teacher spread0.252 · 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 designOther design
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

Citations3
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicLogic, Reasoning, and KnowledgeFrench-language works237,207