An Algebraic Approach to Valued Constraint Satisfaction

DOI10.4230/LIPIcs.CSL.2017.42zbMath1440.68121OpenAlexW2756790058MaRDI QIDQ5111213

Tommaso Moraschini, Rostislav Horčík, Amanda Vidal

Publication date: 26 May 2020

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7676/pdf/LIPIcs-CSL-2017-42.pdf

zbMATH Keywords

polymorphismvalued CSPpp-definabilityGeiger's theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Fraïssé classes of graded relational structures ⋮ Unnamed Item ⋮ A Lindström theorem in many-valued modal logic over a finite MTL-chain ⋮ Fuzzy intensional semantics

This page was built for publication: An Algebraic Approach to Valued Constraint Satisfaction