Implicit in the work above is the idea that computational semantics naturally fits into the class of problems for which these types of constraint satisfaction techniques apply. We will introduce and discuss the notion of ``local inter-dependence.'' We will show that natural language semantics fits this notion well. We will examine the effect of ``long-distance dependencies'' on this type of processing. We will look at the class of problems for which the methods described above do not work well and show that computational semantics typically does not conform to such problems. Finally, we will argue that the methods presented here are general enough for use in many AI search problems.