Sciweavers

1378 search results - page 45 / 276
» The Tractability of Global Constraints
Sort
View
IJCAI
1993
15 years 3 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe
CP
2007
Springer
15 years 8 months ago
Advisors for Incremental Propagation
Abstract. While incremental propagation for global constraints is recognized to be important, little research has been devoted to how propagator-centered constraint programming sys...
Mikael Z. Lagerkvist, Christian Schulte
CP
2004
Springer
15 years 7 months ago
Deriving Filtering Algorithms from Constraint Checkers
Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in n, w...
Nicolas Beldiceanu, Mats Carlsson, Thierry Petit
PODS
2001
ACM
85views Database» more  PODS 2001»
16 years 2 months ago
On XML Integrity Constraints in the Presence of DTDs
The paper investigates XML document speci cations with DTDs and integrity constraints, such as keysand foreign keys. We study the consistency problem of checking whether a given s...
Wenfei Fan, Leonid Libkin
AI
2006
Springer
15 years 2 months ago
The complexity of soft constraint satisfaction
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...