On forward checking for non-binary constraint satisfaction.
type: Item
instance of: scholarly article
title: On forward checking for non-binary constraint satisfaction.
zbMATH Open document ID: 1043.68090
DOI: 10.1016/S0004-3702(02)00263-1
author: P. Meseguer
author: Eugene C. Freuder
author: Javier Larrosa
author: Christian Bessiere
published in: Artificial Intelligence
publication date: 2003-01-21T00:00:00Z
review text: Solving non-binary constraint satisfaction problems, a crucial challenge today, can be tackled in two different ways: translating the non-binary problem into an equivalent binary one, or extending binary search algorithms to solve directly the original problem. The latter option raises some issues when we want to extend definitions written for the binary case. This paper focuses on the well-known forward checking algorithm, and shows that it can be generalized to several non-binary versions, all fitting its binary definition. The classical non-binary version, proposed by Van Hentenryck, is only one of these generalizations.
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 1856155
zbMATH Keywords: Constraint satisfaction
zbMATH Keywords: Non-binary constraints
zbMATH Keywords: Forward checking
describes a project that uses: ILOG SCHEDULE
MaRDI profile type: Publication
cites work: Q4475620
cites work: Backtrack Programming
cites work: A theoretical evaluation of selected backtracking algorithms.
full work available at URL: s0004-3702(02)00263-1
OpenAlex ID: W2020463765
description: scientific article; zbMATH DE number 1856155