Soft and Cost MDD Propagators

Authors

  • Guillaume Perez University of Nice-Sophia Antipolis
  • Jean-Charles Régin University of Nice-Sophia Antipolis

DOI:

https://doi.org/10.1609/aaai.v31i1.11130

Keywords:

MDD, propagator, global constraints, arc consistency

Abstract

Recent developments of efficient propagators, operations and creation methods for MDDs allow us to directly build efficient MDD-based models, without the need for intermediate data structures. In this paper, we take another step in this direction by improving the propagators of cost MDDs. In addition, we introduce a soft MDD propagator in order to deal with unsatisfiable problems. This directly offers cost and soft versions for table constraints and any constraints which can be represented by an MDD (regular, slide, knapsack...).

Downloads

Published

2017-02-12

How to Cite

Perez, G., & Régin, J.-C. (2017). Soft and Cost MDD Propagators. Proceedings of the AAAI Conference on Artificial Intelligence, 31(1). https://doi.org/10.1609/aaai.v31i1.11130

Issue

Section

Main Track: Search and Constraint Satisfaction