Cyclic consistency: A local reduction operation for binary valued constraints

DOI10.1016/j.artint.2003.06.004zbMath1085.68671OpenAlexW1969069392MaRDI QIDQ814586

Martin C. Cooper

Publication date: 7 February 2006

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

Full work available at URL: https://doi.org/10.1016/j.artint.2003.06.004

zbMATH Keywords

Arc consistencyConstraint propagationIn-scope reductionsLocal irreducibilityMAX-CSPPath consistencyValued constraint satisfaction problem (VCSP)

Mathematics Subject Classification ID

Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Super-reparametrizations of weighted CSPs: properties and optimization perspective ⋮ Soft arc consistency revisited ⋮ Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited ⋮ High-order consistency in valued constraint satisfaction

Cites Work

• Unnamed Item
• Arc consistency for soft constraints
• Comments on Mohr and Henderson's path consistency algorithm
• An optimal k-consistency algorithm
• Maintaining reversible DAC for Max-CSP
• Linear-time algorithms for testing the realisability of line drawings of curved objects
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Reduction operations in fuzzy or valued constraint satisfaction
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Semiring-based constraint satisfaction and optimization

This page was built for publication: Cyclic consistency: A local reduction operation for binary valued constraints