Local and global relational consistency
From MaRDI portal
Publication:1391940
DOI10.1016/S0304-3975(97)86737-0zbMath0902.68043MaRDI QIDQ1391940
Rina Dechter, Peter J. L. van Beek
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
68P15: Database theory
Related Items
The complexity of equality constraint languages, Determining the consistency of partial tree descriptions, Local consistency for extended CSPs, Revisiting global constraint satisfaction, Backjump-based backtracking for constraint satisfaction problems, The essence of constraint propagation, Solving quantified constraint satisfaction problems, Domain filtering consistencies for non-binary constraints, Locally consistent constraint satisfaction problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Network-based heuristics for constraint-satisfaction problems
- Tree clustering for constraint networks
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- An optimal k-consistency algorithm
- Temporal constraint networks
- From local to global consistency
- A generic arc-consistency algorithm and its specializations
- Consistency in networks of relations
- Fast parallel constraint satisfaction
- Characterising tractable constraints
- Networks of constraints: Fundamental properties and applications to picture processing
- Contribution to nonserial dynamic programming
- On the Desirability of Acyclic Database Schemes
- The Computational Complexity of Simultaneous Diophantine Approximation Problems
- A Sufficient Condition for Backtrack-Free Search
- Synthesizing constraint expressions
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- On the minimality and global consistency of row-convex constraint networks
- A Computing Procedure for Quantification Theory
- Topological parameters for time-space tradeoff
