Sciweavers

3591 search results - page 75 / 719
» Typing linear constraints
Sort
View
TLCA
2007
Springer
15 years 4 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva
MA
2010
Springer
117views Communications» more  MA 2010»
14 years 8 months ago
Thresholding projection estimators in functional linear models
We consider the problem of estimating the regression function in functional linear regression models by proposing a new type of projection estimators which combine
Hervé Cardot, Jan Johannes
ASIAN
1999
Springer
114views Algorithms» more  ASIAN 1999»
15 years 2 months ago
Entailment of Non-structural Subtype Constraints
Entailment of subtype constraints was introduced for constraint simplification in subtype inference systems. Designing an efficient algorithm for subtype entailment turned out to...
Joachim Niehren, Tim Priesnitz
CADE
2000
Springer
15 years 2 months ago
Automated Proof Construction in Type Theory Using Resolution
We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows. − A clausification procedure in type theory, equipped w...
Marc Bezem, Dimitri Hendriks, Hans de Nivelle
SIAMJO
2002
73views more  SIAMJO 2002»
14 years 9 months ago
Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
We study best approximation problems with nonlinear constraints in Hilbert spaces. The strong "conical hull intersection property" (CHIP) and the "basic constraint q...
Chong Li, Xiao-Qing Jin