The power of propagation: when GAC is enough
type: Item
instance of: scholarly article
title: The power of propagation: when GAC is enough
zbMATH Open document ID: 1387.90130
author: David A. Cohen
author: P. Jeavons
published in: Constraints
publication date: 2018-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6842347
zbMATH Keywords: constraint satisfaction
zbMATH Keywords: arc-consistency
zbMATH Keywords: global constraints
zbMATH Keywords: propagators
describes a project that uses: CSPLib
MaRDI profile type: Publication
full work available at URL: s10601-016-9251-0
OpenAlex ID: W2508219224
cites work: Optimization Methods for the Partner Units Problem
cites work: GAC Via Unit Propagation
cites work: On the Desirability of Acyclic Database Schemes
cites work: Global constraint catalogue: past, present and future
cites work: The complexity of reasoning with global constraints
cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side
cites work: Classifying the Complexity of Constraints Using Finite Algebras
cites work: Principles and Practice of Constraint Programming – CP 2003
cites work: The complexity of global cardinality constraints
cites work: Constraint satisfaction with succinctly specified relations
cites work: Tractable decision for a constraint language implies tractable search
cites work: A unified theory of structural tractability for constraint satisfaction problems
cites work: Constraint satisfaction problems: convexity makes AllDifferent constraints tractable
cites work: The complexity of completing partial Latin squares
cites work: Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems
cites work: Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
cites work: The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
cites work: Tree clustering for constraint networks
cites work: Q4495111
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: A Sufficient Condition for Backtrack-Free Search
cites work: Tractable cases of the extended global cardinality constraint
cites work: A comparison of structural CSP decomposition methods
cites work: Decomposing constraint satisfaction problems using database techniques
cites work: Closure properties of constraints
cites work: Tractable constraints on ordered domains
cites work: Tractable hypergraph properties for constraint satisfaction and conjunctive queries
cites work: Q3184605
DOI: 10.1007/S10601-016-9251-0
description: scientific article; zbMATH DE number 6842347