| Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere N Yoshida, C Mak, C Ong, H Paquet, D Wagner Programming Languages and Systems30th European Symposium on Programming …, 2021 | 25 | 2021 |
| HoCHC: A refutationally complete and semantically invariant system of higher-order logic modulo theories CHL Ong, D Wagner 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-14, 2019 | 14 | 2019 |
| Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses TC Burn, L Ong, S Ramsay, D Wagner arXiv preprint arXiv:2104.14175, 2021 | 4 | 2021 |
| Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothing B Khajwal, CHL Ong, D Wagner European Symposium on Programming, 479-506, 2023 | 3 | 2023 |
| Fast and correct variational inference for probabilistic programming: Differentiability, reparameterisation and smoothing D Wagner University of Oxford, 2023 | 1 | 2023 |
| Diagonalisation SGD: Fast & Convergent SGD for Non-Differentiable Models via Reparameterisation and Smoothing D Wagner, B Khajwal, L Ong International Conference on Artificial Intelligence and Statistics, 1801-1809, 2024 | | 2024 |
| Initial limit Datalog: a new extensible class of decidable constrained Horn clauses T Cathcart Burn, CH Ong, S Ramsay, D Wagner Institute of Electrical and Electronics Engineers, 2021 | | 2021 |
| Densities of almost-surely terminating probabilistic programs are differentiable almost everywhere C Mak, CHL Ong, H Paquet, D Wagner arXiv preprint arXiv:2004.03924, 2020 | | 2020 |
| Resolution for Higher-Order Constrained Horn Clauses D Wagner University of Oxford, 2018 | | 2018 |
