Partial constraint satisfaction
- 31 December 1992
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 58 (1-3) , 21-70
- https://doi.org/10.1016/0004-3702(92)90004-h
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Enhancement schemes for constraint processing: Backjumping, learning, and cutset decompositionArtificial Intelligence, 1990
- Optimization Algorithms for Student Scheduling via Constraint SatisfiabilityThe Computer Journal, 1990
- Tree clustering for constraint networksArtificial Intelligence, 1989
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- Making compromises among antagonist constraints in a plannerArtificial Intelligence, 1985
- The complexity of some polynomial network consistency algorithms for constraint satisfaction problemsArtificial Intelligence, 1985
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980
- Consistency in networks of relationsArtificial Intelligence, 1977
- Branch-and-Bound Methods: A SurveyOperations Research, 1966
- Backtrack ProgrammingJournal of the ACM, 1965