Revisiting global constraint satisfaction
type: Item
instance of: scholarly article
title: Revisiting global constraint satisfaction
zbMATH Open document ID: 0925.68195
DOI: 10.1016/S0020-0190(98)00023-4
author: Walter Hower
published in: Information Processing Letters
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1190216
zbMATH Keywords: analysis/design of algorithms
zbMATH Keywords: combinatorial problems
zbMATH Keywords: computational complexity
zbMATH Keywords: constraint satisfaction
MaRDI profile type: Publication
cites work: Constraint satisfaction from a deductive viewpoint
cites work: An Average Time Analysis of Backtracking
cites work: An optimal k-consistency algorithm
cites work: From local to global consistency
cites work: Local and global relational consistency
cites work: Synthesizing constraint expressions
cites work: Constraint satisfaction -- algorithms and complexity analysis
cites work: Fine-grained conflict resolution in constraint satisfaction problems
cites work: Tractable constraints on ordered domains
cites work: Estimating the Efficiency of Backtrack Programs
cites work: Generalized constraint propagation over the CLP scheme
cites work: Avoiding Cartesian products for multiple joins
cites work: Exploiting the deep structure of constraint problems
description: scientific article; zbMATH DE number 1190216