6533b85cfe1ef96bd12bd414
RESEARCH PRODUCT
Adding Transitivity and Counting to the Fluted Fragment
Ian Pratt-hartmannLidia Tenderasubject
fluted logicsatisfiabilitydecidabilitycountingTheory of computation → Complexity theory and logictransitivitycomplexitydescription
We study the impact of adding both counting quantifiers and a single transitive relation to the fluted fragment - a fragment of first-order logic originating in the work of W.V.O. Quine. The resulting formalism can be viewed as a multi-variable, non-guarded extension of certain systems of description logic featuring number restrictions and transitive roles, but lacking role-inverses. We establish the finite model property for our logic, and show that the satisfiability problem for its k-variable sub-fragment is in (k+1)-NExpTime. We also derive ExpSpace-hardness of the satisfiability problem for the two-variable, fluted fragment with one transitive relation (but without counting quantifiers), and prove that, when a second transitive relation is allowed, both the satisfiability and the finite satisfiability problems for the two-variable fluted fragment with counting quantifiers become undecidable.
year | journal | country | edition | language |
---|---|---|---|---|
2023-02-11 |