The following pages link to (Q4473033):
Displaying 8 items.
- Tractability-preserving transformations of global cost functions (Q309935) (← links)
- Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
- Soft arc consistency revisited (Q969527) (← links)
- On the limits of forgetting in answer set programming (Q2211850) (← links)
- Semantic forgetting in answer set programming (Q2389674) (← links)
- When you must forget: Beyond strong persistence when forgetting in answer set programming (Q4592710) (← links)
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited (Q5229963) (← links)
- Approximate Counting with Deterministic Guarantees for Affinity Computation (Q5357750) (← links)
