Results 1  10
of
2,543
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract

Cited by 864 (25 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in different areas of applications. In this survey of CLP, a primary goal is to give a systematic description of the major trends in terms of common fundamental concepts. The three main parts cover the theory, implementation issues, and programming for applications.
Theory and Practice of Constraint Handling Rules
, 1998
"... Constraint Handling Rules (CHR) are our proposal to allow more flexibility and applicationoriented customization of constraint systems. CHR are a declarative language extension especially designed for writing userdefined constraints. CHR are essentially a committedchoice language consisting of mu ..."
Abstract

Cited by 459 (36 self)
 Add to MetaCart
Constraint Handling Rules (CHR) are our proposal to allow more flexibility and applicationoriented customization of constraint systems. CHR are a declarative language extension especially designed for writing userdefined constraints. CHR are essentially a committedchoice language consisting of multiheaded guarded rules that rewrite constraints into simpler ones until they are solved. In this broad survey we aim at covering all aspects of CHR as they currently present themselves. Going from theory to practice, we will define syntax and semantics for CHR, introduce an important decidable property, confluence, of CHR programs and define a tight integration of CHR with constraint logic programming languages. This survey then describes implementations of the language before we review several constraint solvers  both traditional and non standard ones  written in the CHR language. Finally we introduce two innovative applications that benefited from using CHR.
Applying interval arithmetic to real, integer and Boolean constraints
 JOURNAL OF LOGIC PROGRAMMING
, 1997
"... We present in this paper a general narrowing algorithm, based on relational interval arithmetic, which applies to any nary relation on!. The main idea is to define, for every such relation ae, a narrowing function \Gamma! ae based on the approximation of ae by a block which is the cartesian product ..."
Abstract

Cited by 186 (20 self)
 Add to MetaCart
We present in this paper a general narrowing algorithm, based on relational interval arithmetic, which applies to any nary relation on!. The main idea is to define, for every such relation ae, a narrowing function \Gamma! ae based on the approximation of ae by a block which is the cartesian product of intervals. We then show how, under certain conditions, one can compute the narrowing function of relations defined in terms of unions and intersections of simpler relations. We apply the use of the narrowing algorithm, which is the core of the CLP language BNRProlog, to integer and disequality constraints, to boolean constraints and to relations mixing numerical and boolean values. The result is a language, called CLP(BNR), where constraints are expressed in a unique structure, allowing the mixing of real numbers, integers and booleans. We end by the presentation of several examples showing the advantages of such approach from the point of view of the expressiveness, and give some computational results from a first prototype
TimeChanged Lévy Processes and Option Pricing
, 2002
"... As is well known, the classic BlackScholes option pricing model assumes that returns follow Brownian motion. It is widely recognized that return processes differ from this benchmark in at least three important ways. First, asset prices jump, leading to nonnormal return innovations. Second, return ..."
Abstract

Cited by 182 (21 self)
 Add to MetaCart
As is well known, the classic BlackScholes option pricing model assumes that returns follow Brownian motion. It is widely recognized that return processes differ from this benchmark in at least three important ways. First, asset prices jump, leading to nonnormal return innovations. Second, return volatilities vary stochastically over time. Third, returns and their volatilities are correlated, often negatively for equities. We propose that timechanged Lévy processes be used to simultaneously address these three facets of the underlying asset return process. We show that our framework encompasses almost all of the models proposed in the option pricing literature. Despite the generality of our approach, we show that it is straightforward to select and test a particular option pricing model through the use of characteristic function technology.
Interaction and Intelligent Behavior
, 1994
"... This thesis addresses situated, embodied agents interacting in complex domains. It focuses on two problems: 1) synthesis and analysis of intelligent group behavior, and 2) learning in complex group environments. Basic behaviors, control laws that cluster constraints to achieve particular goals and h ..."
Abstract

Cited by 175 (20 self)
 Add to MetaCart
This thesis addresses situated, embodied agents interacting in complex domains. It focuses on two problems: 1) synthesis and analysis of intelligent group behavior, and 2) learning in complex group environments. Basic behaviors, control laws that cluster constraints to achieve particular goals and have the appropriate compositional properties, are proposed as effective primitives for control and learning. The thesis describes the process of selecting such basic behaviors, formally specifying them, algorithmically implementing them, and empirically evaluating them. All of the proposed ideas are validated with a group of up to 20 mobile robots using a basic behavior set consisting of: safewandering, following, aggregation, dispersion, and homing. The set of basic behaviors acts as a substrate for achieving more complex highlevel goals and tasks. Two behavior combination operators are introduced, and verified by combining subsets of the above basic behavior set to implement collective flocking, foraging, and docking. A methodology is introduced for automatically constructing higherlevel behaviors
CLP(Intervals) Revisited
, 1994
"... The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive constraints as in CLP(BNR), complex constraints are manipulated as a whole, enabling more sophisticated narrowing procedu ..."
Abstract

