Gaifman Normal Forms for Counting Extensions of First-Order Logic

    ICALP, pp. 133:1-133:14, 2018.

    Cited by: 4|Bibtex|Views0|Links
    EI

    Abstract:

    We consider the extension of first-order logic FO by unary counting quantifiers and generalise the notion of Gaifman normal form from FO to this setting. For formulas that use only ultimately periodic counting quantifiers, we provide an algorithm that computes equivalent formulas in Gaifman normal form. We also show that this is not possi...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments