AI Chat AI Image Generator AI Video Text to Speech

A modifiction of the CSP algorithm for infinite languages

03/17/2018

∙

by Dmitriy Zhuk, et al.

∙

∙

Constraint Satisfaction Problem on finite sets is known to be NP-complete in general but certain restrictions on the constraint language can ensure tractability. It was proved that if a constraint language has a weak near unanimity polymorphism then the corresponding constraint satisfaction problem is tractable, otherwise it is NP-complete. In the paper we present a modification of the algorithm that works in polynomial time even for infinite constraint languages.

page 1

page 2

page 3

page 4

research

∙ 07/03/2018

The complexity of disjunctive linear Diophantine constraints

We study the Constraint Satisfaction Problem CSP(A), where A is first-or...

0 Manuel Bodirsky, et al. ∙

research

∙ 06/30/2017

Parameterized Complexity of CSP for Infinite Constraint Languages

We study parameterized Constraint Satisfaction Problem for infinite cons...

0 Ruhollah Majdoddin, et al. ∙

research

∙ 01/30/2023

An order out of nowhere: a new algorithm for infinite-domain CSPs

We consider constraint satisfaction problems whose relations are defined...

0 Antoine Mottet, et al. ∙

research

∙ 01/18/2012

A Dichotomy for 2-Constraint Forbidden CSP Patterns

Although the CSP (constraint satisfaction problem) is NP-complete, even ...

0 Martin C. Cooper, et al. ∙

research

∙ 06/29/2016

Algebraic foundations for qualitative calculi and networks

A qualitative representation ϕ is like an ordinary representation of a r...

0 Robin Hirsch, et al. ∙

research

∙ 05/01/2020

Strong subalgebras and the Constraint Satisfaction Problem

In 2007 it was conjectured that the Constraint Satisfaction Problem (CSP...

0 Dmitriy Zhuk, et al. ∙

research

∙ 06/15/2023

Functional Dependencies with Predicates: What Makes the g_3-error Easy to Compute?

The notion of functional dependencies (FDs) can be used by data scientis...

0 Simon Vilmin, et al. ∙