Flexible constraint satisfiability and a problem in semigroup theory

In this paper, we examine some flexible notions of constraint satisfaction, observing some relationships between model theoretic notions of universal Horn class membership and robust satisfiability. We show the NP-completeness of 2-robust positive 1-in-3SAT in order to give very small examples of finite algebras with NP-hard variety membership problem. In particular, we give a 3-element algebra with this property, and solve a widely stated problem by showing that the 6-element Brandt monoid has NP-hard variety membership problem. These are the smallest possible sizes for a general algebra and a semigroup to exhibit NP-hardness for the membership problem of finite algebras in finitely generated varieties.

Authors

Institutions

Publication Details

Journal
International Journal of Algebra and Computation
Published
2025-05-30
DOI
https://doi.org/10.1142/s0218196725500225
Citations
1
Primary Topic
Constraint Satisfaction and Optimization
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Flexible constraint satisfiability and a problem in semigroup theory

Marcel Jackson
1 citations
International Journal of Algebra and Computation
Constraint Satisfaction and Optimization
1.49
article

Flexible constraint satisfiability and a problem in semigroup theory

Marcel Jackson
article en
1 citations

Abstract

In this paper, we examine some flexible notions of constraint satisfaction, observing some relationships between model theoretic notions of universal Horn class membership and robust satisfiability. We show the NP-completeness of 2-robust positive 1-in-3SAT in order to give very small examples of finite algebras with NP-hard variety membership problem. In particular, we give a 3-element algebra with this property, and solve a widely stated problem by showing that the 6-element Brandt monoid has NP-hard variety membership problem. These are the smallest possible sizes for a general algebra and a semigroup to exhibit NP-hardness for the membership problem of finite algebras in finitely generated varieties.

International Journal of Algebra and ComputationVol. 35(06)
La Trobe University (AU)
Reduced inequalities
Openalex Percentile: Top 17%
Constraint Satisfaction and Optimization
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.