Deterministic Consistency Checking of LP Constraints
<|reference_start|>Deterministic Consistency Checking of LP Constraints: 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.<|reference_end|>
@article{manandhar1995deterministic,
    title={Deterministic Consistency Checking of LP Constraints},
    author={Suresh Manandhar},
    journal={arXiv preprint arXiv:cmp-lg/9502017},
    year={1995},
    archivePrefix={arXiv},
    eprint={cmp-lg/9502017},
    primaryClass={cmp-lg cs.CL}
}