Data-Complexity of the Two-Variable Fragment with Counting Quantifiers

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

2008-06-10

arxiv.org/abs/0806.1636v1

Computer Science

Logic in Computer Science

Scientific paper

The data-complexity of both satisfiability and finite satisfiability for the
two-variable fragment with counting is NP-complete; the data-complexity of both
query-answering and finite query-answering for the two-variable guarded
fragment with counting is co-NP-complete.

Affiliated with

Also associated with

No associations

Rating

Data-Complexity of the 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 Data-Complexity of the Two-Variable Fragment with Counting Quantifiers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data-Complexity of the Two-Variable Fragment with Counting Quantifiers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-174884