Sciweavers

999 search results - page 4 / 200
» Constraints in Non-Boolean Contexts
Sort
View
CL
1999
Springer
13 years 5 months ago
An execution scheme for interactive problem-solving in concurrent constraint logic programming languages
Van Emden's incremental queries address the inadequacy of current Prolog-style querying mechanism in most logic programming systems for interactive problem-solving. In the co...
Jimmy Ho-Man Lee, Ho-fung Leung
EMNLP
2010
13 years 3 months ago
Top-Down Nearly-Context-Sensitive Parsing
We present a new syntactic parser that works left-to-right and top down, thus maintaining a fully-connected parse tree for a few alternative parse hypotheses. All of the commonly ...
Eugene Charniak
SIAMCO
2000
111views more  SIAMCO 2000»
13 years 5 months ago
Superreplication Under Gamma Constraints
In a financial market consisting of a nonrisky asset and a risky one, we study the minimal initial capital needed in order to superreplicate a given contingent claim under a gamma ...
H. Mete Soner, Nizar Touzi
JLP
1998
147views more  JLP 1998»
13 years 5 months ago
Automated Reasoning with a Constraint-Based Metainterpreter
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
Henning Christiansen
RTA
2000
Springer
13 years 9 months ago
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of ...
Jordi Levy, Mateu Villaret