Paper: Deterministic Consistency Checking Of LP Constraints

ACL ID E95-1023
Title Deterministic Consistency Checking Of LP Constraints
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 1995
Authors

We provide a constraint based compu- tational model of linear precedence as employed in the HPSG grammar formal- ism. An extended feature logic which adds a wide range of constraints involv- ing precedence is described. A sound, complete and terminating deterministic constraint solving procedure is given. Deterministic computational model is achieved by weakening the logic such that it is sufficient for linguistic appli- cations involving word-order.