Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width

MFCS, 2019.

Cited by: 2|Views10
EI

Abstract:

Marx (STOC~2010, J.~ACM 2013) introduced the notion of submodular width of a conjunctive query (CQ) and showed that for any class $\Phi$ of Boolean CQs of bounded submodular width, the model-checking problem for $\Phi$ on the class of all finite structures is fixed-parameter tractable (FPT). Note that for non-Boolean queries, the size o...More

Code:

Data:

Your rating :
0

 

Tags
Comments