Soft Constraints Processing over Divisible Residuated Lattices
From MaRDI portal
Recommendations
Cites work
- A treatise on many-valued logics
- An Algebraic Characterisation of Complexity for Valued Constraint
- An algebraic approach to non-classical logics
- Arc consistency for soft constraints
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Metamathematics of fuzzy logic
- Networks of constraints: Fundamental properties and applications to picture processing
- On Fuzzy Logic I Many‐valued rules of inference
- On the structure of generalized BL-algebras
- Residuated lattices. An algebraic glimpse at substructural logics
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- Semiring-based constraint satisfaction and optimization
- Solving weighted CSP by maintaining arc consistency
- The complexity of soft constraint satisfaction
- The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete
- Triangular norms
This page was built for publication: Soft Constraints Processing over Divisible Residuated Lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638207)