2000 character limit reached
Data-Complexity of the Two-Variable Fragment with Counting Quantifiers (0806.1636v1)
Published 10 Jun 2008 in cs.LO, cs.AI, and cs.CC
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.