On forward checking for non-binary constraint satisfaction.

DOI10.1016/S0004-3702(02)00263-1zbMath1043.68090OpenAlexW2020463765MaRDI QIDQ1852854

Eugene C. Freuder, Javier Larrosa, Pedro Meseguer, Christian Bessiere

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00263-1

zbMATH Keywords

Constraint satisfactionForward checkingNon-binary constraints

Mathematics Subject Classification ID

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

Related Items (8)

Partition search for non-binary constraint satisfaction ⋮ Computing and restoring global inverse consistency in interactive constraint satisfaction ⋮ Domain filtering consistencies for non-binary constraints ⋮ A non-binary constraint ordering heuristic for constraint satisfaction problems ⋮ Dealing with satisfiability and \(n\)-ary CSPs in a logical framework ⋮ Combining restarts, nogoods and bag-connected decompositions for solving csps ⋮ Data optimizations for constraint automata ⋮ Integrating operations research in constraint programming

Uses Software

• ILOG SCHEDULE

Cites Work

• A theoretical evaluation of selected backtracking algorithms.
• Backtrack Programming
• Unnamed Item

This page was built for publication: On forward checking for non-binary constraint satisfaction.