STR-003
Hard constraint
layer: paragraph
Support consequential claims
IF a paragraph makes a consequential factual claim, THEN provide evidence, cite it, qualify it, or remove the claim ELSE retain.
Why the rule exists
Claim strength must not exceed available support.
Condition
The rule fires when this evaluates true. Paths marked below must be present in the fact base; the engine reports the rest rather than guessing them.
- ALL
- paragraph.claim.type eq "factual"
- paragraph.claim.consequence in [medium, high]
- paragraph.claim.support_status neq "adequate"
Facts this rule reads
| Path | Source |
|---|---|
paragraph.claim.type |
You supply it |
paragraph.claim.consequence |
You supply it |
paragraph.claim.support_status |
You supply it |
Then
- request_evidence — target
paragraph.claim - qualify — target
paragraph.claim - delete — target
paragraph.claim
Else
- retain — target
current_text, No triggering condition is present.
LAKA
- Smallest sufficient intervention
- Yes
- Primary axes
Sources
-
Technical Communication — Mike Markel; Stuart A. Selber
Audience, design, ethics, research, and technical genres. -
Advertising and Marketing Basics — U.S. Federal Trade Commission
link
Advertising claims must be truthful, non-deceptive, fair, and appropriately substantiated. -
Advertising Substantiation Policy Statement — U.S. Federal Trade Commission
link
Objective claims require a reasonable evidentiary basis before dissemination.
The raw rule record
Verbatim from 10-paragraph-document-rules.json. Also available at /v1/rules/STR-003.
{
"id": "STR-003",
"name": "Support consequential claims",
"domain": "structure",
"layer": "paragraph",
"strength": "hard_constraint",
"human_logic": "IF a paragraph makes a consequential factual claim, THEN provide evidence, cite it, qualify it, or remove the claim ELSE retain.",
"when": {
"all": [
{
"path": "paragraph.claim.type",
"operator": "eq",
"value": "factual"
},
{
"path": "paragraph.claim.consequence",
"operator": "in",
"value": [
"medium",
"high"
]
},
{
"path": "paragraph.claim.support_status",
"operator": "neq",
"value": "adequate"
}
]
},
"then": [
{
"action": "request_evidence",
"target": "paragraph.claim"
},
{
"action": "qualify",
"target": "paragraph.claim",
"when": "partial_evidence"
},
{
"action": "delete",
"target": "paragraph.claim",
"when": "unsupported"
}
],
"else": [
{
"action": "retain",
"target": "current_text",
"reason": "No triggering condition is present."
}
],
"unless": [],
"because": "Claim strength must not exceed available support.",
"diagnostics": [],
"examples": {},
"source_ids": [
"BK-026",
"WEB-012",
"WEB-013"
],
"laka": {
"smallest_sufficient_intervention": true,
"primary_axes": [
"scope",
"depth",
"magnitude",
"reversibility"
]
}
}
Other structure rules
- STR-001 One controlling move per paragraph IF a paragraph performs more than one unrelated rhetorical move, THEN split it at the move boundary ELSE retain. Context default
- STR-002 Expose the paragraph point IF the paragraph’s controlling point is absent or recoverable only after rereading, THEN state or move it to a strategic position ELSE retain an intentional delayed reveal. Heuristic
- STR-004 Keep evidence beside the claim IF evidence is separated from the claim it supports by unrelated material, THEN move it closer or label the relation ELSE retain. Context default
- STR-005 Use transitions that name the relation IF adjacent paragraphs have a meaningful but unstated relation, THEN add a transition that expresses that relation ELSE retain. Context default
- STR-006 Delete orphan paragraphs IF a paragraph neither advances the purpose nor supports another necessary move, THEN delete or relocate it ELSE retain. Heuristic
- STR-007 Section answers one reader question IF a section answers multiple unrelated reader questions, THEN split and label them ELSE retain. Context default
- STR-008 Heading predicts content IF a heading does not accurately predict its section, THEN rename the heading or repair the section ELSE retain. Hard constraint
- STR-009 Maintain heading hierarchy IF heading levels skip or reflect visual size rather than logical nesting, THEN repair the hierarchy ELSE retain. Hard constraint