the minimal label problem (MLP) (also known as the deductive closure problem) is a fundamental problem in qualitative spatial and temporal reasoning (QSTR). Given a qualitative constraint network Γ, the minimal netwo...
详细信息
Many constraint problems exhibit dominance relations which can be exploited for dramatic reductions in search space. Dominance relations are a generalization of symmetry and conditional symmetry. However, unlike symme...
详细信息
the optimal search path (OSP) problem is a single-sided detection search problem where the location and the detectability of a moving object are uncertain. A solution to this -hard problem is a path on a graph that ma...
详细信息
How to synthesize molecules is a fundamental and well studied problem in chemistry. However, computer aided methods are still under-utilized in chemical synthesis planning. Given a specific chemistry (a set of chemica...
详细信息
We present a novel approach to the Traveling Purchaser Problem (TPP), based on constraintprogramming and Lagrangean relaxation. the TPP is a generalization of the Traveling Salesman Problem involved in many real-worl...
详细信息
Filtering algorithms for table constraints are constraint-based, which means that the propagation queue only contains information on the constraints that must be reconsidered. this paper proposes four efficient value-...
详细信息
the AtMostSeqCard constraint is the conjunction of a cardinality constraint on a sequence of n variables and of n - q + 1 constraints AtMost u on each subsequence of size q. this constraint is useful in car-sequencing...
详细信息
Two competing approaches to handling complex constraints in satisfaction and optimization problems using SAT and LCG/SMT technology are: decompose the complex constraint into a set of clauses;or (theory) propagate the...
详细信息
We revisit the SeqBin constraint [1]. this meta-constraint subsumes a number of important global constraints like Change [2], Smooth [3] and IncreasingNValue [4]. We show that the previously proposed filtering algorit...
详细信息
Bounded Max-Sum is a message-passing algorithm for solving Distributed constraint Optimization Problems able to compute solutions with a guaranteed approximation ratio. Although its approximate solutions were empirica...
详细信息
暂无评论