Soft arc consistency revisited
From MaRDI portal
Publication:969527
DOI10.1016/j.artint.2010.02.001zbMath1213.68580OpenAlexW1988443389MaRDI QIDQ969527
Publication date: 7 May 2010
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2010.02.001
submodularityconstraint optimizationgraphical modelweighted constraint satisfaction problemlocal consistencysoft constraintssoft arc consistencyvalued constraint satisfaction problem
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Tractability in constraint satisfaction problems: a survey ⋮ Tractability-preserving transformations of global cost functions ⋮ Modularity-based decompositions for valued CSP ⋮ Multi-language evaluation of exact solvers in graphical model discrete optimization ⋮ Multiple-choice knapsack constraint in graphical models ⋮ New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach ⋮ Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs ⋮ Super-reparametrizations of weighted CSPs: properties and optimization perspective ⋮ Virtual pairwise consistency in cost function networks ⋮ Tractability of explaining classifier decisions ⋮ Approximate Counting with Deterministic Guarantees for Affinity Computation ⋮ Fuzzy constraint satisfaction problem for model-based image interpretation ⋮ Computing a partition function of a generalized pattern-based energy over a semiring ⋮ Triangle-based consistencies for cost function networks ⋮ Computational protein design as an optimization problem ⋮ Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms ⋮ Models and solution techniques for frequency assignment problems ⋮ Variable neighborhood search for graphical model energy minimization ⋮ ToulBar2 ⋮ Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited ⋮ MiniBrass: soft constraints for MiniZinc ⋮ The Power of Linear Programming for General-Valued CSPs ⋮ Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction ⋮ Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction ⋮ Iterative and core-guided maxsat solving: a survey and assessment
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudo-Boolean optimization
- A new polynomial-time algorithm for linear programming
- Arc consistency for soft constraints
- Cyclic consistency: A local reduction operation for binary valued constraints
- High-order consistency in valued constraint satisfaction
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
- A faster strongly polynomial time algorithm for submodular function minimization
- Minimization of locally defined submodular functions by optimal soft arc consistency
- Reasoning from last conflict(s) in constraint programming
- Radio link frequency assignment
- The partial constraint satisfaction problem: Facets and lifting theorems
- Realization of set functions as cut functions of graphs and hypergraphs
- Reduction operations in fuzzy or valued constraint satisfaction
- The essence of constraint propagation
- The complexity of soft constraint satisfaction
- Solving the simple plant location problem by genetic algorithm
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
- Optimal Value of Information in Graphical Models
- Bounds Arc Consistency for Weighted CSPs
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Minimum cuts, modular functions, and matroid polyhedra
- NEW MAXIMUM FLOW ALGORITHMS BY MA ORDERMGS AND SCALING
- Tractable constraints on ordered domains
