Deterministic Consistency Checking of LP Constraints

Suresh Manandhar

doi:10.3115/976973.976997

Deterministic Consistency Checking of LP Constraints

Suresh Manandhar

Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

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.

Original language	Undefined/Unknown
Pages	165-172
DOIs	https://doi.org/10.3115/976973.976997
Publication status	Published - 1995

Access to Document

10.3115/976973.976997

http://ucrel.lancs.ac.uk/acl/E/E95/E95-1023.pdf

Cite this

@conference{1515bfa9df334bbcb372d899760cc3b2,

title = "Deterministic Consistency Checking of LP Constraints",

abstract = "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.",

author = "Suresh Manandhar",

year = "1995",

doi = "10.3115/976973.976997",

language = "Undefined/Unknown",

pages = "165--172",

}

TY - CONF

T1 - Deterministic Consistency Checking of LP Constraints

AU - Manandhar, Suresh

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

U2 - 10.3115/976973.976997

DO - 10.3115/976973.976997

M3 - Paper

SP - 165

EP - 172

ER -