Results 1  10
of
673,224
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
Entailment of Finite Domain Constraints
, 1994
"... Using a glassbox theory of finite domain constraints, FD, we show how the entailment of userdefined constraints can be expressed by antimonotone FD constraints. We also provide an algorithm for checking the entailment and consistency of FD constraints. FD is shown to be expressive enough to a ..."
Abstract

Cited by 22 (6 self)
 Add to MetaCart
Using a glassbox theory of finite domain constraints, FD, we show how the entailment of userdefined constraints can be expressed by antimonotone FD constraints. We also provide an algorithm for checking the entailment and consistency of FD constraints. FD is shown to be expressive enough
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agent ..."
Abstract

Cited by 502 (16 self)
 Add to MetaCart
agents that communicate by placing, checking and instantiating constraints on shared variables. Such a view of computation is interesting in the context of programming languages because of the ability to represent and manipulate partial information about the domain of discourse, in the con
Compiling and Executing Finite Domain Constraints
, 1995
"... : Carlson, B., 1995. Compiling and Executing Finite Domain Constraints. 175 pp. Uppsala Theses in Computing Science 21, ISSN 0283359X, ISBN 9150611003. SICS Dissertation Series 18, ISSN 11011335, ISRN SICSD 18SE. Finite domain constraints are used for specifying and solving complex proble ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
: Carlson, B., 1995. Compiling and Executing Finite Domain Constraints. 175 pp. Uppsala Theses in Computing Science 21, ISSN 0283359X, ISBN 9150611003. SICS Dissertation Series 18, ISSN 11011335, ISRN SICSD 18SE. Finite domain constraints are used for specifying and solving complex
Domain Constraint Maintenance
, 1994
"... In this report, we propose a set of domain independent and human independent restrictions on actions and we show that the restrictions can prevent actions from being improperly defined. Then, based on the set of restrictions, we propose a new conflict detecting method for nonlinear plans and we s ..."
Abstract
 Add to MetaCart
In this report, we propose a set of domain independent and human independent restrictions on actions and we show that the restrictions can prevent actions from being improperly defined. Then, based on the set of restrictions, we propose a new conflict detecting method for nonlinear plans and we
Simplifiaction of Finite Domain Constraints
, 1998
"... An important issue in Constraint Logic Programming (CLP) systems is how to output constraints in a usable form. Typically, only a small subset ~ x of the variables in constraints is of interest, and so an informal statement of the problem at hand is: given a conjunction C(~x; ~ y) of constraints, e ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
, express 9~y C(~x; ~ y) in the simplest form. [13] showed how a set of constraints over the real domain can be simplified. We present here how we can simplify a set of constraints over finite domains. First, we start by a bref sight on the simplification of the constraints over real domain, then we show
Integer Interval/Domain Constraints
"... Abstract. This paper deals with integer constraints on a introductory level. Nevertheless the reader should be familar with the basic notions of Constraint Programming [1] [3]. After some simple examples we provide some formalisations to define integer constraints. Then we discuss propagation on a ..."
Abstract
 Add to MetaCart
Abstract. This paper deals with integer constraints on a introductory level. Nevertheless the reader should be familar with the basic notions of Constraint Programming [1] [3]. After some simple examples we provide some formalisations to define integer constraints. Then we discuss propagation on a
An Extension of Erlang with Finite Domain Constraints
, 1995
"... This report describes the design and implementation of a finite domain constraint solver for Erlang. The constraint solver handles linear arithmetic constraints over natural numbers, which are approximated using arc and interval consistency. We use a scheme with functional rules for constraint propa ..."
Abstract
 Add to MetaCart
This report describes the design and implementation of a finite domain constraint solver for Erlang. The constraint solver handles linear arithmetic constraints over natural numbers, which are approximated using arc and interval consistency. We use a scheme with functional rules for constraint
Finite Domain Constraint Solver Learning
"... In this paper, we present an abstract framework for learning a finite domain constraint solver modeled by a set of operators enforcing a consistency. The behavior of the consistency to be learned is taken as the set of examples on which the learning process is applied. The best possible expression o ..."
Abstract
 Add to MetaCart
In this paper, we present an abstract framework for learning a finite domain constraint solver modeled by a set of operators enforcing a consistency. The behavior of the consistency to be learned is taken as the set of examples on which the learning process is applied. The best possible expression
Finite Domain Constraint Programming Systems
"... One of the main reasons why constraint programming quickly found its way into applications has been the early availability of usable constraint programming systems. Given the wide range of applications using constraint programming it is obvious that one of the key properties of constraint programmin ..."
Abstract
 Add to MetaCart
attention to propagationbased finite domain constraint programming systems. That is, systems that solve problems using constraint propagation involving variables ranging over some finite set of integers. The focus on finite domain constraint programming systems coincides with both practical relevance
Results 1  10
of
673,224