MétaCan
Menu
Back to cohort
Record W3123209816 · doi:10.1075/pc.14.1.03wal

Using conversation policies to solve problems of ambiguity in argumentation and artificial intelligence

2006· article· en· W3123209816 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

VenuePragmatics & Cognition · 2006
Typearticle
Languageen
FieldComputer Science
TopicMulti-Agent Systems and Negotiation
Canadian institutionsUniversity of Winnipeg
Fundersnot available
KeywordsAmbiguityArgumentation theoryConversationComputer sciencePersuasionEquivocationIndeterminacy (philosophy)VaguenessTransitive relationEpistemologyThe InternetNegotiationArtificial intelligenceSemantics (computer science)Management scienceLinguisticsWorld Wide WebSociologyFuzzy logicMathematicsPhilosophy

Abstract

fetched live from OpenAlex

This investigation joins recent research on problems with ambiguity in two fields, argumentation and computing. In argumentation, there is a concern with fallacies arising from ambiguity, including equivocation and amphiboly. In computing, the development of agent communication languages is based on conversation policies that make it possible to have information exchanges on the internet, as well as other forms of dialogue like persuasion and negotiation, in which ambiguity is a problem. Because it is not possible to sharply differentiate between problems arising from ambiguity and those arising from vagueness, obscurity and indeterminacy, some study of the latter is included. The semantic web is based on what are called ontologies, or systems of classification of concepts, shown to be useful tools for dealing with these problems.

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: Empirical · Consensus signal: none
Teacher disagreement score0.764
Threshold uncertainty score0.331

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.075
GPT teacher head0.316
Teacher spread0.241 · 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