Results 1  10
of
1,292,718
Definability with bounded number of bound variables
 INFORMATION AND COMPUTATION
, 1989
"... A theory satisfies the kvariable property if every firstorder formula is equivalent to a formula with at most k bound variables (possibly reused). Gabbay has shown that a model of temporal logic satisfies the kvariable property for some k if and only if there exists a finite basis for the tempora ..."
Abstract

Cited by 89 (6 self)
 Add to MetaCart
A theory satisfies the kvariable property if every firstorder formula is equivalent to a formula with at most k bound variables (possibly reused). Gabbay has shown that a model of temporal logic satisfies the kvariable property for some k if and only if there exists a finite basis
Bound Variables and Other Anaphors
 University of Illinois
, 1978
"... When a noun phrase or a pronoun occurs in a sentence, it is frequently appropriate to ask what entity it refers to, but it is well known that not all uses of noun phrases and pronouns are referential in this simple sense. In computational approaches to language processing, I believe the main thrust ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
by linguists, logicians and philosophers is leading to convergence on the view that there are two fundamentally distinct uses of pronouns which have to be treated quite separately: (i) a use that corresponds to the logicianâ€™s use of bound variables, and (ii) a use which I will call, for want of a better name
PROBABILITY INEQUALITIES FOR SUMS OF BOUNDED RANDOM VARIABLES
, 1962
"... Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of S is bounded or bounded above. The bounds for Pr(SES> nt) depend only on the endpoints of the ranges of the s ..."
Abstract

Cited by 2217 (2 self)
 Add to MetaCart
Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of S is bounded or bounded above. The bounds for Pr(SES> nt) depend only on the endpoints of the ranges
Bound Variables And Other Anaphors
 Theoretical Issues in Natural Language Processing2 (TINLAP2), July 2527, Univ. of Illinois at UrbanaChampaign
, 1975
"... this paper will be somewhat different. I believe that recent work by linguists, logicians, and philosophers is leading to convergence on the view that there are two fundamentally distinct uses of pronouns which have to be treated quite separately: (i) a use that corresponds to the logician's us ..."
Abstract
 Add to MetaCart
's use of bound variables, and (ii) a use which I will call, for want of a better name, a pragmatic use. It can be argued that bound variable pronouns are restricted to occurrences in syntactic construction with their antecedents, and are fully interpreted at the level of semantics, while pragmatic
The Cult of the Bound Variable:
 Carnegie Mellon
, 2006
"... The annual ICFP Programming Contest has become one of the premiere programming competitions in the world. The 9 incarnation of the contest, "The Cult of the Bound Variable," was held in July 2006 and organized by the Principles of Programming group at Carnegie Mellon University. This re ..."
Abstract
 Add to MetaCart
The annual ICFP Programming Contest has become one of the premiere programming competitions in the world. The 9 incarnation of the contest, "The Cult of the Bound Variable," was held in July 2006 and organized by the Principles of Programming group at Carnegie Mellon University
Bound variable interpretation and the degree of accessibility
"... Natural languages permit the use of different lexical items to encode a bound variable interpretation. However, it is not the case that one can freely use any of these lexical items to establish a bound variable reading. I claim that the choice of the appropriate lexical item follows from accessibil ..."
Abstract
 Add to MetaCart
Natural languages permit the use of different lexical items to encode a bound variable interpretation. However, it is not the case that one can freely use any of these lexical items to establish a bound variable reading. I claim that the choice of the appropriate lexical item follows from
An introduction to variable and feature selection
 Journal of Machine Learning Research
, 2003
"... Variable and feature selection have become the focus of much research in areas of application for which datasets with tens or hundreds of thousands of variables are available. ..."
Abstract

Cited by 1283 (16 self)
 Add to MetaCart
Variable and feature selection have become the focus of much research in areas of application for which datasets with tens or hundreds of thousands of variables are available.
MTL with Bounded Variability: Decidability and Complexity
"... Abstract. This paper investigates the properties of Metric Temporal Logic (MTL) over models in which time is dense but phenomena are constrained to have bounded variability. Contrary to the case of generic densetime behaviors, MTL is proved to be fully decidable over models with bounded variability ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Abstract. This paper investigates the properties of Metric Temporal Logic (MTL) over models in which time is dense but phenomena are constrained to have bounded variability. Contrary to the case of generic densetime behaviors, MTL is proved to be fully decidable over models with bounded
A Limited Memory Algorithm for Bound Constrained Optimization
 SIAM Journal on Scientific Computing
, 1994
"... An algorithm for solving large nonlinear optimization problems with simple bounds is described. ..."
Abstract

Cited by 557 (9 self)
 Add to MetaCart
An algorithm for solving large nonlinear optimization problems with simple bounds is described.
Results 1  10
of
1,292,718