Skip to search formSkip to main contentSkip to account menu

Binary constraint

A binary constraint, in mathematical optimization, is a constraint that involves exactly two variables. For example, consider the n-queens problem… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Consistency checking plays a central role in qualitative spatial and temporal reasoning. Given a set of variables V, and a set of… 
2004
2004
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other… 
2003
2003
  • Jano van Hemert
  • 2003
  • Corpus ID: 6279348
We present a study on the difficulty of solving binary constraint satisfaction problems where an evolutionary algorithm is used… 
2003
2003
  • Sun Ji
  • 2003
  • Corpus ID: 123988655
Most of the research on constraint satisfaction problems (CSPs) concentrates on binary constraints, however, non-binary… 
1999
1999
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our… 
Highly Cited
1999
Highly Cited
1999
Since the origins of the constraint satisfaction paradigm, its restriction to binary constraints has concentrated a significant… 
Review
1995
Review
1995
We review a set of rules identifying which combinations of ternary and binary relationships can be combined simultaneously in… 
1992
1992
We report on a symbolic approach to solving constraint problems, which uses relation algebra. The method gives good results for… 
Highly Cited
1989
Highly Cited
1989
A model-based object recognition technique is presented. For each model, distinct features such as curvature points are extracted… 
Highly Cited
1989
Highly Cited
1989
It is well-known that general constraint satisfaction problems (CSPs) may be reduced to the binary case (BCSPs) [Pei92]. CSPs may…