A Propagator Design Framework for Constraints over Sequences

Authors

  • Jean-Noel Monette Uppsala University
  • Pierre Flener Uppsala University
  • Justin Pearson Uppsala University

DOI:

https://doi.org/10.1609/aaai.v28i1.9113

Abstract

Constraints over variable sequences are ubiquitous and many of their propagators have been inspired by dynamic programming (DP). We propose a conceptual framework for designing such propagators: pruning rules, in a functional notation, are refined upon the application of transformation operators to a DP-style formulation of a constraint; a representation of the (tuple) variable domains is picked; and a control of the pruning rules is picked.

AAAI 2014 Proceedings Cover

Downloads

Published

2014-06-21

How to Cite

Monette, J.-N., Flener, P., & Pearson, J. (2014). A Propagator Design Framework for Constraints over Sequences. Proceedings of the AAAI Conference on Artificial Intelligence, 28(1). https://doi.org/10.1609/aaai.v28i1.9113

Issue

Vol. 28 No. 1 (2014): Twenty-Eighth AAAI Conference on Artificial Intelligence

Section

Main Track: Search and Constraint Satisfaction