Universal Algebraic Methods for Constraint Satisfaction Problems release_te4nu5ssrndj3fzvsak3kuoncq

by Clifford Bergman, William DeMeo

Released as a article .

2021  

Abstract

After substantial progress over the last 15 years, the "algebraic CSP-dichotomy conjecture" reduces to the following: every local constraint satisfaction problem (CSP) associated with a finite idempotent algebra is tractable if and only if the algebra has a Taylor term operation. Despite the tremendous achievements in this area (including recently announce proofs of the general conjecture), there remain examples of small algebras with just a single binary operation whose CSP resists direct classification as either tractable or NP-complete using known methods. In this paper we present some new methods for approaching such problems, with particular focus on those techniques that help us attack the class of finite algebras known as "commutative idempotent binars" (CIBs). We demonstrate the utility of these methods by using them to prove that every CIB of cardinality at most 4 yields a tractable CSP.
In text/plain format

Archived Files and Locations

application/pdf  483.2 kB
file_ltxihjpyfvaq5hd6pfyqc5grju
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2021-12-12
Version   v8
Language   en ?
arXiv  1611.02867v8
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: a5c4ebea-73f6-433c-a0e3-5e46dc65fec0
API URL: JSON