Data-complexity of the two-variable fragment with counting quantifiers
Author:
- 1 August 2009
- journal article
- Published by Elsevier in Information and Computation
- Vol. 207 (8) , 867-888
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Data Complexity of Query Answering in Expressive Description Logics via TableauxJournal of Automated Reasoning, 2008
- Conjunctive Query Answering for the Description Logic SHIQJournal of Artificial Intelligence Research, 2008
- Reasoning in Description Logics by a Reduction to Disjunctive DatalogJournal of Automated Reasoning, 2007
- Complexity of the Guarded Two-variable Fragment with Counting QuantifiersJournal of Logic and Computation, 2006
- On the decidability and finite controllability of query processing in databases with incomplete information2006
- Complexity of the Two-Variable Fragment with Counting QuantifiersJournal of Logic, Language and Information, 2005
- A Polynomial Translation from the Two-Variable Guarded Fragment with Number Restrictions to the Guarded FragmentLecture Notes in Computer Science, 2004
- Complexity Results for First-Order Two-Variable Logic with CountingSIAM Journal on Computing, 2000
- On logics with two variablesTheoretical Computer Science, 1999
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983