Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost

DOI10.1007/11564751_39MaRDI QIDQ3524202zbMATH OpenOpenAlexFDO

Authors Jean-Charles Régin

Publication date 9 September 2008

Published in Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Maintaining arc-consistency within dynamic backtracking
• Efficient algorithms for singleton arc consistency
• A generic arc-consistency algorithm and its specializations
• Principles and Practice of Constraint Programming – CP 2004
• An optimal arc consistency algorithm for a particular case of sequence constraint
• Cost-based arc consistency for global cardinality constraints
• Domain-heuristics for arc-consistency algorithms

Cited in

(4)

• Maintaining arc-consistency within dynamic backtracking
• Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
• Arc consistency revisited
• Saving support-checks does not always save time

This page was built for publication: Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost

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