CLG(n): Constraint Logic Grammars

13 years 5 months ago

Download acl.ldc.upenn.edu

: CLG(2) is the latest member of a family of grammar formalisms centered around the notion of complex constraint expression for describing phrasal and iexical information and principles of language. Complex constrains can be expressed in a slightly restriced form of first order predicate logic, which makes CLG(2) well suited for expressing, amongst others, HPSG-style of grammars. A sound implementation of the formal semantics of CLG(2) is achieved'by resorting to delayed evaluation of non equational constraints.

Sergio Balari, Giovanni B. Varile, Luís Dam

Real-time Traffic

COLING 1990 | COLING 2008 | Complex Constraint Expression | Non Equational Constraints | Order Predicate Logic |

claim paper

Related Content

» The Theory of Grammar Constraints

» Translating a Unification Grammar with Disjunctions into Logical Constraints

» Interleaving Universal Principles and Relational Constraints over Typed Feature Logic

» Learning Constraint Grammarstyle Disambiguation Rules using Inductive Logic Programming

» Learning Stochastic Logic Programs

» Expressing Disjunctive and Negative Feature Constraints with Classical FirstOrder Logic

» Flow Logics for Constraint Based Analysis

» On Anaphora and the Binding Principles in Categorial Grammar

» Integrating the Specification Techniques of Graph Transformation and Temporal Logic

Post Info
More Details (n/a)

Added	07 Nov 2010
Updated	07 Nov 2010
Type	Conference
Year	1990
Where	COLING
Authors	Sergio Balari, Giovanni B. Varile, Luís Damas, Nelma Moreira

Comments (0)

Sciweavers

CLG(n): Constraint Logic Grammars

COLING 1990 | COLING 2008 | Complex Constraint Expression | Non Equational Constraints | Order Predicate Logic |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers