Parameterized complexity of completeness reasoning for conjunctive queries

Download PDF
Open Webpage

Xianmin Liu, Jianzhong Li, Yingshu Li, Yuqiang Feng

Published: 01 Jan 2021, Last Modified: 06 Nov 2025Theor. Comput. Sci. 2021EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•Several important parameterization methods for completeness reasoning problem are identified.•The completeness reasoning problems parameterized by the sizes of the completeness statements are shown to be para-NP-complete.•For special cases defined by limiting query structures, the parameterized completeness reasoning problems are shown to be intractable.•With data completeness statements of constant size, tractable cases of the parameterized completeness reasoning problem are found.