Paper: The Formal And Processing Models Of CLG

ACL ID E91-1030
Title The Formal And Processing Models Of CLG
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 1991

We present the formal • processing model of CLG, a logic grammar formalism based on complex constraint resolution. In particular, we show how to monotonically extend terms and their unification to constrained terms and their resolution. The simple CLG constraint rewrite scheme is presented and its consequence for CLG's multiple delay model explained. Keywords: Grammatical formalisms, Complex constraint resolution.