A unifying framework for tractable constraints
Data up to Jan 2025
Total Citations Per Year
Abstract
References (21)
A relational model of data for large shared data banks
1970 • 4,964 citations
A relational model of data for large shared data banks
1983 • 4,949 citations
Introduction to Lattices and Order
2002 • 4,878 citations
Consistency in networks of relations
1977 • 2,477 citations
The complexity of satisfiability problems
1978 • 1,763 citations
Networks of constraints: Fundamental properties and applications to picture processing
1974 • 1,283 citations
Network-based heuristics for constraint-satisfaction problems
1987 • 575 citations
Network-Based Heuristics for Constraint-Satisfaction Problems
1988 • 466 citations
A generic arc-consistency algorithm and its specializations
1992 • 400 citations
A sufficient condition for backtrack-bounded search
1985 • 280 citations
Clones in universal algebra
1986 • 212 citations
On binary constraint problems
1994 • 193 citations
Decomposing constraint satisfaction problems using database techniques
1994 • 180 citations
Tractable constraints on ordered domains
1995 • 167 citations
On the minimality and global consistency of row-convex constraint networks
1995 • 136 citations
Structure identification in relational data
1992 • 135 citations
Characterising tractable constraints
1994 • 123 citations
Constraint relaxation may be perfect
1991 • 88 citations
Fast parallel constraint satisfaction
1993 • 79 citations
On the minimality and decomposability of constraint networks
1992 • 38 citations
An algebraic characterization of tractable constraints
1995 • 24 citations