Binary vs. non-binary constraints
From MaRDI portal
Publication:1614859
DOI10.1016/S0004-3702(02)00210-2zbMath0999.68201WikidataQ60638502 ScholiaQ60638502MaRDI QIDQ1614859
Fahiem Bacchus, Xinguang Chen, Toby Walsh, Peter J. L. van Beek
Publication date: 9 September 2002
Published in: Artificial Intelligence (Search for Journal in Brave)
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) General topics in artificial intelligence (68T01)
Related Items
Partition search for non-binary constraint satisfaction, Domain filtering consistencies for non-binary constraints, Binarisation for Valued Constraint Satisfaction Problems, PC-SyncBB: a privacy preserving collusion secure DCOP algorithm, Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms, On the power of structural decompositions of graph-based representations of constraint problems
Uses Software
Cites Work