Consistency in Networks of Relations¶
Mackworth, A. K. (1977). Consistency in Networks of Relations. Artificial Intelligence, 8(1), 99-118.
Cited by¶
3 citations across 3 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Constraint
- … inequality constraints and remaining the foundational result of modern optimization theory; Rockafellar's 1970 Convex Analysis consolidated the theory of convex constraints and the duality between feasible sets and supporting hyperplanes; Montanari's 1974 formalization and Mackworth's 1977 arc-consistency algorithms
This sourceIntroduces AC-1, AC-3 arc-consistency algorithms. Consolidated treatment: Rossi, van Beek, and Walsh, eds. Handbook of Constraint Programming (Elsevier, 2006).
- … inequality constraints and remaining the foundational result of modern optimization theory; Rockafellar's 1970 Convex Analysis consolidated the theory of convex constraints and the duality between feasible sets and supporting hyperplanes; Montanari's 1974 formalization and Mackworth's 1977 arc-consistency algorithms
Mechanisms¶
- Constraint Satisfaction Search
- Build the constraint graph and propagate. Every time a value is fixed or eliminated, tighten the domains of neighboring variables — arc-consistency techniques kill doomed branches before they are ever searched.
This sourceDevelops arc-consistency algorithms that propagate domain-value eliminations through neighboring constraints before backtracking search constructs a complete solution.
- Build the constraint graph and propagate. Every time a value is fixed or eliminated, tighten the domains of neighboring variables — arc-consistency techniques kill doomed branches before they are ever searched.
- Constraint-Satisfaction Solver Pass
- Conflict detection is close to free, because a contradiction shows up as a domain wipeout during propagation
This sourceShows how local consistency propagation can expose an inconsistent constraint network before exhaustive backtracking search.
- Conflict detection is close to free, because a contradiction shows up as a domain wipeout during propagation
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. Neither this nor any other of the 3 citations of this work carries a recorded support check.
Was it audited? Yes. A second, independent pass read the citation against the article text and recorded a verdict.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:ef372a190652 · see in the full table