Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
From MaRDI portal
Publication:1818347
Recommendations
Cited in
(78)- Representing interval orders by weighted bases: some complexity results
- The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
- On the use of aggregation operations in information fusion processes.
- Fuzzy constraint satisfaction problem for model-based image interpretation
- Finding a given number of solutions to a system of fuzzy constraints
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
- A hybrid framework for over-constrained generalized resource-constrained project scheduling problems
- A framework for optimal correction of inconsistent linear constraints
- Reduction operations in fuzzy or valued constraint satisfaction
- Semirings for constraint solving and programming.
- The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP
- Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs
- Semiring programming: a semantic framework for generalized sum product problems
- Zero divisors and prime elements of bounded semirings.
- Lexicographically-ordered constraint satisfaction problems
- MiniBrass: soft constraints for MiniZinc
- Models and emerging trends of concurrent constraint programming
- Relaxations of semiring constraint satisfaction problems
- Semiring induced valuation algebras: exact and approximate local computation algorithms
- The complexity of soft constraint satisfaction
- On-line resources allocation for ATM networks with rerouting
- 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
- Quantitative \(\mu\)-calculus and CTL defined over constraint semirings
- Abstracting soft constraints: framework, properties, examples
- Tractability in constraint satisfaction problems: a survey
- The p-box cdf-intervals: a reliable constraint reasoning with quantifiable information
- A proof theoretic study of soft concurrent constraint programming
- Representing Utility Functions via Weighted Goals
- Solving finite domain constraint hierarchies by local consistency and tree search
- Semiring-Based Soft Constraints
- Dealing with Incomplete Preferences in Soft Constraint Problems
- The Expressive Power of Valued Constraints: Hierarchies and Collapses
- Interchangeability with thresholds and degradation factors for soft CSPs
- Soft Constraints Processing over Divisible Residuated Lattices
- Constraint optimization techniques for exact multi-objective optimization
- Semiring-based constraint satisfaction and optimization
- scientific article; zbMATH DE number 1954162 (Why is no real title available?)
- scientific article; zbMATH DE number 1759706 (Why is no real title available?)
- Reasoning on multirelational contextual hierarchies via answer set programming with algebraic measures
- AI 2003: Advances in Artificial Intelligence
- Partial valuation structures for qualitative soft constraints
- Global propagation of side constraints for solving over-constrained problems
- 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
- Interval-valued soft constraint problems
- Computing a partition function of a generalized pattern-based energy over a semiring
- Quantaloidal approach to constraint satisfaction
- On the modelling and optimization of preferences in constraint-based temporal reasoning
- Semiring reasoning frameworks in AI and their computational complexity
- Aspmc: new frontiers of algebraic answer set counting
- Compact representation of preferences
- Any-k algorithms for enumerating ranked answers to conjunctive queries
- Quantum relaxations of CSP and structure isomorphism
- 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
- Stochastic constraint programming: A scenario-based approach
- Decision-support with preference constraints
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights
- Subexponential concurrent constraint programming
- Combining VNS with constraint programming for solving anytime optimization problems
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
- Soft constraint abstraction based on semiring homomorphism
- The expressive power of valued constraints: Hierarchies and collapses
- The expressive power of binary submodular functions
- Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies
- A note on some collapse results of valued constraints
This page was built for publication: Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818347)
