Some new tractable classes of CSPs and their relations with backtracking algorithms

DOI10.1007/978-3-642-38171-3_5MaRDI QIDQ4922904zbMATH OpenOpenAlexFDO

Authors Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini

Publication date 4 June 2013

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38171-3_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• New tractable classes from old
• Principles and Practice of Constraint Programming – CP 2004
• scientific article; zbMATH DE number 2080305
• Tractability in constraint satisfaction problems: a survey
• A theoretical evaluation of selected backtracking algorithms.

Cited in

(6)

• From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems
• On a new extension of BTP for binary CSPs
• Variable and value elimination in binary constraint satisfaction via forbidden patterns
• Hybrid tractable classes of constraint problems
• Inter-block Backtracking: Exploiting the Structure in Continuous CSPs
• A hybrid tractable class for non-binary CSPs

This page was built for publication: Some new tractable classes of CSPs and their relations with backtracking algorithms

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