Results 1  10
of
379,100
On Binary Constraint Problems
 Journal of the ACM
, 1994
"... The concepts of binary constraint satisfaction problems can be naturally generalized to the relation algebras of Tarski. The concept of pathconsistency plays a central role. Algorithms for pathconsistency can be implemented on matrices of relations and on matrices of elements from a relation algeb ..."
Abstract

Cited by 98 (2 self)
 Add to MetaCart
The concepts of binary constraint satisfaction problems can be naturally generalized to the relation algebras of Tarski. The concept of pathconsistency plays a central role. Algorithms for pathconsistency can be implemented on matrices of relations and on matrices of elements from a relation
On Binary Constraint Networks
, 1988
"... It is wellknown that general constraint satisfaction problems (CSPs) may be reduced to the binary case (BCSPs) [Pei92]. CSPs may be represented by binary constraint networks (BCNs), which can be represented by a graph with nodes for variables for which values are to be found in the domain of intere ..."
Abstract

Cited by 41 (5 self)
 Add to MetaCart
It is wellknown that general constraint satisfaction problems (CSPs) may be reduced to the binary case (BCSPs) [Pei92]. CSPs may be represented by binary constraint networks (BCNs), which can be represented by a graph with nodes for variables for which values are to be found in the domain
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.
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
Locating the Phase Transition in Binary Constraint Satisfaction Problems
 Artificial Intelligence
, 1994
"... The phase transition in binary constraint satisfaction problems, i.e. the transition from a region in which almost all problems have many solutions to a region in which almost all problems have no solutions, as the constraints become tighter, is investigated by examining the behaviour of samples of ..."
Abstract

Cited by 134 (4 self)
 Add to MetaCart
The phase transition in binary constraint satisfaction problems, i.e. the transition from a region in which almost all problems have many solutions to a region in which almost all problems have no solutions, as the constraints become tighter, is investigated by examining the behaviour of samples
Compact Representation of Sets of Binary Constraints
"... Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formulae that represent realworld problems ranging from modelchecking problems in computeraided verification to AI planning ..."
Abstract
 Add to MetaCart
Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formulae that represent realworld problems ranging from modelchecking problems in computeraided verification to AI
Representation and Reasoning with NonBinary Constraints
, 2001
"... Many problems from the \real world" can be eciently expressed as constraint satisfaction problems (CSPs). Most of these can be naturally modelled using nary (or nonbinary) constraints. Representing problems with nary constraints and reasoning with them is therefore very important in constrai ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Many problems from the \real world" can be eciently expressed as constraint satisfaction problems (CSPs). Most of these can be naturally modelled using nary (or nonbinary) constraints. Representing problems with nary constraints and reasoning with them is therefore very important
Extracting Microstructure in Binary Constraint Networks
"... Abstract. We present algorithms that perform the extraction of partial assignments from binary Constraint Satisfaction Problems without introducing new constraints. They are based on a new perspective on domain values: we view a value not as a single, indivisible unit, but as a combination of value ..."
Abstract
 Add to MetaCart
Abstract. We present algorithms that perform the extraction of partial assignments from binary Constraint Satisfaction Problems without introducing new constraints. They are based on a new perspective on domain values: we view a value not as a single, indivisible unit, but as a combination of value
Results 1  10
of
379,100