## Deterministic Consistency Checking of LP Constraints (1995)

### Cached

### Download Links

- [acl.ldc.upenn.edu]
- [www.aclweb.org]
- [ucrel.lancs.ac.uk]
- [aclweb.org]
- [aclweb.org]
- [aclweb.org]
- [www.cs.york.ac.uk]
- DBLP

### Other Repositories/Bibliography

Citations: | 16 - 4 self |

### BibTeX

@MISC{Manandhar95deterministicconsistency,

author = {Suresh Manandhar},

title = {Deterministic Consistency Checking of LP Constraints},

year = {1995}

}

### OpenURL

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

### Citations

1209 |
Head Driven Phrase Structure Grammar. CSLI/Chicago
- Pollard, Sag
- 1994
(Show Context)
Citation Context ...ning the logic such that it is sufficient for linguistic applications involving word-order. Subject areas: feature logic, constraint based grammars 1 Introduction Within HPSG (Pollard and Sag, 1987) (=-=Pollard and Sag, 1994-=-) the constituent ordering principle given in (1) is intended to express the relation between the value of the phon attribute and the dtrs attribute which contains the hierarchical structure of the de... |

437 | Concurrent Constraint Programming
- Saraswat, Rinard
- 1990
(Show Context)
Citation Context ...g guarded logic programming languages have a longer history originating with committed-choice languages (Ueda, 1985) and popularised by the concurrent constraint programmingsparadigm due to Saraswat (=-=Saraswat and Rinard, 1990-=-) (Saraswat, 1993). For space reasons, we do not cover the logic of guarded feature constraints, guards on set membership constraints and guards on precedence constraints. Guarded feature constraints ... |

333 | The logic of typed feature structures
- Carpenter
- 1992
(Show Context)
Citation Context ...n need to ensure that precedence constraints never have to consider atoms as their values. This can be easily achieved within current typed feature formalisms by employing appropriateness conditions (=-=Carpenter, 1992-=-). An appropriateness condition just states that a given feature (in our case a relation) can only be defined on certain (appropriate) types. The assumption we make is that precedence is specified in ... |

163 |
Information-based syntax and semantics, Volume 1: Fundamentals
- Pollard, Sag
- 1987
(Show Context)
Citation Context ...del is achieved by weakening the logic such that it is sufficient for linguistic applications involving word-order. Subject areas: feature logic, constraint based grammars 1 Introduction Within HPSG (=-=Pollard and Sag, 1987-=-) (Pollard and Sag, 1994) the constituent ordering principle given in (1) is intended to express the relation between the value of the phon attribute and the dtrs attribute which contains the hierarch... |

111 | Introduction to Guarded Horn Clauses
- Ueda
- 1986
(Show Context)
Citation Context ...e thought of as adding guards to feature structures. On the other hand, within logic programming guarded logic programming languages have a longer history originating with committed-choice languages (=-=Ueda, 1985-=-) and popularised by the concurrent constraint programmingsparadigm due to Saraswat (Saraswat and Rinard, 1990) (Saraswat, 1993). For space reasons, we do not cover the logic of guarded feature constr... |

96 | Records for Logic Programming
- Smolka, Treinen
- 1994
(Show Context)
Citation Context ... logic of guarded feature constraints, guards on set membership constraints and guards on precedence constraints. Guarded feature constraints have been extensively studied in (Ait-Kaci et al., 1992) (=-=Smolka and Treinen, 1994-=-) (Ait-Kaci and Podelski, 1994). 4 A feature logic with LP constraints In this section we provide formal definitions for the syntax and semantics of an extended feature logic that directly supports li... |

83 | Feature Constraint Logics for Unification Grammars, IWBS Report 93
- Smolka
- 1989
(Show Context)
Citation Context ...he f-values of x (i.e. is in the p relation with every f-value of x). Since our language supports both feature constraints and set-membership constraints the conventional semantics for feature logic (=-=Smolka, 1992-=-) needs to be extended. The essential difference being that we interpret every feature/relation as a binary relation on the domain of interpretation. Feature constraints then require that they behave ... |

