Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2403.10334 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914715555332096 |
|---|---|
| author | Bibel, Wolfgang |
| author_facet | Bibel, Wolfgang |
| contents | This note generalizes factorization for formulas with multiplicities and conjectures that the connection method along with this feature is computationally as powerful as resolution, also seen from a complexity point of view. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_10334 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Conjecture for ATP Research Bibel, Wolfgang Logic in Computer Science This note generalizes factorization for formulas with multiplicities and conjectures that the connection method along with this feature is computationally as powerful as resolution, also seen from a complexity point of view. |
| title | A Conjecture for ATP Research |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2403.10334 |