Bibliographic Details
| Title: |
Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler--Lehman Refinement Steps. |
| Authors: |
BERKHOLZ, CHRISTOPH1 christoph.berkholz@tuilmenau.de, NORDSTRÖM, JAKOB2 jn@di.ku.dk |
| Superior Title: |
Journal of the ACM. Oct2023, Vol. 70 Issue 5, p1-31. 32p. |
| Subject Terms: |
FIRST-order logic, CONDENSATION, HARDNESS |
| Abstract: |
We prove near-optimal tradeoffs for quantifier depth (also called quantifier rank) versus number of variables in first-order logic by exhibiting pairs of n-element structures that can be distinguished by a k-variable firstorder sentence but where every such sentence requires quantifier depth at least nΩ(k/logk). Our tradeoffs also apply to first-order counting logic and, by the known connection to the k-dimensional Weisfeiler--Leman algorithm, imply near-optimal lower bounds on the number of refinement iterations. A key component in our proof is the hardness condensation technique introduced by Razborov in the context of proof complexity. We apply this method to reduce the domain size of relational structures while maintaining the minimal quantifier depth needed to distinguish them in finite variable logics. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Business Source Premier |