Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
Ian Pratt-Hartmann
TL;DR
This paper analyzes the data-complexity of satisfiability and query-answering problems in two-variable logic fragments with counting, establishing their computational complexity classes.
Contribution
It provides a detailed complexity classification for satisfiability and query-answering in two-variable fragments with counting quantifiers.
Findings
Satisfiability and finite satisfiability are NP-complete.
Query-answering and finite query-answering are co-NP-complete.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Semantic Web and Ontologies · Advanced Database Systems and Queries