Commutative idempotent groupoids and the constraint satisfaction problem.

DOI10.1007/s00012-015-0323-6zbMath1322.08003arXiv1501.04331OpenAlexW2143836640WikidataQ60143367 ScholiaQ60143367MaRDI QIDQ2351518

David Failing, Clifford Bergman

Publication date: 23 June 2015

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.04331

zbMATH Keywords

constraint satisfaction problemfinite algebrasvarieties of groupoidscommutative idempotent groupoidsPlonka sumsBol-Moufang type identitiesCSP dichotomyself-distributive groupoids

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Products, amalgamated products, and other kinds of limits and colimits (08B25) Sets with a single binary operation (groupoids) (20N02)

Related Items (5)

Semilattice sums of algebras and Mal'tsev products of varieties ⋮ Cube term blockers without finiteness ⋮ Logics of left variable inclusion and Płonka sums of matrices ⋮ Unnamed Item ⋮ The Płonka product of topological spaces

Uses Software

• Prover9
• Mace4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On regular and regularized varieties
• The lattice of varieties of commutative abelian distributive groupoids
• Consistency in networks of relations
• On the algebraic structure of combinatorial problems
• Quasigroups, loops, and associative laws
• Characterizations of several Maltsev conditions.
• Combinatorial problems raised from 2-semilattices
• The varieties of quasigroups of Bol-Moufang type: an equational reasoning approach.
• The varieties of loops of Bol-Moufang type.
• Commutative Moufang loops and distributive groupoids of small orders
• Varieties Of Steiner Loops and Steiner Quasigroups
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Closure properties of constraints
• Constraint Satisfaction Problems of Bounded Width
• Generalized Majority-Minority Operations are Tractable
• Classifying the Complexity of Constraints Using Finite Algebras
• Tractability and Learnability Arising from Algebras with Few Subpowers
• A Simple Algorithm for Mal'tsev Constraints
• Recent Results on the Algebraic Approach to the CSP
• On a method of construction of abstract algebras
• On equational classes of abstract algebras defined by regular equations

This page was built for publication: Commutative idempotent groupoids and the constraint satisfaction problem.