Partition search for non-binary constraint satisfaction
From MaRDI portal
Publication:2372239
DOI10.1016/j.ins.2007.03.030zbMath1119.68446OpenAlexW2067754118MaRDI QIDQ2372239
Publication date: 25 July 2007
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2007.03.030
consistencyconstraint satisfactionnon-binary constraintsdecision diagramforward checkingrandom problemsBDDpartition searchdual searchhash joinmultijoinsemijoin reduction
Related Items
Strong local consistency algorithms for table constraints, Computing and restoring global inverse consistency in interactive constraint satisfaction, Promoting robust black-box solvers through competitions, Efficient algorithms for singleton arc consistency, STR2: optimized simple tabular reduction for table constraints, An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints, Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints, A new method for solving interval and fuzzy equations: linear case, From MDD to BDD and arc consistency, STR3: a path-optimal filtering algorithm for table constraints, Optimal and efficient filtering algorithms for table constraints, Improving the lower bound of simple tabular reduction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reduction operations for constraint satisfaction
- Network-based heuristics for constraint-satisfaction problems
- Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
- A generic arc-consistency algorithm and its specializations
- Consistency in networks of relations
- Decomposing constraint satisfaction problems using database techniques
- New tractable classes from old
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Binary decision diagrams in theory and practice
- Binary vs. non-binary constraints
- Networks of constraints: Fundamental properties and applications to picture processing
- On forward checking for non-binary constraint satisfaction.
- An overview of backtrack search satisfiability algorithms
- Maintenance scheduling problems as benchmarks for constraint algorithms
- An average analysis of backtracking on random constraint satisfaction problems
- An empirical study of phase transitions in binary constraint satisfaction problems
- Locating the phase transition in binary constraint satisfaction problems
- Algorithms for trie compaction
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Mini-buckets
- Computer Architecture for Solving Consistent Labelling Problems
- Graph-Based Algorithms for Boolean Function Manipulation
- Using Semi-Joins to Solve Relational Queries
- Analysis of a heuristic for full trie minimization
- Discrete Optimization by Relational Constraint Satisfaction
- Estimating optimal parameters for parallel database hardware
- An Algorithm for Subgraph Isomorphism
- A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words
- Branching Programs and Binary Decision Diagrams
- Backtrack Programming
- Associating parts of patterns
- Random constraint satisfaction: A more accurate picture
- Random constraint satisfaction: Flaws and structure
