Data-complexity of the two-variable fragment with counting quantifiers

Authors:
Ian Pratt-Hartmann
Affiliations:
School of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL, UK
Venue:
Information and Computation
Year:
2009

Citing 10
Cited 6

On the complexity of the instance checking problem in concept languages with existential quantification

Journal of Intelligent Information Systems - Special issue on methodologies for intelligent systems
On logics with two variables

Theoretical Computer Science
Complexity Results for First-Order Two-Variable Logic with Counting

SIAM Journal on Computing
Complexity of the Two-Variable Fragment with Counting Quantifiers

Journal of Logic, Language and Information
On the decidability and finite controllability of query processing in databases with incomplete information

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reasoning in Description Logics by a Reduction to Disjunctive Datalog

Journal of Automated Reasoning
Data Complexity of Query Answering in Expressive Description Logics via Tableaux

Journal of Automated Reasoning
DL-lite in the light of first-order logic

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Conjunctive query answering for the description logic SHIQ

Journal of Artificial Intelligence Research
Counting in the two variable guarded logic with transitivity

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Query Answering in Description Logics: The Knots Approach

WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Controlled Aggregate Tree Shaped Questions over Ontologies

FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
The data complexity of the syllogistic fragments of English

Proceedings of the 17th Amsterdam colloquium conference on Logic, language and meaning
Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!

Journal of Artificial Intelligence Research
Querying the fragments of english

WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Querying the guarded fragment with transitivity

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

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