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