On Binary Constraint Networks

@inproceedings{Ladkin1988OnBC,
  title={On Binary Constraint Networks},
  author={Peter B. Ladkin and Roger D. Maddux},
  year={1988}
}
It is well-known that general constraint satisfaction problems (CSPs) may be reduced to the binary case (BCSPs) Pei92]. CSPs may be represented by binary constraint networks (BCNs), which can be represented by a graph with nodes for variables for which values are to be found in the domain of interest, and edges labelled with binary relations between the values, which constrain the choice of solutions to those which satisfy the relations (e.g. Mac77]). We formulate networks and algorithms in a… CONTINUE READING
Highly Cited
This paper has 84 citations. REVIEW CITATIONS
52 Citations
1 References
Similar Papers

Citations

Publications citing this paper.

85 Citations

0510'86'93'01'09'17
Citations per Year
Semantic Scholar estimates that this publication has 85 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

On the Calculus of Relations

  • A. Tar41 Tarki
  • Journal of Symbolic Logic
  • 1941

Similar Papers

Loading similar papers…