MétaCan
Menu
Back to cohort
Record W4400411947 · doi:10.22329/il.v44i2.8358

Sincere and Insincere Arguing

2024· article· en· W4400411947 on OpenAlexvenueno aff
Davide Dalla Rosa, Filippo Mancini

Bibliographic record

VenueInformal Logic · 2024
Typearticle
Languageen
FieldComputer Science
TopicMulti-Agent Systems and Negotiation
Canadian institutionsnot available
Fundersnot available
KeywordsArgumentation theorySinc functionEpistemologyPhilosophyHumanitiesArgument (complex analysis)DialecticSociologyComputer scienceBiology

Abstract

fetched live from OpenAlex

Abstract: In this paper, we contend that there are two ways of arguing, namely sincere and insincere arguing. We draw such a distinction, based on the felicity conditions of the complex speech act of arguing as modelled in van Eemeren and Grootendorst’s pragma-dialectical approach. We introduce a conversa-tional setting, which contains a speech act of arguing that does not count as in-sincere arguing, while being a sui gene-ris form of sincere arguing. We desig-nate it as “cooperative inquiry”. Finally, we show that argument evaluation plays a key role in determining whether an in-stance of arguing counts as either argu-ing sincerely or insincerely. Résumé: Dans cet article, nous affir-mons qu’il existe deux manières d’argu-menter, à savoir l’argumentation sincère et l’argumentation non sincère. Nous établissons une telle distinction, basée sur les conditions de félicité de l’acte de parole complexe consistant à argu-menter, tel que modélisé dans l’ap-proche pragma-dialectique de van Eemeren et Grootendorst. Nous intro-duisons un cadre conversationnel, qui contient un acte de parole d'argumenta-tion qui n'est pas considéré comme une argumentation non sincère, tout en étant une forme sui generis d'argumentation sincère. Nous la désignons comme « enquête coopérative ». Enfin, nous montrons que l’évaluation des argu-ments joue un rôle clé pour déterminer si un cas d’argumentation compte comme une argumentation sincère ou non.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.716
Threshold uncertainty score0.319

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.001
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.020
GPT teacher head0.250
Teacher spread0.230 · 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 designSimulation or modeling
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

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

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