Principles and Practice of Constraint Programming – CP 2003

DOI10.1007/B13743MaRDI QIDQ5897198zbMATH OpenOpenAlexFDO

Authors Chi Kan Cheng, Peter J. Stuckey, J. H. M. Lee

Publication date 2 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13743

Mathematics Subject Classification ID

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

Recommendations

• Constructing And Selecting Adjacency Constraints
• Generating box-constrained optimization problems
• Lower bounds for adaptive collect and related objects
• Adapting consistency in constraint solving
• Approximate quantified constraint solving by cylindrical box decomposition
• scientific article; zbMATH DE number 1738291

Cited in

(2)

• Automatic generation of redundant models for permutation constraint satisfaction problems
• Applying ad-hoc global constraints with the case constraint to still-life

Describes a project that uses

Uses Software

• CSPLib
• Prolog

This page was built for publication: Principles and Practice of Constraint Programming – CP 2003

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