Argumentative Relations
Edge types in a dialectical graph organized by function
Argumentative relations are the edge types in a Dialectical Graph (see also Graph Components) that encode how epistemic objects relate to each other. They are what distinguish a dialectical graph from a topic-similarity graph.
Challenge Relations
- Attack — direct challenge to a claim's truth
- Undercut — challenge to method, assumption, or definition
- Counterexample — a case that breaks the claim
contradicts— explicit incompatibility
Support Relations
supports— evidence or reasoning that strengthens a claimcites— explicit attribution to a sourcereplicates/fails_to_replicate— replication status
Refinement Relations
refines— narrows or clarifies a claimgeneralizes/specializes— scope adjustmentsdepends_on— links claims to their assumptionsdefines— connects terms to their definitions
See Dialectical Graph Edges for full specification and Relation Typing vs Similarity for why typed edges matter.