An algebraic characterization of tractable constraints
From MaRDI portal
(Redirected from An algebraic characterization of tractable constraints)
Recommendations
Cites work
- A generic arc-consistency algorithm and its specializations
- A sufficient condition for backtrack-bounded search
- Characterising tractable constraints
- Closed systems of functions and predicates
- Consistency in networks of relations
- Constraint relaxation may be perfect
- Decomposing constraint satisfaction problems using database techniques
- Fast parallel constraint satisfaction
- scientific article; zbMATH DE number 3853164 (Why is no real title available?)
- scientific article; zbMATH DE number 3972930 (Why is no real title available?)
- scientific article; zbMATH DE number 3977070 (Why is no real title available?)
- scientific article; zbMATH DE number 3987347 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Network-based heuristics for constraint-satisfaction problems
- Networks of constraints: Fundamental properties and applications to picture processing
- On binary constraint problems
- Structure identification in relational data
- The complexity of satisfiability problems
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- Tractable constraints on ordered domains
Cited in
(2)
This page was built for publication: An algebraic characterization of tractable constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085763)