Score: 0
When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames
Published: December 19, 2025 |
arXiv ID: 2512.17378v1
By: Andreas Krebs, Arne Meier
Hemaspaandra~et~al.~[JCSS 2010] conjectured that satisfiability for multi-modal logic restricted to the connectives XOR and 1, over frame classes T, S4, and S5, is solvable in polynomial time. We refute this for S5 frames, by proving NP-hardness.
Similar Papers
86%
Structural Origin and the Minimal Syntax of NP-Hardness: Analysis of SAT from Syntactic Generativity and Compositional Collapse
Logic in Computer Science
Unlocks secrets of hard computer problems.
26 Sep 2025
0
85%
On the complexity of solving equations over the symmetric group $S_4$
Computational Complexity
Makes hard math problems easier for computers.
10 Mar 2025
0
85%
The Computational Complexity of Satisfiability in State Space Models
Logic in Computer Science
Makes computer models predictable and understandable.
25 Aug 2025
0