Artificial Intelligence - Special issue on knowledge representation
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Local search with constraint propagation and conflict-based heuristics
Artificial Intelligence
Maintaining Arc-Consistency within Dynamic Backtracking
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Jackson's pseudo-preemptive schedule and cumulative scheduling problems
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
The Design of the Zinc Modelling Language
Constraints
Efficient constraint propagation engines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Edge Finding for Cumulative Scheduling
INFORMS Journal on Computing
Propagation via lazy clause generation
Constraints
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Complete MCS-based search: application to resource constrained project scheduling
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
SAT-Solving in Practice, with a Tutorial Example from Supervisory Control
Discrete Event Dynamic Systems
Propagation = lazy clause generation
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Lazy clause generation reengineered
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Why cumulative decomposition is not as bad as it sounds
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Edge finding filtering algorithm for discrete cumulative resources in O(kn log n)
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Computing explanations for the unary resource constraint
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Not-First and not-last detection for cumulative scheduling in O(n3 log n)
INAP'05 Proceedings of the 16th international conference on Applications of Declarative Programming and Knowledge Management
O(n log n) overload checking for the cumulative constraint and its application
INAP'05 Proceedings of the 16th international conference on Applications of Declarative Programming and Knowledge Management
A new o(n2log n) not-first/not-last pruning algorithm for cumulative resource constraints
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Explanations for the cumulative constraint: an experimental study
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Timetable edge finding filtering algorithm for discrete cumulative resources
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Reconsidering mixed integer programming and MIP-Based hybrids for scheduling
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Maximising the net present value for resource-constrained project scheduling
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Inter-instance nogood learning in constraint programming
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Solving RCPSP/max by lazy clause generation
Journal of Scheduling
Inductive definitions in constraint programming
ACSC '13 Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Hi-index | 0.00 |
The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal of research has investigated new stronger and faster filtering techniques for cumulative, but still most of these techniques only pay off in limited cases or are not scalable. Recently, the "lazy clause generation" hybrid solving approach has been devised which allows a finite domain propagation engine possible to take advantage of advanced SAT technology, by "lazily" creating a SAT model of an FD problem as computation progresses. This allows the solver to make use of SAT explanation and autonomous search capabilities. In this article we show how, once we use lazy clause generation, modelling the cumulative constraint by decomposition creates a highly competitive version of cumulative. Using decomposition into component parts automatically makes the propagator incremental and able to explain itself. We then show how, using the insights from the behaviour of the decomposition, we can create global cumulative constraints that explain their propagation. We compare these approaches to explaining the cumulative constraint on resource constrained project scheduling problems. All our methods are able to close a substantial number of open problems from the well-established PSPlib benchmark library of resource-constrained project scheduling problems.