Network Satisfaction Problem (NSP)

• NSP is a decision problem on finite relation algebras that determines if a network is representable by verifying consistency via allowed atomic triples.
• It bridges qualitative reasoning calculi like interval and spatial reasoning with traditional constraint satisfaction problems through local consistency and universal representations.
• The algebra 56₆₅ exemplifies how signed-graph semantics and specific polymorphism conditions yield a finitely bounded universal square representation, placing NSP in NP.

Searching arXiv for papers on network satisfaction problems for relation algebras and the specific algebra $56_{65}$. The Network Satisfaction Problem (NSP) is a decision problem attached to a fixed finite relation algebra $A$. In the relation-algebraic formulation, the input is an $A$-network $(V,f)$, and the question is whether the network is satisfiable, that is, whether there exist a representation $B$ of $A$ and an assignment $s:V\to B$ such that every constraint $f(x,y)$ is realized by the pair $(s(x),s(y))$. In this sense, NSP is the satisfiability problem for qualitative binary constraint networks whose composition table is encoded by a finite relation algebra. The problem arises in the study of qualitative reasoning calculi, including interval and spatial calculi, and it is closely connected to constraint satisfaction over infinite templates (Bodirsky et al., 7 Dec 2025).

1. Relation algebras and atomic constraints

A relation algebra is a Boolean algebra equipped with additional operations intended to abstract binary relations under complement, converse, and relational composition. In the formulation used for NSP, a relation algebra is an algebra

$$A=(A;\sqcup,\bar{\phantom{o}},\bot,\top,id,\breve{\phantom{o}},\circ)$$

such that the Boolean reduct is a Boolean algebra, $A$0 is associative and distributes over $A$1, $A$2 is a two-sided identity for composition, $A$3 is an involution that distributes over $A$4, converse reverses composition, and Tarski’s residuation axiom holds. For finite relation algebras, the central combinatorial data are the atoms, namely the minimal nonzero elements in the Boolean order, together with the atomic composition table (Bodirsky et al., 7 Dec 2025).

For atoms $A$5, the triple $A$6 is called an allowed triple if

$A$7

and otherwise it is a forbidden triple. Thus the allowed triples encode exactly which local configurations are compatible with composition. In symmetric relation algebras, every element is self-converse, so allowed triples are invariant under permutation of coordinates. This atomic viewpoint is fundamental throughout the NSP literature because finite networks are checked locally against the allowed-triple relation, while global satisfiability depends on the existence of an appropriate representation (Bodirsky et al., 7 Dec 2025).

A representation of a relation algebra $A$8 is a relational structure $A$9 that interprets each algebra element $A$0 as a binary relation $A$1 in such a way that Boolean operations, converse, identity, and relational composition are interpreted exactly as in the set-theoretic algebra of binary relations. A relation algebra is representable if it has at least one such representation. This distinction is already complexity-relevant: for non-representable finite relation algebras, no network is satisfiable in any representation, so $A$2 is trivial (Bodirsky et al., 7 Dec 2025).

2. Networks, consistency, and satisfiability

An $A$3-network is the relation-algebraic analogue of a binary constraint network. One formulation uses a finite set of variables $A$4 and a labeling function $A$5; another allows $A$6 to be a partial function on a subset $A$7. In both formulations, $A$8 is the binary constraint assigned to the ordered pair $A$9. A network is atomic if every label is an atom of $(V,f)$0 (Bodirsky et al., 7 Dec 2025, Bodirsky et al., 2020).

Given a representation $(V,f)$1 of $(V,f)$2, an $(V,f)$3-network $(V,f)$4 is satisfiable in $(V,f)$5 if there exists a map $(V,f)$6 such that

$(V,f)$7

for all relevant pairs $(V,f)$8. The network is satisfiable in the general NSP sense if it is satisfiable in some representation of $(V,f)$9. This distinction is crucial: NSP quantifies not only over assignments into a fixed structure, but also over the choice of representation itself (Bodirsky et al., 7 Dec 2025, Bodirsky et al., 2020).

A network is consistent when its labels satisfy the local algebraic conditions imposed by identity and composition. In one standard form, for all $B$0,

$B$1

For atomic closed networks, this is the path-consistency condition induced by the atomic composition table. Consistency is necessary for satisfiability, but in general it is not sufficient. A major theme in the literature is to identify classes of relation algebras for which local consistency already guarantees global realizability, or for which every satisfiable network is realized inside one canonical representation (Bodirsky et al., 7 Dec 2025, Bodirsky et al., 12 Jul 2025).

A representation $B$2 is called universal if every satisfiable $B$3-network is satisfiable in $B$4. It is fully universal if every consistent atomic $B$5-network is satisfiable in $B$6. It is square if $B$7. A normal representation is fully universal, square, and homogeneous. These notions organize much of the modern theory because they determine when NSP can be recast as an ordinary CSP over a fixed template (Bodirsky et al., 2020, Bodirsky et al., 12 Jul 2025).

3. CSP formulations, atom structures, and polymorphisms

When a suitable universal representation is available, NSP becomes a standard constraint satisfaction problem. If $B$8 is a universal representation of $B$9, then $A$0 is the same problem as $A$1: the input atomic network is viewed as a finite relational structure, and satisfiability becomes the existence of a homomorphism into $A$2. If $A$3 has a normal representation $A$4, then $A$5 and $A$6 coincide up to the standard translation between networks and primitive positive sentences (Bodirsky et al., 7 Dec 2025, Bodirsky et al., 2020).

For complexity analysis, a second finite template is often associated with $A$7: its atom structure. The domain is the set $A$8 of atoms, equipped with unary relations recording which atoms lie below a given algebra element, a binary relation for converse, and a ternary relation for allowed triples. In the flexible-atom setting, the atom structure is conservative, and polymorphisms of the normal representation induce conservative polymorphisms on the finite atom structure. This enables the import of finite-domain CSP methods into the analysis of infinite-domain NSP templates (Bodirsky et al., 2020).

In that framework, the existence of certain polymorphisms becomes the central tractability criterion. For finite symmetric representable relation algebras with a flexible atom, the decisive condition is the existence of a conservative 6-ary operation on atoms that preserves allowed triples and satisfies the Siggers identity

$A$9

If such an operation exists, $s:V\to B$0 is in $s:V\to B$1; otherwise it is NP-complete. This is a complete classification for symmetric relation algebras with a flexible atom, and it solves Hirsch’s “Really Big Complexity Problem” for that subclass (Bodirsky et al., 2020).

The model-theoretic side is equally important. Normal representations are homogeneous, and for homogeneous templates primitive positive definability is controlled by polymorphism preservation. Canonical polymorphisms, obtained via Ramsey-theoretic canonisation, transfer algebraic information between the infinite representation and the finite atom structure. This suggests that NSP is best understood as a meeting point of relation algebra, Fraïssé theory, and the universal-algebraic approach to CSPs (Bodirsky et al., 2020).

4. Complexity landscape

The broad classification problem asks for the computational complexity of $s:V\to B$2 for finite relation algebras $s:V\to B$3. The landscape is heterogeneous. There exist finite relation algebras with NSP in $s:V\to B$4, others with NP-complete NSP, and even finite relation algebras with undecidable NSP. For algebras with normal representations, however, $s:V\to B$5 is always in NP, because the problem becomes a CSP over a fixed finitely bounded homogeneous structure (Bodirsky et al., 2019, Bodirsky et al., 2020).

Two general NP-hardness criteria are known for relation algebras with a normal representation $s:V\to B$6. First, if $s:V\to B$7 contains a non-trivial equivalence relation with finitely many equivalence classes, then $s:V\to B$8, and hence $s:V\to B$9, is NP-complete. Second, if $f(x,y)$0 is primitive, $f(x,y)$1, and $f(x,y)$2 contains a symmetric atom $f(x,y)$3 with a forbidden triple $f(x,y)$4, equivalently $f(x,y)$5, then $f(x,y)$6 is NP-hard. These criteria explain hardness for several small relation algebras via structural properties of their normal representations rather than by direct encoding of a classical NP-complete problem (Bodirsky et al., 2019).

For relation algebras with at most four atoms, a systematic case analysis has been completed. The 2025 classification shows that for every finite relation algebra $f(x,y)$7 with at most four atoms, $f(x,y)$8 is always either in $f(x,y)$9 or NP-hard. The proof uses a combination of representability results, constructions of universal, fully universal, or normal representations, reductions to finite conservative CSPs on atom structures, bounded-size representation arguments, and explicit hardness reductions, including PCSP reductions in some symmetric cases (Bodirsky et al., 12 Jul 2025).

The algebra $(s(x),s(y))$0 was the last unresolved four-atom case. The 2025 paper on circular chromatic numbers and signed graphs proves that $(s(x),s(y))$1 has a finitely bounded universal square representation and concludes that $(s(x),s(y))$2. This settles the final open case in the classification of the existence of universal square representations, as well as the complexity of the corresponding NSP, for relation algebras with at most four atoms (Bodirsky et al., 7 Dec 2025).

5. The algebra $(s(x),s(y))$3 and signed-graph semantics

The four-atom relation algebra $(s(x),s(y))$4 is symmetric and has atom set

$(s(x),s(y))$5

Here $(s(x),s(y))$6 is identity, $(s(x),s(y))$7 plays the role of a non-edge relation, and $(s(x),s(y))$8 correspond to edge labels in a signed-graph representation. The forbidden atomic triples are

$(s(x),s(y))$9

together with the triples enforcing the usual behavior of $$A=(A;\sqcup,\bar{\phantom{o}},\bot,\top,id,\breve{\phantom{o}},\circ)$$0. Because the algebra is symmetric, forbidden and allowed triples are permutation-invariant. This algebra is designed so that its square representations correspond exactly to certain signed graphs with a strong extension property (Bodirsky et al., 7 Dec 2025).

