Publisher
Springer International Publishing
Reference37 articles.
1. Abramsky, S., Kontinen, J., Väänänen, J., Vollmer, H. (eds.): Dependence Logic, Theory and Applications. Springer, Basel (2016).
https://doi.org/10.1007/978-3-319-31803-5
2. Bläsius, T., Friedrich, T., Schirneck, M.: The parameterized complexity of dependency detection in relational databases. In: Guo, J., Hermelin, D. (eds.) 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 63, pp. 6:1–6:13. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017).
http://drops.dagstuhl.de/opus/volltexte/2017/6920
,
https://doi.org/10.4230/LIPIcs.IPEC.2016.6
3. Chen, H., Mengel, S.: A trichotomy in the complexity of counting answers to conjunctive queries. In: Arenas, M., Ugarte, M. (eds.) 18th International Conference on Database Theory, ICDT 2015, Brussels, Belgium, 23–27 March 2015. LIPIcs, vol. 31. pp. 110–126. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015).
https://doi.org/10.4230/LIPIcs.ICDT.2015.110
4. Chen, H., Mengel, S.: Counting answers to existential positive queries: a complexity classification. In: Milo, T., Tan, W.-C. (eds.) Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, 26 June–01 July 2016, pp. 315–326. ACM (2016).
https://doi.org/10.1145/2902251.2902279
5. Chen, H., Mengel, S.: The logic of counting query answers. In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, 20–23 June 2017, pp. 1–12. IEEE Computer Society (2017).
https://doi.org/10.1109/LICS.2017.8005085
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献