Satisfiability for Knowing How over Linear Plans is NP-complete
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911698477121536 |
|---|---|
| author | Areces, Carlos Barceló, Pablo Cassano, Valentin Castro, Pablo F. Demri, Stéphane Fervari, Raul |
| author_facet | Areces, Carlos Barceló, Pablo Cassano, Valentin Castro, Pablo F. Demri, Stéphane Fervari, Raul |
| contents | We study the satisfiability problem for a modal logic expressing knowing-how assertions, which captures an agent's ability to achieve a given goal under the standard semantics based on linear plans. Our main result shows that satisfiability of knowing-how formulas is NP-complete, improving previously known complexity bounds. The proof proceeds via a translation into modal logic S5, an instrumental tool for addressing a variety of problems in knowledge representation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_19819 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Satisfiability for Knowing How over Linear Plans is NP-complete Areces, Carlos Barceló, Pablo Cassano, Valentin Castro, Pablo F. Demri, Stéphane Fervari, Raul Logic in Computer Science F.4.1 We study the satisfiability problem for a modal logic expressing knowing-how assertions, which captures an agent's ability to achieve a given goal under the standard semantics based on linear plans. Our main result shows that satisfiability of knowing-how formulas is NP-complete, improving previously known complexity bounds. The proof proceeds via a translation into modal logic S5, an instrumental tool for addressing a variety of problems in knowledge representation. |
| title | Satisfiability for Knowing How over Linear Plans is NP-complete |
| topic | Logic in Computer Science F.4.1 |
| url | https://arxiv.org/abs/2605.19819 |