When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames

2025-12-19

AI Summary

This paper investigates the satisfiability problem for affine modal logic formulas—comprising only XOR and the constant 1—over the S5 multimodal framework (Affine ML-SAT). Addressing a conjecture by Hemaspaandra et al. that this problem is polynomial-time solvable, we establish its NP-hardness via a constructive reduction: each 3SAT instance is encoded as an affine modal formula over S5 with a fully connected, symmetric accessibility relation. Our proof integrates modal semantic reduction with algebraic analysis of Boolean functions to rigorously derive a computational hardness lower bound. Crucially, we show that S5’s equivalence relation—specifically its symmetry—does not simplify the problem; rather, it induces a complexity leap. This result refutes the polynomial-time solvability conjecture and provides a pivotal counterexample that sharpens the complexity classification of multimodal logics, delineating a fundamental theoretical boundary.

Technology Category

• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Reasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty

Application Category

• Graph Algorithms and Modeling for the Web: Representation, reconstruction, and subgraph or motif discovery in Web-related graphs
• Search and Retrieval-Augmented AI: Retrieval-Augmented Generation (RAG) and multi-modal RAG
• Security and Privacy: Large-scale security measurements

Abstract

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.

Problem

• Refutes polynomial-time satisfiability conjecture for S5 frames
• Proves NP-hardness for multi-modal logic with XOR and 1
• Addresses satisfiability in restricted modal logic connectives

Innovation

• Proved NP-hardness for S5 frames
• Refuted polynomial-time conjecture
• Used XOR and 1 connectives