69 | A feature-based constraint system for logic programming with entailment
- Aït-Kaci, Podelski, et al.
- 1994
(Show Context)
Citation Context ...ons, we do not cover the logic of guarded feature constraints, guards on set membership constraints and guards on precedence constraints. Guarded feature constraints have been extensively studied in (=-=Ait-Kaci et al., 1992-=-) (Smolka and Treinen, 1994) (Ait-Kaci and Podelski, 1994). 4 A feature logic with LP constraints In this section we provide formal definitions for the syntax and semantics of an extended feature logi... |

63 | ProFIT: Prolog with features, inheritance and templates
- Erbach
- 1995
(Show Context)
Citation Context ...olving rules can be employed for building an efficient implementation. This is an important requirement for practical systems. Indeed we have successfully extended the ProFIT typed feature formalism (=-=Erbach, 1995) wi-=-th the constructs described in this paper. 2 Outline of an alternative approach To motivate our approach we start with an example on scrambling in German subordinate clauses. (4) da�� that er he e... |

35 |
Getting Things in Order
- Reape
- 1996
(Show Context)
Citation Context ...[LEX+] ! [] However, it is not entirely clear how order constituent is supposed to interpret various linear precedence statements such as LP1. 1.1 Reape's approach The idea taken in Reape's approach (=-=Reape, 1993-=-) is to suggest that word-order is enforced between locally definable word order domains which are ordered sequences of constituents. Word order domains in Reape's approach are totally ordered sequenc... |

23 | An attributive logic of set descriptions and set operations
- Manandhar
- 1994
(Show Context)
Citation Context ... as an unordered sequence (i.e. a set) as defined in (11). (12) NPdom V i dom V i V The essential idea is to use set-valued descriptions to model word-order domains. In particular subset constraints (=-=Manandhar, 1994-=-) are employed to construct larger domains from smaller ones. Thus in example (11) the domain of the verb is constructed by including the domains of the subcategorised arguments (enforced by the const... |

12 | Functions as passive constraints in LIFE
- Aït-Kaci, Podelski
- 1994
(Show Context)
Citation Context ...onstraints, guards on set membership constraints and guards on precedence constraints. Guarded feature constraints have been extensively studied in (Ait-Kaci et al., 1992) (Smolka and Treinen, 1994) (=-=Ait-Kaci and Podelski, 1994-=-). 4 A feature logic with LP constraints In this section we provide formal definitions for the syntax and semantics of an extended feature logic that directly supports linear precedence constraints as... |

9 |
Relational Extensions to Feature Logic: Applications to Constraint Based Grammars
- Manandhar
- 1993
(Show Context)
Citation Context ... semantics of an extended feature logic that directly supports linear precedence constraints as logical primitives. The logic described in this paper is a further development of the one described in (=-=Manandhar, 1993-=-). The syntax of the constraint language is defined by the following BNF definitions. Syntax Let F be the set of relation symbols and let P be the set of irreflexive relation symbols. We shall require... |

5 | Treating free word order in machine translation
- Steinberger
- 1994
(Show Context)
Citation Context ...ir of constituents in the middle field at least one of the conditions should apply otherwise the sentence is considered ungrammatical. A related but more elaborate LP rule mechanism is considered in (=-=Steinberger, 1994-=-). To approximate this complex LP constraint employing the kind of logical machinery described in this paper, we can use a description such as the one given in (15). The definition given in (15) exten... |

4 | Horn extended feature structures: Fast unification with negation and limited disjunction
- Hegner
- 1991
(Show Context)
Citation Context ...ed until more information is available. The application of guarded constraints within computational linguistics has not been well explored. However, the Horn extended feature structures described in (=-=Hegner, 1991-=-) can be thought of as adding guards to feature structures. On the other hand, within logic programming guarded logic programming languages have a longer history originating with committed-choice lang... |

1 | A feature-based constraint system for logic programming with entailment. Research report - AYt-Kaci, Smolka, et al. - 1992 |