Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.05670 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917663936086016 |
|---|---|
| author | Schubert, Aleksy Urzyczyn, Paweł Zdanowski, Konrad |
| author_facet | Schubert, Aleksy Urzyczyn, Paweł Zdanowski, Konrad |
| contents | The classical satisfiability problem (SAT) is used as a natural and general tool to express and solve combinatorial problems that are in NP. We postulate that provability for implicational intuitionistic propositional logic (IIPC) can serve as a similar natural tool to express problems in Pspace. This approach can be particularly convenient for two reasons. One is that provability in full IPC (with all connectives) can be reduced to provability of implicational formulas of order three. Another advantage is a convenient interpretation in terms of simple alternating automata. Additionally, we distinguish some natural subclasses of IIPC corresponding to the complexity classes NP and co-NP. Our experimental results show that a simple decision procedure requires a significant amount of time only in a small fraction of cases. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_05670 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Between proof construction and SAT-solving Schubert, Aleksy Urzyczyn, Paweł Zdanowski, Konrad Logic in Computer Science The classical satisfiability problem (SAT) is used as a natural and general tool to express and solve combinatorial problems that are in NP. We postulate that provability for implicational intuitionistic propositional logic (IIPC) can serve as a similar natural tool to express problems in Pspace. This approach can be particularly convenient for two reasons. One is that provability in full IPC (with all connectives) can be reduced to provability of implicational formulas of order three. Another advantage is a convenient interpretation in terms of simple alternating automata. Additionally, we distinguish some natural subclasses of IIPC corresponding to the complexity classes NP and co-NP. Our experimental results show that a simple decision procedure requires a significant amount of time only in a small fraction of cases. |
| title | Between proof construction and SAT-solving |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2405.05670 |