Sciweavers

7092 search results - page 339 / 1419
» Parallelizing constraint programs
Sort
View
ESOP
2009
Springer
15 years 6 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
EMNLP
2006
15 years 4 months ago
Incremental Integer Linear Programming for Non-projective Dependency Parsing
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such a...
Sebastian Riedel, James Clarke
MOR
2002
60views more  MOR 2002»
15 years 2 months ago
Properties of the Log-Barrier Function on Degenerate Nonlinear Programs
We examine the sequence of local minimizers of the log-barrier function for a nonlinear program near a solution at which second-order sufficient conditions and the Mangasarian-From...
Stephen J. Wright, Dominique Orban
PTS
2010
175views Hardware» more  PTS 2010»
15 years 22 days ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch
COLCOM
2007
IEEE
15 years 4 months ago
Maintaining constraints expressed as formulas in collaborative systems
—Constraints allow users to declare relationships among objects and let the constraint systems maintain and satisfy these relationships. Formulas have been adopted to express con...
Kai Lin, David Chen, R. Geoff Dromey, Chengzheng S...