Soft Constraints Processing over Divisible Residuated Lattices

DOI10.1007/978-3-642-02906-6_76zbMath1245.68171OpenAlexW22868624MaRDI QIDQ3638207

Simone Bova

Publication date: 2 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02906-6_76

Mathematics Subject Classification ID

Other algebras related to logic (03G25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Ordered semigroups and monoids (06F05)

Related Items (1)

Residuation for bipolar preferences in soft constraints

Cites Work

• Unnamed Item
• Arc consistency for soft constraints
• Solving weighted CSP by maintaining arc consistency
• On the structure of generalized BL-algebras
• Residuated lattices. An algebraic glimpse at substructural logics
• The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete
• An algebraic approach to non-classical logics
• Metamathematics of fuzzy logic
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Triangular norms
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Networks of constraints: Fundamental properties and applications to picture processing
• The complexity of soft constraint satisfaction
• An Algebraic Characterisation of Complexity for Valued Constraint
• On Fuzzy Logic I Many‐valued rules of inference
• Semiring-based constraint satisfaction and optimization

This page was built for publication: Soft Constraints Processing over Divisible Residuated Lattices