Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons
We study the containment problem for conjunctive queries (CQs ) expanded with negated atoms or arithmetic comparisons. It is known that the problem is View the MathML source-complete [14] and [16]. The aim of this article is to find restrictions on CQs that allow for tractable containment. In parti...
Main Authors: | Sherkhonov, E, Marx, M |
---|---|
Format: | Journal article |
Published: |
Elsevier
2016
|
Similar Items
-
Tractability beyond β-acyclicity for conjunctive queries with negation
by: Lanzinger, M
Published: (2021) -
The complexity of acyclic conjunctive queries
by: Gottlob, G, et al.
Published: (2001) -
The Complexity of Acyclic Conjunctive Queries
by: Gottlob, G, et al.
Published: (1998) -
Tractability beyond β-acyclicity for conjunctive queries with negation and SAT
by: Lanzinger, MP
Published: (2022) -
Boolean tensor decomposition for conjunctive queries with negation
by: Abo Khamis, M, et al.
Published: (2019)