Parameterized Complexity of Elimination Distance to First-Order Logic Properties

DOI10.1145/3517129zbMath1505.03075arXiv2104.02998MaRDI QIDQ5072610

Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos

Publication date: 29 April 2022

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.02998

zbMATH Keywords

first-order logic; parameterized complexity; descriptive complexity; elimination distance

Mathematics Subject Classification ID

03B70: Logic in computer science

03B10: Classical first-order logic

68Q19: Descriptive complexity and finite models

68Q27: Parameterized complexity, tractability and kernelization