Partition search for non-binary constraint satisfaction
From MaRDI portal
Publication:2372239
Recommendations
Cites work
- A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words
- A generic arc-consistency algorithm and its specializations
- Algorithms for trie compaction
- An Algorithm for Subgraph Isomorphism
- An average analysis of backtracking on random constraint satisfaction problems
- An empirical study of phase transitions in binary constraint satisfaction problems
- An overview of backtrack search satisfiability algorithms
- Analysis of a heuristic for full trie minimization
- Associating parts of patterns
- Backtrack Programming
- Binary decision diagrams in theory and practice
- Binary vs. non-binary constraints
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Branching Programs and Binary Decision Diagrams
- Computer Architecture for Solving Consistent Labelling Problems
- Consistency in networks of relations
- Decomposing constraint satisfaction problems using database techniques
- Discrete Optimization by Relational Constraint Satisfaction
- Domain filtering consistencies
- Estimating optimal parameters for parallel database hardware
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 2084704 (Why is no real title available?)
- scientific article; zbMATH DE number 1746679 (Why is no real title available?)
- scientific article; zbMATH DE number 2243387 (Why is no real title available?)
- scientific article; zbMATH DE number 2243409 (Why is no real title available?)
- Locating the phase transition in binary constraint satisfaction problems
- Maintenance scheduling problems as benchmarks for constraint algorithms
- Mini-buckets: a general scheme for bounded inference
- Network-based heuristics for constraint-satisfaction problems
- Networks of constraints: Fundamental properties and applications to picture processing
- New tractable classes from old
- On forward checking for non-binary constraint satisfaction.
- Random constraint satisfaction: A more accurate picture
- Random constraint satisfaction: Flaws and structure
- Reduction operations for constraint satisfaction
- Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Using Semi-Joins to Solve Relational Queries
Cited in
(17)- 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
- Efficient algorithms for singleton arc consistency
- Strong local consistency algorithms for table constraints
- Generalized hypertree decomposition for solving non binary CSP with compressed table constraints
- Partition Crossover for Pseudo-Boolean Optimization
- Computing and restoring global inverse consistency in interactive constraint satisfaction
- STR2: optimized simple tabular reduction for table constraints
- scientific article; zbMATH DE number 2019591 (Why is no real title available?)
- scientific article; zbMATH DE number 2084731 (Why is no real title available?)
- Promoting robust black-box solvers through competitions
- Constraint reasoning
- A CP-based automatic tool for instantiating truncated differential characteristics
- An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints
This page was built for publication: Partition search for non-binary constraint satisfaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372239)
