An algebraic characterization of tractable constraints
- 1 January 1995
- book chapter
- Published by Springer Science and Business Media LLC
- p. 633-642
- https://doi.org/10.1007/bfb0030886
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On binary constraint problemsJournal of the ACM, 1994
- Decomposing constraint satisfaction problems using database techniquesArtificial Intelligence, 1994
- Characterising tractable constraintsArtificial Intelligence, 1994
- Fast parallel constraint satisfactionArtificial Intelligence, 1993
- Structure identification in relational dataArtificial Intelligence, 1992
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- A sufficient condition for backtrack-bounded searchJournal of the ACM, 1985
- Consistency in networks of relationsArtificial Intelligence, 1977
- Networks of constraints: Fundamental properties and applications to picture processingInformation Sciences, 1974
- Closed systems of functions and predicatesPacific Journal of Mathematics, 1968