The tractability frontier of graph-like first-order query sets

DOI10.1145/2603088.2603119zbMath1394.68171arXiv1407.3429OpenAlexW2039914844MaRDI QIDQ4635615

Hubie Chen

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

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

zbMATH Keywords

treewidthquery evaluationparameterized complexityfirst-order queries

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Specification and verification (program logics, model checking, etc.) (68Q60) Model theory of finite structures (03C13)

Related Items (4)

Quantified Constraints in Twenty Seventeen ⋮ Unnamed Item ⋮ Characterizing tractability of simple well-designed pattern trees with projection ⋮ How many variables are needed to express an existential positive query?

This page was built for publication: The tractability frontier of graph-like first-order query sets