scientific article; zbMATH DE number 2080314
From MaRDI portal
Publication:4473033
zbMATH Open1044.68777MaRDI QIDQ4473033FDOQ4473033
Authors: Javier Larrosa 
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1894/18940291.htm
Title of this publication is not available (Why is that?)
Recommendations
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Variable Elimination in Binary CSPs
- scientific article; zbMATH DE number 2243387
- Variable and value elimination in binary constraint satisfaction via forbidden patterns
- Solving connected row convex constraints by variable elimination
Cited In (15)
- Title not available (Why is that?)
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
- When you must forget: Beyond strong persistence when forgetting in answer set programming
- Solving connected row convex constraints by variable elimination
- Valued constraint satisfaction problems
- Tractability-preserving transformations of global cost functions
- Variable and value elimination in binary constraint satisfaction via forbidden patterns
- Virtual pairwise consistency in cost function networks
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- On the limits of forgetting in answer set programming
- Soft arc consistency revisited
- Semantic forgetting in answer set programming
- Approximate Counting with Deterministic Guarantees for Affinity Computation
- Principles and Practice of Constraint Programming – CP 2004
- Hybrid backtracking bounded by tree-decomposition of constraint networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473033)
