Sciweavers

Share
53 search results - page 1 / 11
» Generating Propagators for Finite Set Constraints
Sort
View
CP
2006
Springer
8 years 12 months ago
Generating Propagators for Finite Set Constraints
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
Guido Tack, Christian Schulte, Gert Smolka
CP
2000
Springer
9 years 17 days ago
Automatic Generation of Propagation Rules for Finite Domains
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
Slim Abdennadher, Christophe Rigotti
CP
2004
Springer
9 years 1 months ago
Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
Andrew Sadler, Carmen Gervet
CONSTRAINTS
2007
89views more  CONSTRAINTS 2007»
8 years 8 months ago
Cardinal: A Finite Sets Constraint Solver
In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...
Francisco Azevedo
ACL
1990
8 years 9 months ago
Structural Disambiguation with Constraint Propagation
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
Hiroshi Maruyama
books