MétaCan
Menu
Back to cohort
Record W1993389173 · doi:10.1109/aamas.2004.18

A Logical Model for Commitment and Argument Network for Agent Communication

2004· article· en· W1993389173 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMulti-Agent Systems and Negotiation
Canadian institutionsUniversité Laval
Fundersnot available
KeywordsDeontic logicArgument (complex analysis)Computer scienceSemantics (computer science)CTL*Logical frameworkTheoretical computer scienceArtificial intelligenceCognitive scienceProgramming languageEpistemologyPsychology

Abstract

fetched live from OpenAlex

In this paper we present a semantics for our approach based on social commitments (SCs) and arguments for conversational agents. More precisely, we propose a logical model based on CTL * and on dynamic logic (DL). Called Commitment and Argument Network, our formal framework based on this approach uses three basic elements: SCs, actions that agents apply to these SCs and arguments that agents use to support their actions. The advantage of this logical model is to bring together all these elements and the relations existing between them within the same framework. Our semantics makes it possible to represent the dynamics of agent communication. It also allows us to establish the important link between SCs as a deontic concept and arguments. CTL * enables us to express the temporal characteristics of SCs and arguments. DL enables us to capture the actions that agents are committed to achieve. 1.

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.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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.839
Threshold uncertainty score0.235

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.077
GPT teacher head0.296
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

Quick stats

Citations43
Published2004
Admission routes1
Has abstractyes

Explore more

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