Binary constraint

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

Topic mentions per year

Topic mentions per year

1985-2017
024619852017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
A binary constraint system game is a two-player one-round non-local game defined by a system of Boolean constraints. The game has… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
On the one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming… (More)
  • table 1
Is this relevant?
2008
2008
Constraint networks in qualitative spatial and temporal reasoning are always complete graphs. When one adds an extra element to a… (More)
  • figure 2
  • figure 1
Is this relevant?
2008
2008
GQR (Generic Qualitative Reasoner) is a solver for binary qualitative constraint networks. GQR takes a calculus description and… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
2007
Iterative projection algorithms can be an effective method for solving image reconstruction problems with limited data by… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2005
2005
We present a specialised binary constraint for the stable marriage problem. This constraint acts between a pair of integer… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The concepts of binary constraint satisfaction problems can be naturally generalized to the relation algebras of Tarski. The… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Partitioning a system's functionality among interacting hardware and software components is an important part of system design… (More)
  • figure 1
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
1988
Highly Cited
1988
It is well-known that general constraint satisfaction problems (CSPs) may be reduced to the binary case (BCSPs) Pei92]. CSPs may… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Binary constraint sat is fact ion problems involve f ind ing values for variables subject to constraints between pairs of… (More)
  • figure 2
Is this relevant?