Pages that link to "Item:Q2457664"
From MaRDI portal
The following pages link to An optimal coarse-grained arc consistency algorithm (Q2457664):
Displaying 29 items.
- Strong local consistency algorithms for table constraints (Q272003) (← links)
- New algorithms for max restricted path consistency (Q429801) (← links)
- STR2: optimized simple tabular reduction for table constraints (Q429802) (← links)
- New algorithms for bidirectional singleton arc consistency (Q474731) (← links)
- Domain consistency with forbidden values (Q481709) (← links)
- A polynomial relational class of binary CSP (Q722101) (← links)
- Reformulation of global constraints based on constraints checkers (Q850448) (← links)
- An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints (Q968351) (← links)
- Random constraint satisfaction: easy generation of hard (satisfiable) instances (Q1028939) (← links)
- Reasoning from last conflict(s) in constraint programming (Q1045989) (← links)
- On tree-preserving constraints (Q1688715) (← links)
- On singleton arc consistency for CSPs defined by monotone patterns (Q1739115) (← links)
- Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns (Q2341755) (← links)
- STR3: a path-optimal filtering algorithm for table constraints (Q2341830) (← links)
- Variable and value elimination in binary constraint satisfaction via forbidden patterns (Q2353394) (← links)
- Theoretical analysis of singleton arc consistency and its extensions (Q2389615) (← links)
- Solving quantified constraint satisfaction problems (Q2389634) (← links)
- Domain filtering consistencies for non-binary constraints (Q2389637) (← links)
- Properties of tree convex constraints (Q2389670) (← links)
- On the speed of constraint propagation and the time complexity of arc consistency testing (Q2409578) (← links)
- Efficient algorithms for singleton arc consistency (Q2430358) (← links)
- Generating custom propagators for arbitrary constraints (Q2453695) (← links)
- Automatic generation of redundant models for permutation constraint satisfaction problems (Q2460256) (← links)
- On Singleton Arc Consistency for CSPs Defined by Monotone Patterns (Q3304113) (← links)
- Path Consistency by Dual Consistency (Q3523072) (← links)
- Parameterized Complexity of the Workflow Satisfiability Problem (Q4689628) (← links)
- A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems (Q5403428) (← links)
- Efficient Algorithms for Functional Constraints (Q5504684) (← links)
- Constraint reasoning (Q6602253) (← links)
