Data-complexity of the two-variable fragment with counting quantifiers
From MaRDI portal
Publication:2389348
DOI10.1016/J.IC.2009.02.004zbMATH Open1183.68254OpenAlexW2163231487MaRDI QIDQ2389348FDOQ2389348
Authors: Ian Pratt-Hartmann 
Publication date: 15 July 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2009.02.004
Recommendations
Cites Work
- Integer Programming with a Fixed Number of Variables
- Title not available (Why is that?)
- Reasoning in description logics by a reduction to disjunctive datalog
- On logics with two variables
- Complexity of the two-variable fragment with counting quantifiers
- Conjunctive query answering for the description logic SHIQ
- Data complexity of query answering in expressive description logics via tableaux
- Complexity Results for First-Order Two-Variable Logic with Counting
- Complexity of the Guarded Two-variable Fragment with Counting Quantifiers
- Logics in Artificial Intelligence
- STACS 2005
Cited In (7)
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
- Two variable logic with ultimately periodic counting
- On the complexity of the Bernays-Schönfinkel class with Datalog
- Reasoning and query answering in description logics
- Weighted first-order model counting in the two-variable fragment with counting quantifiers
- Query Answering in Description Logics: The Knots Approach
- Logical separability of labeled data examples under ontologies
This page was built for publication: Data-complexity of the two-variable fragment with counting quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389348)