Cited by 136 (19 self)
 Add to MetaCart
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive constraints as in CLP(BNR), complex constraints are manipulated as a whole, enabling more sophisticated narrowing procedures to be applied in the solver. This idea is embodied in a new CLP language Newton whose operational semantics is based on the notion of boxconsistency, an approximation of arcconsistency, and whose implementation uses Newton interval method. Experimental results indicate that Newton outperforms existing languages by an order of magnitude and is competitive with some stateoftheart tools on some standard benchmarks. Limitations of our current implementation and directions for further work are also identified.
Kooperberg10,OlivierCussenot11,12,SimoneBenhamou13,14, JenniferPrescott15,16,17,18,19,Stefano
"... Genomewide association study identifies multiple loci associated with bladder cancer risk Jonine D. Figueroa1,{,∗, Yuanqing Ye2,3,{, Afshan Siddiq4,5,6,{, Montserrat GarciaClosas1,7,{, ..."
Abstract
 Add to MetaCart
Genomewide association study identifies multiple loci associated with bladder cancer risk Jonine D. Figueroa1,{,∗, Yuanqing Ye2,3,{, Afshan Siddiq4,5,6,{, Montserrat GarciaClosas1,7,{,
Visual navigation in insects: Coupling of egocentric and geocentric information
 Journal of Experimental Biology
, 1996
"... Social hymenopterans such as bees and ants are centralplace foragers; they regularly depart from and return to fixed positions in their environment. In returning to the starting point of their foraging excursion or to any other point, they could resort to two fundamentally different ways of navigati ..."
Abstract

Cited by 126 (5 self)
 Add to MetaCart
Social hymenopterans such as bees and ants are centralplace foragers; they regularly depart from and return to fixed positions in their environment. In returning to the starting point of their foraging excursion or to any other point, they could resort to two fundamentally different ways of navigation by using either egocentric or geocentric systems of reference. In the first case, they would rely on information continuously collected en route (path integration, dead reckoning), i.e. integrate all angles steered and all distances covered into a mean home vector. In the second case, they are expected, at least by some authors, to use a mapbased system of navigation, i.e. to obtain positional information by virtue of the spatial position they occupy within a larger environmental framework. In bees and ants, path integration employing a skylight compass is the predominant mechanism of navigation, but geocentred landmarkbased information is used as well. This information is obtained while the animal is deadreckoning and, hence, added to the vector course. For example, the image of the horizon skyline surrounding the nest entrance is retinotopically stored while the animal approaches the goal along its vector course. As shown in
The effects of plant flavonoids on mammalian cells: implications for inflammation, heart disease and cancer
 Pharmacol. Rev
, 2000
"... Abstract............................................................................... 674 ..."
Abstract

Cited by 123 (3 self)
 Add to MetaCart
Abstract............................................................................... 674
Solving Polynomial Systems Using a Branch and Prune Approach
 SIAM Journal on Numerical Analysis
, 1997
"... This paper presents Newton, a branch & prune algorithm to find all isolated solutions of a system of polynomial constraints. Newton can be characterized as a global search method which uses intervals for numerical correctness and for pruning the search space early. The pruning in Newton consists ..."
Abstract

Cited by 112 (7 self)
 Add to MetaCart
This paper presents Newton, a branch & prune algorithm to find all isolated solutions of a system of polynomial constraints. Newton can be characterized as a global search method which uses intervals for numerical correctness and for pruning the search space early. The pruning in Newton consists in enforcing at each node of the search tree a unique local consistency condition, called boxconsistency, which approximates the notion of arcconsistency wellknown in artificial intelligence. Boxconsistency is parametrized by an interval extension of the constraint and can be instantiated to produce the HansenSegupta's narrowing operator (used in interval methods) as well as new operators which are more effective when the computation is far from a solution. Newton has been evaluated on a variety of benchmarks from kinematics, chemistry, combustion, economics, and mechanics. On these benchmarks, it outperforms the interval methods we are aware of and compares well with stateoftheart continuation methods. Limitations of Newton (e.g., a sensitivity to the size of the initial intervals on some problems) are also discussed. Of particular interest is the mathematical and programming simplicity of the method.
Results 1  10
of
2,543