Results 1  10
of
47,078
Constraint propagation algorithms for temporal reasoning
 Readings in Qualitative Reasoning about Physical Systems
, 1986
"... Abstract: This paper revises and expands upon a paper presented by two of the present authors at AAAI 1986 [Vilain & Kautz 1986]. As with the original, this revised document considers computational aspects of intervalbased and pointbased temporal representations. Computing the consequences of t ..."
Abstract

Cited by 428 (5 self)
 Add to MetaCart
reasoning; of these, one of the most attractive is James Allen's algebra of temporal intervals [Allen 1983]. This representation scheme is particularly appealing for its simplicity and for its ease of implementation with constraint propagation algorithms. Reasoners based on
The role of commutativity in constraint propagation algorithms
 ACM Transactions on Programming Languages and Systems
, 2000
"... Constraint propagation algorithms form an important part of most of the constraint programming systems. We provide here a simple, yet very general framework that allows us to explain several constraint propagation algorithms in a systematic way. In this framework we proceed in two steps. First, we i ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
Constraint propagation algorithms form an important part of most of the constraint programming systems. We provide here a simple, yet very general framework that allows us to explain several constraint propagation algorithms in a systematic way. In this framework we proceed in two steps. First, we
Refining the basic constraint propagation algorithm
 In Proceedings IJCAI’01
, 2001
"... Propagating constraints is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the use of the best algorithms. But the ease of integration is also one of the concerns when implementing an algorithm in a c ..."
Abstract

Cited by 100 (12 self)
 Add to MetaCart
Propagating constraints is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the use of the best algorithms. But the ease of integration is also one of the concerns when implementing an algorithm in a
An Improved ConstraintPropagation Algorithm for Diagnosis*
"... Diagnosing a system requires the identification of a set of components whose abnormal behavior could explain the faulty system behavior. Previously, modelbased diagnosis schemes have proceeded through a cycle of assumptions * predictions observations assumptionsadjustment, where the basic assumpt ..."
Abstract
 Add to MetaCart
assumptions entail the proper functioning of those components whose failure is not established. Here we propose a scheme in which every component's status is treated as a variable; therefore, predictions covering all possible behavior of the system can be generated. Remarkably, the algorithm exhibits a
An Interval Constraint Propagation Algorithm Exploiting Monotonicity
, 2009
"... When a function f is monotonic w.r.t. x in a given box, it is wellknown that the monotonicitybased interval extension of f computes a sharper image than the natural interval extension does. Indeed, the overestimation due to the variable x with multiple occurrences in f disappears. However, monoto ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
, monotonicity has not been exploited in interval filtering/contraction algorithms for solving systems of nonlinear constraints over the reals. We propose in this paper a new interval constraint propagation algorithm, called MOnotonic Hull Consistency (Mohc), that exploits monotonicity of functions
A population and interval constraint propagation algorithm
 Lecture Notes in Computer Science
, 2003
"... Abstract. We present PICPA, a new algorithm for tackling constrained continuous multiobjective problems. The algorithm combines constraint propagation techniques and evolutionary concepts. Unlike other evolutionary algorithm which gives only heuristic solutions, PICPA is able to bound effectively t ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. We present PICPA, a new algorithm for tackling constrained continuous multiobjective problems. The algorithm combines constraint propagation techniques and evolutionary concepts. Unlike other evolutionary algorithm which gives only heuristic solutions, PICPA is able to bound effectively
Making Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity
"... Abstract. A new interval constraint propagation algorithm, called MOnotonic Hull Consistency (Mohc), has recently been proposed. Mohc exploits monotonicity of functions to better filter variable domains. Embedded in an intervalbased solver, Mohc shows very high performance for solving systems of nu ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. A new interval constraint propagation algorithm, called MOnotonic Hull Consistency (Mohc), has recently been proposed. Mohc exploits monotonicity of functions to better filter variable domains. Embedded in an intervalbased solver, Mohc shows very high performance for solving systems
QuickXPlain: Conflict Detection for Arbitrary Constraint Propagation Algorithms
, 2001
"... Existing conflict detection methods for CSP's such as [de Kleer, 1989; Ginsberg, 1993] cannot make use of powerful propagation which makes them unusable for complex realworld problems. On the other hand, powerful constraint propagation methods lack the ability to extract dependencies or confli ..."
Abstract

Cited by 84 (0 self)
 Add to MetaCart
Existing conflict detection methods for CSP's such as [de Kleer, 1989; Ginsberg, 1993] cannot make use of powerful propagation which makes them unusable for complex realworld problems. On the other hand, powerful constraint propagation methods lack the ability to extract dependencies
Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains
 IN 5TH INTERNATIONAL CONFERENCE ON PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP'99, LNCS 1713
, 1999
"... We study here constraint satisfaction problems that are based on predefined, explicitly given finite constraints. To solve them we propose a notion of rule consistency that can be expressed in terms of rules derived from the explicit representation of the initial constraints. This notion of loca ..."
Abstract

Cited by 34 (5 self)
 Add to MetaCart
of local consistency is weaker than arc consistency for constraints of arbitrary arity but coincides with it when all domains are unary or binary. For Boolean constraints rule consistency coincides with the closure under the wellknown propagation rules for Boolean constraints. By generalizing
EdgeFinding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling
 Scheduling,” Proceedings 15 th Workshop of the U.K. Planning Special Interest Group
, 1996
"... . Edgefinding bounding techniques are particular constraint propagation techniques which reason about the order in which several activities can execute on a given resource. The aim of the following paper is to provide a rather comprehensive (although necessarily incomplete) review of existing edge ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
. Edgefinding bounding techniques are particular constraint propagation techniques which reason about the order in which several activities can execute on a given resource. The aim of the following paper is to provide a rather comprehensive (although necessarily incomplete) review of existing edge
Results 1  10
of
47,078