On a new extension of BTP for binary CSPs

DOI10.1007/s10601-018-9290-9zbMath1468.68196OpenAlexW2810353411WikidataQ129585786 ScholiaQ129585786MaRDI QIDQ2331096

Achref El Mouelhi

Publication date: 25 October 2019

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-018-9290-9

zbMATH Keywords

variable eliminationtractable classarc consistencybroken trianglevalue merging

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems
• A hybrid tractable class for non-binary CSPs
• Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
• Tree clustering for constraint networks
• Consistency in networks of relations
• Networks of constraints: Fundamental properties and applications to picture processing
• Variable and value elimination in binary constraint satisfaction via forbidden patterns
• A Sufficient Condition for Backtrack-Free Search
• The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
• Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms
• Tractable constraints on ordered domains

This page was built for publication: On a new extension of BTP for binary CSPs