Skip to search formSkip to main contentSkip to account menu

Local consistency

Known as: Simplistic algorithm, Directional consistency, Constraint propagation 
In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose… 
Highly Cited
2005
Highly Cited
2005
This paper deals with the problem of safety verification of non-linear hybrid systems. We start from a classical method that uses… 
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… 
1995
1995
  • Moninder Singh
  • 1995
  • Corpus ID: 16327796
One of the main factors limiting the use of path consistency algorithms in real life applications is their high space complexity… 
Highly Cited
1993
Highly Cited
1993
This is a report of the application of the Model Generation Theorem Prover developed at ICOT to problems in the theory of finite… 
Highly Cited
1988
Highly Cited
1988
Schema-based representations for visual knowledge are integrated with constraint satisfaction techniques. This integration is… 
Highly Cited
1988
Highly Cited
1988
The authors present a knowledge-based requirements assistant (KBRA) that is a component of the knowledge-based software assistant… 
Highly Cited
1988
Highly Cited
1988
The authors report on a model-based object recognition system and its parallel implementation on the Connection Machine system…