Constraint satisfaction from a deductive viewpoint
- 31 July 1988
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 35 (3), 401-413
- https://doi.org/10.1016/0004-3702(88)90023-9
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The complexity of some polynomial network consistency algorithms for constraint satisfaction problemsArtificial Intelligence, 1985
- Matings in matricesCommunications of the ACM, 1983
- Consistency in networks of relationsArtificial Intelligence, 1977