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]
@inproceedings{LiuLL20-10,
title = {How Hard Is Completeness Reasoning for Conjunctive Queries?},
author = {Xianmin Liu and Jianzhong Li 0001 and Yingshu Li},
year = {2020},
doi = {10.1007/978-3-030-58150-3_12},
url = {https://doi.org/10.1007/978-3-030-58150-3_12},
researchr = {https://researchr.org/publication/LiuLL20-10},
cites = {0},
citedby = {0},
pages = {149-161},
booktitle = {Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings},
editor = {Donghyun Kim 0001 and R. N. Uma and Zhipeng Cai 0001 and Dong Hoon Lee 0001},
volume = {12273},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-58150-3},
}