Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
From MaRDI portal
Publication:1818347
DOI10.1023/A:1026441215081zbMath0946.68143OpenAlexW1567384271MaRDI QIDQ1818347
Publication date: 17 October 2000
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1026441215081
Related Items (66)
Reduction operations in fuzzy or valued constraint satisfaction ⋮ Tractability in constraint satisfaction problems: a survey ⋮ Stochastic constraint programming: A scenario-based approach ⋮ Decision-support with preference constraints ⋮ Semiring induced valuation algebras: exact and approximate local computation algorithms ⋮ Interchangeability with thresholds and degradation factors for soft CSPs ⋮ The P-Box CDF-Intervals: A Reliable Constraint Reasoning with Quantifiable Information ⋮ A Proof Theoretic Study of Soft Concurrent Constraint Programming ⋮ Possibilistic logic: a retrospective and prospective view ⋮ Fuzzy Prolog: A new approach using soft constraints propagation ⋮ Redundant modeling in permutation weighted constraint satisfaction problems ⋮ Classes of submodular constraints expressible by graph cuts ⋮ Interleaving solving and elicitation of constraint satisfaction problems based on expected cost ⋮ Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights ⋮ Interval-valued soft constraint problems ⋮ Abstracting soft constraints: framework, properties, examples ⋮ Semiring-Based Soft Constraints ⋮ Subexponential concurrent constraint programming ⋮ Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs ⋮ Fuzzy constraint satisfaction problem for model-based image interpretation ⋮ Computing a partition function of a generalized pattern-based energy over a semiring ⋮ Semiring programming: a semantic framework for generalized sum product problems ⋮ Dealing with Incomplete Preferences in Soft Constraint Problems ⋮ The Expressive Power of Valued Constraints: Hierarchies and Collapses ⋮ On the modelling and optimization of preferences in constraint-based temporal reasoning ⋮ Unnamed Item ⋮ On the use of aggregation operations in information fusion processes. ⋮ Combining VNS with constraint programming for solving anytime optimization problems ⋮ The complexity of soft constraint satisfaction ⋮ Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques ⋮ Finding a given number of solutions to a system of fuzzy constraints ⋮ Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms ⋮ The expressive power of valued constraints: Hierarchies and collapses ⋮ Unnamed Item ⋮ The expressive power of binary submodular functions ⋮ Zero divisors and prime elements of bounded semirings. ⋮ Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies ⋮ Global propagation of side constraints for solving over-constrained problems ⋮ On-line resources allocation for ATM networks with rerouting ⋮ The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP ⋮ A hybrid framework for over-constrained generalized resource-constrained project scheduling problems ⋮ Lexicographically-ordered constraint satisfaction problems ⋮ A framework for optimal correction of inconsistent linear constraints ⋮ A note on some collapse results of valued constraints ⋮ A logic of soft constraints based on partially ordered preferences ⋮ Bucket elimination for multiobjective optimization problems ⋮ Hard and soft constraints for reasoning about qualitative conditional preferences ⋮ Integration and propagation of a multi-criteria decision making model in constraint programming ⋮ Soft Constraints Processing over Divisible Residuated Lattices ⋮ Representing Utility Functions via Weighted Goals ⋮ Solving finite domain constraint hierarchies by local consistency and tree search ⋮ Constraint Optimization Techniques for Exact Multi-Objective Optimization ⋮ Representing interval orders by weighted bases: some complexity results ⋮ MiniBrass: soft constraints for MiniZinc ⋮ Quantitative \(\mu\)-calculus and CTL defined over constraint semirings ⋮ Partial Valuation Structures for Qualitative Soft Constraints ⋮ Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures ⋮ Models and emerging trends of concurrent constraint programming ⋮ Editorial: Fuzzy set and possibility theory-based methods in artificial intelligence ⋮ Fuzzy \(rr\)DFCSP and planning ⋮ Temporal scenario modelling and recognition based on possibilistic logic ⋮ Arc consistency for soft constraints ⋮ Cyclic consistency: A local reduction operation for binary valued constraints ⋮ Solving weighted CSP by maintaining arc consistency ⋮ Constraint solving in uncertain and dynamic environments: A survey ⋮ High-order consistency in valued constraint satisfaction
This page was built for publication: Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
