English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

There are two well known types of algorithms for solving CSPs: localpropagation and generating a basis of the solution space. For several years thefocus of the CSP research has been on `hybrid' algorithms that somehow combinethe two approaches. In this paper we present a new method of such hybridizationthat allows us to solve certain CSPs that has been out of reach for a quite awhile. We consider these method on a fairly restricted class of CSPs given byalgebras we will call semilattice block Mal'tsev. An algebra A is calledsemilattice block Mal'tsev if it has a binary operation f, a ternary operationm, and a congruence s such that the quotient A/s with operation $f$ is asemilattice, $f$ is a projection on every block of s, and every block of s is aMal'tsev algebra with Mal'tsev operation m. We show that the constraintsatisfaction problem over a semilattice block Mal'tsev algebra is solvable inpolynomial time.

Constraint Satisfaction Problems over semilattice block Mal'tsev algebras