Learning algorithms versus automatability of Frege systems
We connect learning algorithms and algorithms automating proof search in propositional proof systems: for every sufficiently strong, well-behaved propositional proof system P, we prove that the following statements are equivalent,<br> - Provable learning. P proves efficiently that p-size circu...
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Conference item |
| Språk: | English |
| Publicerad: |
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2022
|