arc-consistency

Concept

In the provided source, arc-consistency is the domain-propagation technique reapplied during labeling: when a variable is fixed, its effects are propagated to other variable domains. The same source places this propagation in the STCS constraint solver, which uses coordinated interval and bit-based domain representations.

First seen 5/31/2026

Last seen 6/5/2026

Evidence 1 chunks

Wiki v1

WIKI

arc-consistency

Overview

In the provided source, arc-consistency is described through its role in constraint propagation during search. In the labeling phase, the solver iteratively grounds variables (fixes a value for a variable) and then propagates the effect of that choice on other variable domains by applying the same arc-consistency techniques again.

Role in labeling

The source presents labeling as an iterative cycle of:

READ FULL ARTICLE →

NEIGHBORHOOD

No graph connections found for this entity yet. It may appear in future ingestion runs.

explore full graph →

RELATIONSHIPS

2 connections

STCS ← implements 90% 3e

STCS implements arc consistency techniques for constraint propagation.

Code-based Test Generation for Validation of Functional Processor Descriptions ← uses 90% 2e

The constraint solver uses arc consistency techniques for domain reduction.

LINKED ENTITIES

1 links

STCS IMPLEMENTS Extracted graph relationship

CITATIONS

3 sources

3 citations — click to collapse

[1] During labeling, the solver grounds variables and propagates the effects on other variable domains by applying arc-consistency techniques again. Fabrice.Baray,Henri.Michel

[2] The labeling phase can be improved using heuristics for variable ordering and value ordering. Fabrice.Baray,Henri.Michel

[3] STCS is a dedicated constraint solver introduced to improve efficiency, using interval and bit representations with coordinated propagation between them. Fabrice.Baray,Henri.Michel