When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915686344818688 |
|---|---|
| author | Krebs, Andreas Meier, Arne |
| author_facet | Krebs, Andreas Meier, Arne |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_17378 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames Krebs, Andreas Meier, Arne Logic in Computer Science Computational Complexity 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. |
| title | When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames |
| topic | Logic in Computer Science Computational Complexity |
| url | https://arxiv.org/abs/2512.17378 |