On the finite satisfiability problem for the guarded fragment with transitivity
LPAR, pp. 307-321, 2005.
finite satisfiability problemguarded fragmenttransitive predicate letterfinite modeltransitive predicateMore(3+)
We study the finite satisfiability problem for the guarded fragment with transitivity. We prove that in case of one transitive predicate the problem is decidable and its complexity is the same as the general satisfiability problem, i.e. 2Exptime-complete. We also show that finite models for sentences of GF with more transitive predicate l...More
Full Text (Upload PDF)
PPT (Upload PPT)