Publisher
Springer International Publishing
Reference16 articles.
1. Arnold, A., Niwiński, D., Parys, P.: A quasi-polynomial black-box algorithm for fixed point evaluation. In: Baier, C., Goubault-Larrecq, J. (eds.) 29th EACSL Annual Conference on Computer Science Logic (CSL 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 183, pp. 9:1–9:23. Dagstuhl (2021). https://doi.org/10.4230/LIPIcs.CSL.2021.9
2. Lecture Notes in Computer Science;E Cohen,2000
3. Dannert, K., Grädel, E., Naaf, M., Tannen, V.: Generalized absorptive polynomials and provenance semantics for fixed-point logic. arXiv: 1910.07910 [cs.LO] (2019). https://arxiv.org/abs/1910.07910, full version of [4]
4. Dannert, K., Grädel, E., Naaf, M., Tannen, V.: Semiring provenance for fixed-point logic. In: Baier, C., Goubault-Larrecq, J. (eds.) 29th EACSL Annual Conference on Computer Science Logic (CSL 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 183, pp. 17:1–17:22. Dagstuhl (2021). https://doi.org/10.4230/LIPIcs.CSL.2021.17
5. Deutch, D., Milo, T., Roy, S., Tannen, V.: Circuits for datalog provenance. In: Proceedings of 17th International Conference on Database Theory ICDT, pp. 201–212. OpenProceedings.org (2014). https://doi.org/10.5441/002/icdt.2014.22
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献