Spanning Matrices via Satisfiability Solving
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917591290740736 |
|---|---|
| author | Eisenhofer, Clemens Rawson, Michael Kovács, Laura |
| author_facet | Eisenhofer, Clemens Rawson, Michael Kovács, Laura |
| contents | We propose a new encoding of the first-order connection method as a Boolean satisfiability problem. The encoding eschews tree-like presentations of the connection method in favour of matrices, as we show that tree-like calculi have a number of drawbacks in the context of satisfiability solving. The matrix setting permits numerous global refinements of the basic connection calculus. We also show that a suitably-refined calculus is a decision procedure for the Bernays-Schönfinkel class. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_10610 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Spanning Matrices via Satisfiability Solving Eisenhofer, Clemens Rawson, Michael Kovács, Laura Logic in Computer Science We propose a new encoding of the first-order connection method as a Boolean satisfiability problem. The encoding eschews tree-like presentations of the connection method in favour of matrices, as we show that tree-like calculi have a number of drawbacks in the context of satisfiability solving. The matrix setting permits numerous global refinements of the basic connection calculus. We also show that a suitably-refined calculus is a decision procedure for the Bernays-Schönfinkel class. |
| title | Spanning Matrices via Satisfiability Solving |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2402.10610 |