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....

Mô tả đầy đủ

Chi tiết về thư mục
Tác giả chính: Lanzinger, M
Định dạng: Conference item
Ngôn ngữ:English
Được phát hành: Association for Computing Machinery 2021