Bounds Arc Consistency for Weighted CSPs

DOI10.1613/jair.2797zbMath1192.68656arXiv1401.3481OpenAlexW2100921442WikidataQ129560020 ScholiaQ129560020MaRDI QIDQ3651473

Matthias Zytnicki, Christine Gaspin, Simon de Givry, Thomas Schiex

Publication date: 10 December 2009

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

Full work available at URL: https://arxiv.org/abs/1401.3481

zbMATH Keywords

semantics of cost functions

Mathematics Subject Classification ID

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

Related Items (4)

Tractability-preserving transformations of global cost functions ⋮ Multiple-choice knapsack constraint in graphical models ⋮ Soft arc consistency revisited ⋮ Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction

Uses Software

• DARN!

This page was built for publication: Bounds Arc Consistency for Weighted CSPs