Results 1  10
of
3,550
The SkyBlue Constraint Solver
, 1992
"... A constraint describes a relationship that should be maintained, for example that the equality A + B = C holds between three variables, that a set of displayed objects are aligned, or that the elements in a data structure are consistent with a graphic display of this structure. Constraint solvers h ..."
Abstract

Cited by 44 (3 self)
 Add to MetaCart
A constraint describes a relationship that should be maintained, for example that the equality A + B = C holds between three variables, that a set of displayed objects are aligned, or that the elements in a data structure are consistent with a graphic display of this structure. Constraint solvers
A Geometric Constraint Solver
, 1995
"... We report on the development of a twodimensional geometric constraint solver. The solver is a major component of a new generation of CAD systems that we are developing based on a highlevel geometry representation. The solver uses a graphreduction directed algebraic approach, and achieves interact ..."
Abstract

Cited by 70 (10 self)
 Add to MetaCart
We report on the development of a twodimensional geometric constraint solver. The solver is a major component of a new generation of CAD systems that we are developing based on a highlevel geometry representation. The solver uses a graphreduction directed algebraic approach, and achieves
Confluency of Cooperative Constraint Solvers
, 1994
"... This paper addresses a fundamental issue in the design of a cooperative constraint solver: confluency. A cooperative constraint solver works by repeatedly applying (nondeterministically) several specialized solvers (subsolvers) until no change is possible. Thus it naturally raises the question ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
This paper addresses a fundamental issue in the design of a cooperative constraint solver: confluency. A cooperative constraint solver works by repeatedly applying (nondeterministically) several specialized solvers (subsolvers) until no change is possible. Thus it naturally raises the question
An Architecture for the Combination of Constraint Solvers
 ERCIM/COMPULOG Workshop on Constraints
, 1998
"... . In this paper, an architecture for the combination of different constraint solvers with the help of projections is proposed. By means of the definition of an interface and restricting properties of the operations of constraint solvers we are able to define a mechanism for the open and consistent c ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. In this paper, an architecture for the combination of different constraint solvers with the help of projections is proposed. By means of the definition of an interface and restricting properties of the operations of constraint solvers we are able to define a mechanism for the open and consistent
Architectures for Cooperating Constraint Solvers
, 2012
"... We want to have an extensible collection of constraint solvers that can interoperate. As we’ve discussed, this fits well with Problem Oriented Languages — a POL could have one or more associated constraint solvers. (The alternative of having just a fixed, builtin set of solvers seems too inflexibl ..."
Abstract
 Add to MetaCart
We want to have an extensible collection of constraint solvers that can interoperate. As we’ve discussed, this fits well with Problem Oriented Languages — a POL could have one or more associated constraint solvers. (The alternative of having just a fixed, builtin set of solvers seems too
Lincs: A linear constraint solver for molecular simulations
 J. Comput. Chem
, 1997
"... .LINCS for molecular simulations with bond constraints. The algorithm is inherently stable, as the constraints themselves are reset instead of derivatives of the constraints, thereby eliminating drift. Although the derivation of the algorithm is presented in terms of matrices, no matrix matrix multi ..."
Abstract

Cited by 303 (1 self)
 Add to MetaCart
.LINCS for molecular simulations with bond constraints. The algorithm is inherently stable, as the constraints themselves are reset instead of derivatives of the constraints, thereby eliminating drift. Although the derivation of the algorithm is presented in terms of matrices, no matrix matrix
Cooperating Constraint Solvers
 In Sixth International Conference on Principles and Practice of Constraint Programming – CP. LNCS
, 2000
"... We propose a general scheme for the cooperation of different constraint solvers. On top of a uniform interface for constraint we stepwise develop reduction systems which describe the behaviour of an overall combined system. The modularity of our definitions of reduction relations at different levels ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
We propose a general scheme for the cooperation of different constraint solvers. On top of a uniform interface for constraint we stepwise develop reduction systems which describe the behaviour of an overall combined system. The modularity of our definitions of reduction relations at different
Building Constraint Solvers with HAL
"... Experience using constraint programming to solve reallife problems has shown that finding an efficient solution to a problem often requires experimentation with different constraint solvers or even building a problemspecific solver. HAL is a new constraint logic programming language expressly ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Experience using constraint programming to solve reallife problems has shown that finding an efficient solution to a problem often requires experimentation with different constraint solvers or even building a problemspecific solver. HAL is a new constraint logic programming language expressly
Composing Constraint Solvers
"... The subject of this thesis can be categorized as the implementation of constraint
solvers. In this chapter we put constraint solving, and the programming style
that it enables into context. We motivate our work, give an outline of the thesis,
and summarize the scientific contributions.
1.1 Context ..."
Abstract
 Add to MetaCart
The subject of this thesis can be categorized as the implementation of constraint
solvers. In this chapter we put constraint solving, and the programming style
that it enables into context. We motivate our work, give an outline of the thesis,
and summarize the scientific contributions.
1
An OpenEnded Finite Domain Constraint Solver
, 1997
"... We describe the design and implementation of a finite domain constraint solver embedded in a Prolog system using an extended unification mechanism via attributed variables as a generic constraint interface. The solver is essentially a scheduler for indexicals, i.e. reactive functional rules encodin ..."
Abstract

Cited by 194 (8 self)
 Add to MetaCart
We describe the design and implementation of a finite domain constraint solver embedded in a Prolog system using an extended unification mechanism via attributed variables as a generic constraint interface. The solver is essentially a scheduler for indexicals, i.e. reactive functional rules
Results 1  10
of
3,550