Every finite relation algebra with at most four atoms has a network satisfaction problem that is either in P or NP-hard, with the paper determining which.
Datalog and constraint satisfaction with infinite templates
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.RA 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Network Satisfaction Problem for Relation Algebras with at most 4 Atoms
Every finite relation algebra with at most four atoms has a network satisfaction problem that is either in P or NP-hard, with the paper determining which.