Pages that link to "Item:Q1656556"
From MaRDI portal
The following pages link to Approximately propagation complete and conflict propagating constraint encodings (Q1656556):
Displaying 6 items.
- NP-completeness of small conflict set generation for congruence closure (Q1688538) (← links)
- An algorithm-independent measure of progress for linear constraint propagation (Q2112621) (← links)
- Learning a propagation complete formula (Q2170198) (← links)
- On the Complexity of Insertion Propagation with Functional Dependency Constraints (Q2817905) (← links)
- Stronger Inference through Implied Literals from Conflicts and Knapsack Covers (Q4922900) (← links)
- Logic Programming (Q5191487) (← links)