The formal and processing models of CLG

  • Authors:
  • Luis Damas;Nelma Moreira;Giovanni B. Varile

  • Affiliations:
  • University of Porto, Porto;University of Porto, Porto;Luxembourg

  • Venue:
  • EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.