Advertisement

A substitution operation for constraints

  • Peter Jeavons
  • David Cohen
  • Martin Cooper
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 874)

Abstract

In order to reduce the search space in finite constraint satisfaction problems, a number of different preprocessing schemes have been proposed. This paper introduces a ‘substitution’ operation for constraints. This new operation generalizes both the idea of enforcing consistency and the notion of label substitution introduced by Freuder. We show that the constraints in a problem may be replaced by substitutable subsets in order to simplify the problem without affecting the existence of a solution. Furthermore, we show how substitutability may be established locally, by considering only a subproblem of the complete problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Codd, E.F., “A Relational Model of Data for Large Shared Databanks”, Communications of the ACM 13 (1970), pp. 377–387.Google Scholar
  2. 2.
    Cooper, M.C., “An optimal k-consistency algorithm”, Artificial Intelligence 41 (1990), pp. 89–95.Google Scholar
  3. 3.
    Cooper, M.C., Visual Occlusion and the Interpretation of Ambiguous Pictures, Ellis Horwood, 1992.Google Scholar
  4. 4.
    Cooper, M.C., Cohen, D.A., and Jeavons, P.G., “Characterizing Tractable Constraints”, Artificial Intelligence 66 (1994), pp. 347–361.Google Scholar
  5. 5.
    Freuder, E.C., “Synthesising Constraint Expressions”, Communications of the ACM 21 (1978), pp. 958–966.Google Scholar
  6. 6.
    Freuder, E.C., “Eliminating interchangeable values in constraint satisfaction problems”, Proceedings of AAAI-91, pp. 227–233.Google Scholar
  7. 7.
    Mackworth, A.K., “Consistency in Networks of Relations”, Artificial Intelligence 8 (1977), pp. 99–118.Google Scholar
  8. 8.
    Mackworth, A.K., and Freuder, E.C., “The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems”, Artificial Intelligence 25 (1984), pp. 65–47.Google Scholar
  9. 9.
    Mohr, R., and Henderson, T.C., “Arc and Path Consistency Revisited”, Artificial Intelligence 28 (1986), pp. 225–233.Google Scholar
  10. 10.
    Montanari, U., “Networks of Constraints: Fundamental Properties and Applications to Picture Processing”, Information Sciences 7 (1974), pp. 95–132.Google Scholar
  11. 11.
    Waltz, D.L. “Understanding Line Drawings of Scenes with Shadows”, in The Psychology of Computer Vision, Winston, P.H., (Ed.), McGraw-Hill, New York, (1975), pp. 19–91.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Peter Jeavons
    • 1
  • David Cohen
    • 1
  • Martin Cooper
    • 2
  1. 1.Department of Computer ScienceRoyal Holloway, University of LondonUK
  2. 2.IRITUniversity of Toulouse IIIFrance

Personalised recommendations