Research Publications
All Conference Paper | |
| Narrow your search | 186 result(s) |
By Type By Year By Research Group | 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 complex constraint using a ... 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. Unlike symmetry breaking which is relatively well ... Lazy Clause Generation is a powerful approach to reducing search in Constraint Programming. This is achieved by recording sets of domain restrictions that previously led to failure as new clausal propagators called nogoods. This dramatically reduces the ... 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-based algorithms for table ... Reasoning over bit vectors arises in a variety of applications in verification and cryptography. This paper presents a bit-vector domain for constraint programming and its associated filtering algorithms. The domain supports all the traditional bit ... The Resource-constrained Project Scheduling Problem (Rcpsp), in which a schedule must obey resource constraints and precedence constraints between pairs of activities, is one of the most studied scheduling problems. An important variation of this problem ... Software developers are an ideal channel through which Constraint Programming (CP) technology can be made available to the general public. Unfortunately, most software developers find it very difficult to formulate declarative constraint models. We aim... We revisit the SEQBIN constraint. This meta-constraint subsumes a number of important global constraints like CHANGE, SMOOTH and INCREASINGNVALUE. We show that the previously proposed filtering algorithm for SEQBIN has two drawbacks even under strong ... We propose a hybrid MIP/CP approach for solving multi-activity shift scheduling problems, based on regular languages that partially describe the set of feasible shifts. We use an aggregated MIP relaxation to capture the optimization part of the problem ... TRANSIT is a fast and optimal technique for computing shortest path costs in road networks. It is attractive for its usually modest memory requirements and impressive running times. In this paper we give a first analysis of TRANSIT routing on a set of ... |