The key correspondence is as follows. Given a representation $$A=(A;\sqcup,\bar{\phantom{o}},\bot,\top,id,\breve{\phantom{o}},\circ)$$1 of $$A=(A;\sqcup,\bar{\phantom{o}},\bot,\top,id,\breve{\phantom{o}},\circ)$$2, one forms a signed graph $$A=(A;\sqcup,\bar{\phantom{o}},\bot,\top,id,\breve{\phantom{o}},\circ)$$3 on vertex set $$A=(A;\sqcup,\bar{\phantom{o}},\bot,\top,id,\breve{\phantom{o}},\circ)$$4, where $$A=(A;\sqcup,\bar{\phantom{o}},\bot,\top,id,\breve{\phantom{o}},\circ)$$5 is an edge exactly when $$A=(A;\sqcup,\bar{\phantom{o}},\bot,\top,id,\breve{\phantom{o}},\circ)$$6, and the edge receives label $$A=(A;\sqcup,\bar{\phantom{o}},\bot,\top,id,\breve{\phantom{o}},\circ)$$7 or $$A=(A;\sqcup,\bar{\phantom{o}},\bot,\top,id,\breve{\phantom{o}},\circ)$$8 according to whether it lies in $$A=(A;\sqcup,\bar{\phantom{o}},\bot,\top,id,\breve{\phantom{o}},\circ)$$9 or $A$00. Conversely, from a consistent signed graph satisfying the required extension conditions, one recovers a representation by declaring non-edges to realize $A$01 and labeled edges to realize $A$02 or $A$03. In this way, satisfiable atomic $A$04-networks are essentially finite signed graphs whose embeddability determines satisfiability (Bodirsky et al., 7 Dec 2025).

The signed-graph side is governed by anti-even-balancing. A signed graph is anti-even-signable if there exists a labeling $A$05 such that every triangle has label sum $A$06, while every induced cycle of length at least $A$07 has label sum $A$08. The crucial structural result is the existence of a universal anti-even-balancing labeling on the complement $A$09 of the generic circular triangle-free graph $A$10, where

$A$11

and $A$12 is an edge iff

$A$13

The resulting signed graph $A$14 is universal for finite anti-even-balanced signed triangle-free graphs and has the 3-extension property needed for the relation-algebraic construction (Bodirsky et al., 7 Dec 2025).

From $A$15, the authors construct a representation $A$16 of $A$17 that is square, finitely bounded, and universal. This yields the theorem: $A$18 The proof also ties NSP to circular chromatic number: graphs of circular chromatic number less than $A$19 are characterized via anti-even-signability, and this characterization is what makes the universal signed-graph construction possible (Bodirsky et al., 7 Dec 2025).

6. Local consistency, decidability, and open directions

A distinct line of work studies when NSP can be solved by local consistency methods. For arbitrary finite relation algebras, the meta-problem is highly negative: it is undecidable whether $A$20 is in $A$21, undecidable whether it is solved by $A$22-consistency for some $A$23, and undecidable whether it is solved by path-consistency. This is proved by reduction from the undecidable representability problem using direct products with a fixed relation algebra whose NSP is itself undecidable (Bodirsky et al., 2023).

For finite symmetric integral relation algebras with a flexible atom, the situation is much more rigid. In that class, NSP can be solved by $A$24-consistency for some $A$25 if and only if the algebra admits a Siggers behavior on atoms, and in that case the $A$26-consistency procedure suffices. Moreover, the corresponding meta-problem is decidable in polynomial time in the number of atoms. The proof uses a sufficient condition for bounded width in terms of symmetry, normal representations, all $A$27-cycles, and Siggers behavior, together with a result of Alexandr Kazda on finite binary conservative structures (Bodirsky et al., 2023).

Several open problems remain. For finite relation algebras with a normal representation, the decidability of whether NSP is solved by $A$28-consistency remains open in general. For the signed-graph template associated with $A$29, the complexity of $A$30 is posed explicitly as an open question. The 2025 paper notes that the representation $A$31 for $A$32 pp-constructs $A$33, which strongly suggests NP-hardness for appropriate CSPs, but it does not prove NP-hardness or NP-completeness for $A$34 itself. It also leaves open questions about homogenizability and Ramsey expansions of the universal signed graph (Bodirsky et al., 2023, Bodirsky et al., 7 Dec 2025).

In the current state of the subject, NSP occupies a precise position between algebraic logic and CSP theory. Its inputs are finite labeled networks, its semantics are given by representations of finite relation algebras, and its complexity is controlled by a mixture of allowed triples, amalgamation properties, model-theoretic universality, and polymorphism identities. The development from normal representations and flexible atoms to signed graphs and circular chromatic number shows that the notion is not merely a reformulation of CSP, but a framework in which representation theory and complexity theory constrain one another in a highly structured way.