How Hard Is Completeness Reasoning for Conjunctive Queries?

Xianmin Liu, Jianzhong Li 0001, Yingshu Li. How Hard Is Completeness Reasoning for Conjunctive Queries?. In Donghyun Kim 0001, R. N. Uma, Zhipeng Cai 0001, Dong Hoon Lee 0001, editors, Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings. Volume 12273 of Lecture Notes in Computer Science, pages 149-161, Springer, 2020. [doi]

Abstract

Abstract is missing.