The Network Satisfaction Problem for Relation Algebras with at most 4 Atoms

2025-07-12

AI Summary

This work investigates the computational complexity of the network satisfaction problem (NSP) for relation algebras (RAs) with at most four atoms—a longstanding open question, as prior work had only classified the complexity for three-atom RAs. Method: We extend the Hirsch–Hodkinson–Cristiani dichotomy theorem from three- to four-atom RAs by introducing and unifying three novel representation constructions—generic representations, fully generic representations, and normal representations—thereby handling both representable and non-representable algebras uniformly. Our approach integrates techniques from relation algebra theory, model theory, and computational complexity analysis. Contribution/Results: We establish a complete P/NP-hard dichotomy for NSP over all relation algebras with ≤4 atoms: every such algebra yields an NSP that is either in P or NP-hard. This resolves the complexity landscape for small finite-atom RAs, providing a foundational classification that informs both theoretical study and practical applications of finite relation algebras.

Technology Category

• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Constraint Satisfaction and Optimization: Satisfiability
• Reasoning under Uncertainty: Uncertainty Representations

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for heterogeneous, signed, attributed, multi-relational, temporal, higher-order, and annotated Web-related graphs
• Semantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics
• Responsible Web: Algorithmic accountability and transparency on the web

Abstract

Andréka and Maddux classified the relation algebras with at most 3 atoms, and in particular they showed that all of them are representable. Hirsch and Cristiani showed that the network satisfaction problem (NSP) for each of these algebras is in P or NP-hard. There are relation algebras with 4 atoms that are not representable, and there are many results in the literature about representations and non-representability of relation algebras with at most 4 atoms. We extend the result of Hirsch and Cristiani to relation algebras with at most 4 atoms: the NSP is always either in P or NP-hard. To this end, we construct universal, fully universal, or even normal representations for these algebras, whenever possible.

Problem

• Extend NSP classification to 4-atom relation algebras
• Determine P or NP-hard for all 4-atom cases
• Construct representations for 4-atom algebras when possible

Innovation

• Extend NSP results to 4-atom relation algebras
• Construct universal representations when possible
• Classify NSP complexity as P or NP-hard