Weekend hours would serve people who cannot visit during the working week.
Challenges: none declared.
Write the claims, show which ones challenge others, and explore the formal alternatives. The analysis follows your arrows; it does not read between the lines or decide who is right.
Your claims and challenges are ready to analyze. Save your map before starting over; New discussion asks before replacing it.
Weekend hours would serve people who cannot visit during the working week.
Challenges: none declared.
Adding an opening day without changing the rota would stretch the existing team.
Challenges: [A] Open the library on Sundays..
A proposed staffing allocation challenges the claim that Sunday opening cannot be staffed.
Challenges: [B] The current staffing plan cannot cover it..
The proposal has no guaranteed funding after its first year. This challenges the proposed rota as a lasting answer.
Challenges: [C] A funded rota can cover the extra day..
FORMAL POSITIONS
The least complete position: begin with no accepted arguments and repeatedly add those whose attackers are all counter-attacked. Always one position; it may be empty.
Analyze it to enumerate positions exactly. Editing an argument or challenge clears outdated results.
The engine enumerates every subset inside each weakly connected component, then combines local families as a Cartesian product. It keeps factors and exact integer counts instead of materializing the global family. Position order is deterministic: ASCII-sorted IDs, components sorted by first ID, local masks ascending, last component varying fastest.
Limits: 64 arguments total, 18 per connected component, 256 directed challenges and 256 KiB per portable map. No sampling or truncation.
KEEP THE ASSUMPTIONS VISIBLE
Try a circular disagreement, remove a challenge, or build a map of your own. A formal answer is only as useful as the discussion it leaves room for.
Nothing is uploaded or autosaved. Download your map before closing this tab. A report includes the committed map, full local extension factors, exact counts and the selected position—not a materialized list of every global position.
Based on Dung’s abstract argumentation framework. Challenges are binary and directed: the engine does not model support, argument strength, preferences, missing evidence or probabilities. An OUT label does not mean false; IN does not mean true.
Dung (1995) · Caminada & Gabbay (2009) · Compact argumentation frameworks (2014)
References open only when you choose them. There is no account, analytics, AI key or server-side map storage. This is an educational reasoning tool, not an authority on the truth or worth of anyone’s views.