Decomposable constraints

DOI10.1016/S0004-3702(00)00051-5zbMath0952.68130MaRDI QIDQ1589469

Toby Walsh, Kostas Stergiou, Ian Philip Gent

Publication date: 12 December 2000

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

searchconstraint satisfactionmaintaining arc consistencygeneralized arc consistencydecomposable constraints

Mathematics Subject Classification ID

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

Uses Software

• FINDER
• Mace4

Cites Work

• Tree clustering for constraint networks
• A generic arc-consistency algorithm and its specializations
• A theoretical evaluation of selected backtracking algorithms.
• Networks of constraints: Fundamental properties and applications to picture processing
• A sufficient condition for backtrack-bounded search
• A Sufficient Condition for Backtrack-Free Search
• Unnamed Item

This page was built for publication: Decomposable constraints