An Application of Farkas' Lemma to Finite-Valued Constraint Satisfaction Problems over Infinite Domains

We show a universal algebraic local characterisation of the expressive power of finite-valued languages with domains of arbitrary cardinality and containing arbitrary many cost functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/05/2018

Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains

Valued constraint satisfaction problems (VCSPs) are a large class of com...
research
07/03/2020

The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains

Convex relaxations have been instrumental in solvability of constraint s...
research
02/17/2020

Four-valued monitorability of ω-regular languages

Runtime Verification (RV) is a lightweight formal technique in which pro...
research
12/18/2019

Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation

Valued constraint satisfaction problems (VCSPs) are a large class of com...
research
01/10/2022

A full dichotomy for Holant^c, inspired by quantum computation

Holant problems are a family of counting problems parameterised by sets ...
research
06/01/2015

Impossibility Theorems and the Universal Algebraic Toolkit

We elucidate a close connection between the Theory of Judgment Aggregati...
research
03/01/2019

On the number of autotopies of an n-ary qusigroup of order 4

An algebraic system from a finite set Σ of cardinality k and an n-ary op...

Please sign up or login with your details

Forgot password? Click here to reset