Characterising tractable constraints
- 28 February 1994
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 65 (2) , 347-361
- https://doi.org/10.1016/0004-3702(94)90021-3
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Decomposing constraint satisfaction problems using database techniquesArtificial Intelligence, 1994
- Fast parallel constraint satisfactionArtificial Intelligence, 1993
- From local to global consistencyArtificial Intelligence, 1992
- An optimal k-consistency algorithmArtificial Intelligence, 1989
- Comments on Mohr and Henderson's path consistency algorithmArtificial Intelligence, 1988
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- Arc and path consistency revisitedArtificial Intelligence, 1986
- A sufficient condition for backtrack-bounded searchJournal of the ACM, 1985
- A Sufficient Condition for Backtrack-Free SearchJournal of the ACM, 1982
- Consistency in networks of relationsArtificial Intelligence, 1977