Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers

Details Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers

2006-01-26

arxiv.org/abs/cs/0601112v1

Computer Science

Logic in Computer Science

20 pages, 3 figures

Scientific paper

We show that the finite satisfiability problem for the guarded two-variable
fragment with counting quantifiers is in EXPTIME. The method employed also
yields a simple proof of a result recently obtained by Y. Kazakov, that the
satisfiability problem for the guarded two-variable fragment with counting
quantifiers is in EXPTIME.

Affiliated with

Also associated with

No associations

Rating

Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-171087