IJCAI
2001
13 years 6 months ago
2001
Constraint propagation is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the us...
NIPS
2007
13 years 6 months ago
2007
This paper proposes constraint propagation relaxation (CPR), a probabilistic approach to classical constraint propagation that provides another view on the whole parametric family...
MEDINFO
2007
13 years 6 months ago
2007
Temporal constraints play a fundamental role in clinical guidelines. For example, temporal indeterminacy, constraints about duration, delays between actions and periodic repetitio...
ECAI
2008
Springer
13 years 6 months ago
2008
Springer
A temporal constraint management system (TCMS) is a temporal network together with algorithms for managing the constraints in that network over time. This paper presents a practica...
CP
2005
Springer
13 years 6 months ago
2005
Springer
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
CP
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
AUSAI
2006
Springer
13 years 8 months ago
2006
Springer
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
PPSN
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. This paper describes a parallel model for a distributed memory architecture of a non traditional evolutionary computation method, which integrates constraint propagation ...
KES
1998
Springer
13 years 8 months ago
1998
Springer
Many events in the world occur with some quantity that shows a level of the occurrence. This paper discusses reasoning with the normalized level of the occurrence, which we call i...
CP
2000
Springer
13 years 9 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...