We investigate the use of a technique developed in the constraint programming community called constraint propagation to automatically make a hpsg theory more speciic at those places where linguistically motivated underspeciication would lead to ineecient processing. We discuss two concrete hpsg examples showing how oo-line constraint propagation helps improve processing eeciency.

A large class of problems in AI and other areas of computer science can be viewed as constraintsatisfaction problems. This includes problems in database query optimization, machine vision, belief maintenance, scheduling, temporal reasoning, type reconstruction, graph theory, and satisfiability. All of these problems can be recast as questions regarding the existence of homomorphisms between two...

We investigate the use of a technique developed in the constraint programming community called constraint propagation to automatically make a hpsg theory more speciic at those places where linguistically motivated underspeciication would lead to ineecient processing. We discuss two concrete hpsg examples showing how oo-line constraint propagation helps improve processing eeciency.

This paper presents a screw theory based approach for the analysis and synthesis of flexible joints using wire and sheet flexures. The focus is on designing flexure systems that have a simple geometry, i.e., a parallel constraint pattern. We provide a systematic formulation of the constraint-based approach, which has been mainly developed by precision engineering experts in designing precision ...

Privacy has been a major concern for agents in distributed constraint reasoning. In this work, we approach this issue in distributed constraint reasoning by letting agents compromise solution quality for preserving privacy, using utility theory. We formalize privacy in the context of distributed constraint reasoning, detail its different aspects, and present model and solvers, as well as their ...

Constraint satisfaction problems constitute a broad class of algorithmic problems that are ubiquitous in several differ­ ent areas of artificial intelligence and computer science. In their full generality, constraint satisfaction problems are NP-complete and, thus, presumed to be algorithmically in­ tractable. To cope with the intractability of these prob­ lems, researchers have devoted conside...

The aerodynamic voicing constraint presents the speaker with some physical limits on maintaining voicing during obstruents. Languages‘ phonologies reveal a variety of strategies in the face of this constraint. These strategies raise serious questions about constraints in Optimality Theory (OT).

| Constraint relational databases use constraints to both model and query data. A constraint relation contains a nite set of generalized tuples. Each generalized tuple is represented by a conjunction of constraints on a given logical theory and, depending on the logical theory and the speciic conjunction of constraints, it may possibly represent an in-nite set of relational tuples. For their ch...

A generally covariant gauge theory for an arbitrary gauge group with dimension ≥ 3, that reduces to Ashtekar’s canonical formulation of gravity for SO(3,C), is presented. The canonical form of the theory is shown to contain only first class constraints. When Ashtekar [1] managed to reformulate Einstein gravity on Yang-Mills phase space, it rekindled the old dream of finding a unified theory of ...

Using the superembedding approach, the full supersymmetric effective field theory of the D9-brane, super Born-Infeld theory, is fixed by the so called F-constraint. The odd-odd components of the theory’s super field strength, fαβ, are implied by this constraint. Given fαβ, the super Bianchi identities imply the theory’s equations of motion. We calculate fαβ up to order 5 in fields, correspondin...