Overview

Prüft das behauptete größte pfadkonsistente Relationen-Refinement eines qualitativen Allen-Intervallnetzes oder dessen gefundene Leerkontradiktion, bevor ein Agent Domänenbeschränkungen übernimmt; ohne globale Erfüllbarkeits- oder Realzeitbehauptung.

Protocol x402 (POST)
Price $0.0030
Payment Asset USD Coin
Payment Network eip155:8453
Category uncategorized
Provider detect
Source bazaar
Indexed 2026-11-02 17:26:22

Health

Status unknown
Latency (p50) —
Uptime (30d) —
Reliability Score —
Last Checked Never
Last Healthy Never
Consecutive Failures 0

x402 Payment Validation

Payment Requirements —
Asset Verified —
Facilitator —

Input Schema

{ "body": { "artifact": { "claimed_refinement": null, "claims": { "constraints": 3, "contradiction_found": true, "variables": 3 }, "constraints": [ { "from": 0, "relations": [ "before" ], "to": 1 }, { "from": 1, "relations": [ "before" ], "to": 2 }, { "from": 2, "relations": [ "before" ], "to": 0 } ], "variables": 3 } }, "bodyType": "json", "method": "POST", "type": "http" }

Output Schema

{ "example": { "billable": true, "findings": [ { "confidence": 100, "evidence": [], "limits": [ "Allen Maintaining Knowledge about Temporal Intervals1983 §IV:13proper-interval basic relations, converses and relation-set composition/intersection propagation to path-consistency fixedpoint. Own bitset propagation/dual edges and own compiled composition table generated from all3375triples of proper intervals over6ranks; no interval/CSP SDK or final solver wrapper.", "Only greatest path-consistency REFINEMENT is claimed. A found emptyrelation proves contradiction; claimed_refinement must then be explicitlynull. If no contradiction found, this doesNOTprove global satisfiability, produce endpoint times, find all global solutions or assert chronological fact. General disjunctive Allen networks can be path-consistent yet unsatisfiable.", "Closed full network1..8variables,64constraints, all13relations supported; unspecified pair universal, selfequal, duplicate constraints conjunctive, relation lists set semantics. Constraints tighten both converses. Claimmatrix NxN relation lists is compared exactly; null onconsistentnetwork disagrees and nonnull oncontradiction disagrees, no skipped claim checking.", "Own algorithm bound1000000atomic composition-table unions/request and4096cached maskpairs; exceeding makes whole finding unknown, never partialknownrefinement. Unknown input relation names outside13codes or malformed/outofresourceprofile also unknown. No separate atomic-only/ORDHorn/format/version variants.", "Only bounded variable/constraint counts and bools output. No network/relationstrings, actualrefinement, endpoints, userclaimliterals or exceptions echoed, including false phone/email-valued claimed relation names/counts. No schedule, identity/security/legal judgement." ], "module": "allen-interval-algebra-path-consistency-refinement", "state": "not_observed", "value": { "claim_mismatches": 0, "claims_match": true, "constraints": 3, "contradiction_found": true, "refinement_claim_matches": true, "variables": 3 }, "warnings": [] } ], "known_count": 1, "scope": { "contact_values_returned": false, "network": false, "supplied_artifact_only": true }, "warnings": [] }, "type": "json" }