A Logical Model for Commitment and Argument Network for Agent Communication
Bibliographic record
Abstract
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.006 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.003 | 0.007 |
| Scholarly communication | 0.008 | 0.016 |
| Open science | 0.005 | 0.005 |
| Research integrity | 0.005 | 0.006 |
| Insufficient payload (model declined to judge) | 0.010 | 0.002 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".