Results 1  10
of
1,348,509
Domain filtering consistencies for nonbinary constraints
 ARTIFICIAL INTELLIGENCE
, 2008
"... In nonbinary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency or weaker local consistency properties. This is in contrast with binary constraints where numerous such domain filtering ..."
Abstract

Cited by 26 (9 self)
 Add to MetaCart
In nonbinary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency or weaker local consistency properties. This is in contrast with binary constraints where numerous such domain
STRONG DOMAIN FILTERING CONSISTENCIES FOR NONBINARY CONSTRAINT SATISFACTION PROBLEMS
"... Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Although many such consistencies for binary constraints have been proposed and evaluated, the situation with nonbinary const ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Although many such consistencies for binary constraints have been proposed and evaluated, the situation with nonbinary
Inverse Consistencies for Nonbinary Constraints
, 2006
"... We present a detailed study of two inverse consistencies for nonbinary constraints: relational path inverse consistency (rel PIC) and pairwise inverse consistency (PWIC). These are stronger than generalized arc consistency (GAC), even though they also only prune domain values. We propose algorith ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We present a detailed study of two inverse consistencies for nonbinary constraints: relational path inverse consistency (rel PIC) and pairwise inverse consistency (PWIC). These are stronger than generalized arc consistency (GAC), even though they also only prune domain values. We propose
Inverse Consistencies for Nonbinary Constraints
"... Abstract. We present a detailed study of two inverse consistencies for nonbinary constraints: relational path inverse consistency (rel PIC) and pairwise inverse consistency (PWIC). These are stronger than generalized arc consistency (GAC), even though they also only prune domain values. We propose ..."
Abstract
 Add to MetaCart
Abstract. We present a detailed study of two inverse consistencies for nonbinary constraints: relational path inverse consistency (rel PIC) and pairwise inverse consistency (PWIC). These are stronger than generalized arc consistency (GAC), even though they also only prune domain values. We propose
Dual Consistency for Nonbinary . . .
"... Dual Consistency (DC) was introduced by Lecoutre, Cardon and Vion in [10, 11]. DC is a novel way of handling Path Consistency (PC), with a simpler definition, and new efficient algorithms and approximations. Interestingly, the new definition may be extended to nonbinary constraint networks (CNs). ..."
Abstract
 Add to MetaCart
Dual Consistency (DC) was introduced by Lecoutre, Cardon and Vion in [10, 11]. DC is a novel way of handling Path Consistency (PC), with a simpler definition, and new efficient algorithms and approximations. Interestingly, the new definition may be extended to nonbinary constraint networks (CNs
Binary vs. nonbinary constraints
 Artificial Intelligence
, 2002
"... Fellowship program. 1 There are two well known transformations from nonbinary constraints to binary constraints applicable to constraint satisfaction problems (CSPs) with finite domains: the dual transformation and the hidden (variable) transformation. We perform a detailed formal comparison of the ..."
Abstract

Cited by 32 (3 self)
 Add to MetaCart
Fellowship program. 1 There are two well known transformations from nonbinary constraints to binary constraints applicable to constraint satisfaction problems (CSPs) with finite domains: the dual transformation and the hidden (variable) transformation. We perform a detailed formal comparison
Distributed Nonbinary Constraints
"... Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constraints. Hard constraints must hold while soft constraints may be violated but as many as possible should be satisfied ..."
Abstract
 Add to MetaCart
be satisfied. Although the problem constraints can be divided into two groups, the order in which these constraints are studied can improve e#ciency, particulary in problems with nonbinary constraints.
Constraint Networks
, 1992
"... Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint expression ..."
Abstract

Cited by 1149 (43 self)
 Add to MetaCart
Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint
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
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
Results 1  10
of
1,348,509