Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,682,152 papers from all fields of science
Search
Sign In
Create Free Account
Binary constraint
A binary constraint, in mathematical optimization, is a constraint that involves exactly two variables. For example, consider the n-queens problem…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Complexity of constraint satisfaction
Constraint satisfaction dual problem
Decomposition method (constraint satisfaction)
List of numerical analysis topics
Expand
Broader (1)
Constraint programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Solving Qualitative Constraints Involving Landmarks
W. Liu
,
Sheng-sheng Wang
,
Sanjiang Li
,
Da-you Liu
International Conference on Principles and…
2011
Corpus ID: 25791256
Consistency checking plays a central role in qualitative spatial and temporal reasoning. Given a set of variables V, and a set of…
Expand
2004
2004
Characterization of a New Restart Strategy for Randomized Backtrack Search
Venkata Praveen Guddeti
,
B. Choueiry
ERCIM Annual Workshop on Constraint Solving and…
2004
Corpus ID: 6815148
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other…
Expand
2003
2003
Evolving binary constraint satisfaction problem instances that are difficult to solve
Jano van Hemert
The Congress on Evolutionary Computation, . CEC…
2003
Corpus ID: 6279348
We present a study on the difficulty of solving binary constraint satisfaction problems where an evolutionary algorithm is used…
Expand
2003
2003
Solving Non-Binary Constraint Satisfaction Problem
Sun Ji
2003
Corpus ID: 123988655
Most of the research on constraint satisfaction problems (CSPs) concentrates on binary constraints, however, non-binary…
Expand
1999
1999
Optimal Distributed Arc-Consistency
Youssef Hamadi
Constraints
1999
Corpus ID: 8968512
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our…
Expand
Highly Cited
1999
Highly Cited
1999
Non-Binary Constraints
C. Bessiere
International Conference on Principles and…
1999
Corpus ID: 17964046
Since the origins of the constraint satisfaction paradigm, its restriction to binary constraints has concentrated a significant…
Expand
Review
1995
Review
1995
Ternary relationship decomposition strategies based on binary imposition rules
I. Song
,
Trevor H. Jones
Proceedings of the Eleventh International…
1995
Corpus ID: 43199601
We review a set of rules identifying which combinations of ternary and binary relationships can be combined simultaneously in…
Expand
1992
1992
A Symbolic Approach to Interval Constraint Problems
P. Ladkin
,
A. Reinefeld
AISMC
1992
Corpus ID: 40733115
We report on a symbolic approach to solving constraint problems, which uses relation algebra. The method gives good results for…
Expand
Highly Cited
1989
Highly Cited
1989
Object recognition based on graph matching implemented by a Hopfield-style neural network
W. Li
,
N. Nasrabadi
International Joint Conference on Neural…
1989
Corpus ID: 9560295
A model-based object recognition technique is presented. For each model, distinct features such as curvature points are extracted…
Expand
Highly Cited
1989
Highly Cited
1989
On binary constraint networks
P. Ladkin
,
R. Maddux
1989
Corpus ID: 15734721
It is well-known that general constraint satisfaction problems (CSPs) may be reduced to the binary case (BCSPs) [Pei92]. CSPs may…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE