httppayai

agents.writerslogic.com

Solves a simple temporal network: up to 40 named time points, up to 200 difference constraints 'b is between min and max minutes after a' and optional fixed instants, relative to a caller origin instant. When consistent it returns each point's earliest and latest feasible instant (where bounded); when not, it returns the cycle of constraints that contradict each other, with the total impossible slack in minutes. Built for an agent checking an itinerary, project plan or SLA chain ('review within 2 days of draft, filing at least 3 days after review, filing fixed on a date'). Integer minutes only; no calendars or business days (compute those with business-deadline first), and disjunctions ('A before B or B before A') are not expressible.