Explaining the ATMOSTSEQCARD constraint∗
نویسندگان
چکیده
We propose an O(n) propagation-based procedure for explaining the ATMOSTSEQCARD constraint. We evaluate it against pure CP models for solving car-sequencing benchmarks. The experimental evaluation emphasizes the importance of combining CP with SAT for solving this problem.
منابع مشابه
An Optimal Arc Consistency Algorithm for a Chain of Atmost Constraints with Cardinality
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 and crew-rostering problems. In [18], two algorithms designed for the AMONGSEQ constraint were adapted to this constraint with a O(2n) and O(n) worst case time complexity, respecti...
متن کاملSAT and Hybrid Models of the Car Sequencing Problem
We compare both pure SAT and hybrid CP/SAT models for solving car sequencing problems, and close 13 out of the 23 large open instances in CSPLib. Three features of these models are crucial to improving the state of the art in this domain. For quickly finding solutions, advanced CP heuristics are important and good propagation (either by a specialized propagator or by a sophisticated SAT encodin...
متن کاملExplaining alldifferent
Lazy clause generation is a powerful approach to reducing search in constraint programming. For use in a lazy clause generation solver, global constraints must be extended to explain themselves. Alternatively they can be decomposed into simpler constraints which already have explanation capability. In this paper we examine different propagation mechanisms for the alldifferent constraint, and sh...
متن کاملExplaining Constraint Programming
We discuss here constraint programming (CP) by using a proof-theoretic perspective. To this end we identify three levels of abstraction. Each level sheds light on the essence of CP. In particular, the highest level allows us to bring CP closer to the computation as deduction paradigm. At the middle level we can explain various constraint propagation algorithms. Finally, at the lowest level we c...
متن کاملAdding Integrity Constraints to the Semantic Web for Instance Data Evaluation
This paper presents our work on supporting evaluation of integrity constraint issues in semantic web instance data. We propose an alternative semantics for the ontology language, i.e., OWL, a decision procedure for constraint evaluation by query answering, and an approach of explaining and repairing integrity constraint violations by utilizing the justifications of conjunctive query answers. ke...
متن کامل