Reformulation of global constraints based on constraints checkers
type: Item
instance of: scholarly article
title: Reformulation of global constraints based on constraints checkers
zbMATH Open document ID: 1103.68804
author: Nicolas Beldiceanu
author: Mats Carlsson
author: R. Debruyne
author: Thierry Petit
published in: Constraints
publication date: 2006-11-03T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5070679
zbMATH Keywords: global constraints
zbMATH Keywords: automata
zbMATH Keywords: reformulation
describes a project that uses: HIBISCUS
describes a project that uses: SICStus
describes a project that uses: CPLEX
describes a project that uses: CSPLib
MaRDI profile type: Publication
full work available at URL: s10601-005-2809-x
OpenAlex ID: W2147035284
cites work: Programming Languages and Systems
cites work: Consistency restoration and explanations in dynamic CSPs---Application to configuration
cites work: Q4809151
cites work: Q4475652
cites work: Q4667435
cites work: Q4475633
cites work: Introducing global constraints in CHIP
cites work: Q4472552
cites work: Q5688929
cites work: Tree clustering for constraint networks
cites work: Q3668890
cites work: Q4099676
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: On the Desirability of Acyclic Database Schemes
cites work: Degrees of acyclicity for hypergraphs and relational database schemes
cites work: Q4475645
cites work: Using constraint metaknowledge to reduce arc consistency computation
cites work: An optimal coarse-grained arc consistency algorithm
cites work: Q4473038
cites work: Q4736503
cites work: Mixed global constraints and inference in hybrid CLP--IP solvers
cites work: Q4475646
cites work: Q3049801
cites work: Q4414647
DOI: 10.1007/S10601-005-2809-X
description: scientific article; zbMATH DE number 5070679