Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1605.03480 / rank | |||
Normal rank | |||
Revision as of 20:35, 19 April 2024
scientific article; zbMATH DE number 6863498
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic |
scientific article; zbMATH DE number 6863498 |
Statements
Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (English)
0 references
23 April 2018
0 references
Weisfeiler-Leman algorithm
0 references
counting quantifiers
0 references
first-order logic
0 references
quantifier depth
0 references
