Compiling Existential Positive Queries to Bounded-Variable Fragments

    Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 353-364, 2019.

    Cited by: 1|Bibtex|Views4|Links
    EI
    Keywords:
    bounded-variable logic compilation existential positive queries parameterized complexity

    Abstract:

    A crucial property of bounded-variable fragments of first-order logic is that they can be evaluated in polynomial time. It is therefore a useful preprocessing step to rewrite, if possible, a first-order query to a logically equivalent one with a minimum number of variables. However, it may occur that reducing the number of variables cause...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments