Live briefing
Everything about Local consistency
In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables or constraints. They can be used to reduce the search space and make the problem easier to solve. Various kinds of local consistency conditions are leveraged, including node consistency, arc consistency, and path consistency. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Local consistencyA 5-minute orientation
- Skim a recent paper: Weakly-supervised semantic segmentation with superpixel guided local and global consistencyInfluential work since 2022
- Pick up a classic book: Centenary of the Borel ConjectureThe most-reprinted book on the subject
- Read the landmark paper: From local to global consistencyCited 113 times
- Go sideways: Look-ahead (backtracking)A closely related topic
- Go sideways: Complexity of constraint satisfactionA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
From local to global consistency
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Local and global relational consistency
Gaussian Mixture Model with Local Consistency
Multiview Metric Learning with Global Consistency and Local Smoothness
Robust feature point matching by preserving local geometric consistency
Hemispherical asymmetry and local non-Gaussianity: A consistency condition
The Foresight Effect: Local Optimism Motivates Consistency and Local Pessimism Motivates Variety
🆕 Influential since 2022
Weakly-supervised semantic segmentation with superpixel guided local and global consistency
Imposing Semantic Consistency of Local Descriptors for Few-Shot Learning
Adaptive Local Structure Consistency-Based Heterogeneous Remote Sensing Change Detection
Infrared Small Target Detection Using Local Component Uncertainty Measure With Consistency Assessment
Domain Adaptive Land-Cover Classification via Local Consistency and Global Diversity
📚 Books worth reading
- 📕Centenary of the Borel ConjectureMarion Scheepers, Ondrej Zindulka · 2020
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Look-ahead (backtracking) In backtracking algorithms, look ahead is the generic term for a subprocedure that attempts to foresee the effects of choosing a branching variable to…
- Complexity of constraint satisfaction The complexity of constraint satisfaction is the application of computational complexity theory to constraint satisfaction. It has mainly been studied…
- Constraint programming Constraint programming (CP) is a paradigm for solving combinatorial problems that draws on a wide range of techniques from artificial intelligence, computer…
- Constraint logic programming Constraint logic programming is a form of constraint programming, in which logic programming is extended to include concepts from constraint satisfaction…
- Hybrid algorithm (constraint satisfaction) Within artificial intelligence and operations research for constraint satisfaction a hybrid algorithm solves a constraint satisfaction problem by the combinatio…
- Constraint satisfaction problem Constraint satisfaction problems (CSPs) are mathematical questions defined as a set of objects whose state must satisfy a number of constraints or limitations…
- Decomposition method (constraint satisfaction) In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary…
- AC-3 algorithm In constraint satisfaction, the AC-3 algorithm (short for Arc Consistency Algorithm #3) is one of a series of algorithms used for the solution of constraint…