Arc consistency for soft constraints
From MaRDI portal
Publication:814581
DOI10.1016/j.artint.2003.09.002zbMath1085.68672arXivcs/0111038OpenAlexW2084041193MaRDI QIDQ814581
Thomas Schiex, Martin C. Cooper
Publication date: 7 February 2006
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0111038
Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Tractability-preserving transformations of global cost functions, Semiring induced valuation algebras: exact and approximate local computation algorithms, Residuation for bipolar preferences in soft constraints, Modularity-based decompositions for valued CSP, Multi-language evaluation of exact solvers in graphical model discrete optimization, Distributivity and residuation for lexicographic orders, Semiring-Based Soft Constraints, Fuzzy constraint satisfaction problem for model-based image interpretation, Triangle-based consistencies for cost function networks, Computational protein design as an optimization problem, Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms, Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms, Soft arc consistency revisited, Residuation for soft constraints: lexicographic orders and approximation techniques, Minimization of locally defined submodular functions by optimal soft arc consistency, Local Computation Schemes with Partially Ordered Preferences, Soft Constraints Processing over Divisible Residuated Lattices, Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited, Solving finite domain constraint hierarchies by local consistency and tree search, AND/OR branch-and-bound search for combinatorial optimization in graphical models, MiniBrass: soft constraints for MiniZinc, The Power of Linear Programming for General-Valued CSPs, Partial Valuation Structures for Qualitative Soft Constraints, Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction, Cyclic consistency: A local reduction operation for binary valued constraints, Solving weighted CSP by maintaining arc consistency, High-order consistency in valued constraint satisfaction
Cites Work
- Unnamed Item
- Maintaining reversible DAC for Max-CSP
- General properties and termination conditions for soft constraint propagation
- Triangular norms
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- Reduction operations in fuzzy or valued constraint satisfaction
- Scene Labeling by Relaxation Operations
- Principles and Practice of Constraint Programming – CP 2003
- Totally ordered commutative monoids
