In this paper, I demonstrate how complex cases of definite reference resolution can be processed within the independently motivated framework of time-constrained memory, and, most importantly, without having to resort to the complex mechanisms assumed by Haddock (1987). The key idea of the solution is to initiate a referent search for the complex definite N P formed by the attachment of a prepositional phrase to a definite noun phrase.
