Deterministic Consistency Checking of LP Constraints

Details Deterministic Consistency Checking of LP Constraints Deterministic Consistency Checking of LP Constraints

1995-02-14

arxiv.org/abs/cmp-lg/9502017v2

Computer Science

Computation and Language

EACL'95, 8 pages, LaTeX, eepic.sty, epsf.sty, eaclap.sty, figures - tar-ed, gzip-ed, uuencode-d

Scientific paper

We provide a constraint based computational model of linear precedence as employed in the HPSG grammar formalism. An extended feature logic which adds a wide range of constraints involving 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 applications involving word-order.

Affiliated with

Also associated with

No associations

Rating

Deterministic Consistency Checking of LP Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deterministic Consistency Checking of LP Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic Consistency Checking of LP Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-106163