Tractability beyond β-acyclicity for conjunctive queries with negation
Numerous fundamental database and reasoning problems are known to be NP-hard in general but tractable on instances where the underlying hypergraph structure is β-acyclic. Despite the importance of many of these problems, there has been little success in generalizing these results beyond acyclicity....
第一著者: | Lanzinger, M |
---|---|
フォーマット: | Conference item |
言語: | English |
出版事項: |
Association for Computing Machinery
2021
|
類似資料
-
Tractability beyond β-acyclicity for conjunctive queries with negation and SAT
著者:: Lanzinger, MP
出版事項: (2022) -
The complexity of acyclic conjunctive queries
著者:: Gottlob, G, 等
出版事項: (2001) -
The Complexity of Acyclic Conjunctive Queries
著者:: Gottlob, G, 等
出版事項: (1998) -
Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons
著者:: Sherkhonov, E, 等
出版事項: (2016) -
Conjunctive Queries for a Tractable Fragment of OWL 1.1.
著者:: Krötzsch, M, 等
出版事項: (2007)