Sciweavers

18 search results - page 1 / 4
» Refining the Basic Constraint Propagation Algorithm
Sort
View
IJCAI
2001
13 years 6 months ago
Refining the Basic Constraint Propagation Algorithm
Constraint propagation is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the us...
Christian Bessière, Jean-Charles Rég...
ICDE
2003
IEEE
134views Database» more  ICDE 2003»
14 years 5 months ago
Propagating XML Constraints to Relations
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
Susan B. Davidson, Wenfei Fan, Carmem S. Hara, Jin...
JAIR
2010
145views more  JAIR 2010»
13 years 3 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
AIPS
1994
13 years 5 months ago
Managing Dynamic Temporal Constraint Networks
This paper concerns the specialization of arcconsistency algorithms for constraint satisfaction in the management of quantitative temporal constraint networks. Attention is devote...
Roberto Cervoni, Amedeo Cesta, Angelo Oddi
AAAI
1998
13 years 5 months ago
An Algebra for Cyclic Ordering of 2D Orientations
Wedefine an algebra of ternary relations for cyclic ordering of 2Dorientations. Thealgebra (1) is a refinement of the CYCORDtheory; (2) contains 24 atomic relations, hence 224 gen...
Amar Isli, Anthony G. Cohn