Generalized support and formal development of constraint propagators

DOI10.3233/AIC-170740MaRDI QIDQ4591401zbMATH OpenOpenAlexFDO

Authors James Caldwell, Ian P. Gent, Peter W. Nightingale

Publication date 15 November 2017

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1504.05846

zbMATH Keywords

constraint programmingconstraint satisfaction problemformal methods

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Abstract: Constraint programming is a family of techniques for solving combinatorial problems, where the problem is modelled as a set of decision variables (typically with finite domains) and a set of constraints that express relations among the decision variables. One key concept in constraint programming is propagation: reasoning on a constraint or set of constraints to derive new facts, typically to remove values from the domains of decision variables. Specialised propagation algorithms (propagators) exist for many classes of constraints. The concept of support is pervasive in the design of propagators. Traditionally, when a domain value ceases to have support, it may be removed because it takes part in no solutions. Arc-consistency algorithms such as AC2001 make use of support in the form of a single domain value. GAC algorithms such as GAC-Schema use a tuple of values to support each literal. We generalize these notions of support in two ways. First, we allow a set of tuples to act as support. Second, the supported object is generalized from a set of literals (GAC-Schema) to an entire constraint or any part of it. We design a methodology for developing correct propagators using generalized support. A constraint is expressed as a family of support properties, which may be proven correct against the formal semantics of the constraint. Using Curry-Howard isomorphism to interpret constructive proofs as programs, we show how to derive correct propagators from the constructive proofs of the support properties. The framework is carefully designed to allow efficient algorithms to be produced. Derived algorithms may make use of dynamic literal triggers or watched literals for efficiency. Finally, two case studies of deriving efficient algorithms are given.

Recommendations

• Short and long supports for constraint propagation
• View-based propagator derivation
• scientific article; zbMATH DE number 2080331
• Generalized constraint propagation over the CLP scheme
• The power of propagation: when GAC is enough

Cited in

(17)

• The power of propagation: when GAC is enough
• Propagation via lazy clause generation
• View-based propagator derivation
• Propagation engine prototyping with a domain specific language
• View-based propagation of decomposable constraints
• Constraint propagation for first-order logic and inductive definitions
• A parametric propagator for pairs of \textsc{Sum} constraints with a discrete convexity property
• Propagation = Lazy Clause Generation
• Watched Literals for Constraint Propagation in Minion
• Generating Propagators for Finite Set Constraints
• scientific article; zbMATH DE number 2080550 (Why is no real title available?)
• Short and long supports for constraint propagation
• When is it worthwhile to propagate a constraint? A probabilistic analysis of \textsc{AllDifferent}
• From support propagation to belief propagation in constraint programming
• Dynamic Analysis of Bounds Versus Domain Propagation
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Generalized support and formal development of constraint propagators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4591401)