activity
20192023
most citedDensities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere

12 citations · 20 across the 4 of their papers we have counts for

collaborators
Showing cs.LOShow all

3 papers · 1 filter

cs.LO2021

Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses

Toby Cathcart Burn, Luke Ong, Steven Ramsay +1

We present initial limit Datalog, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable. The class may be viewed as a generalisation…

cs.LO2020★ 12 cited

Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere

Carol Mak, C. -H. Luke Ong, Hugo Paquet +1

We study the differential properties of higher-order statistical probabilistic programs with recursion and conditioning. Our starting point is an open problem posed by Hongseok Yan…

cs.LO2019★ 8 cited

HoCHC: A Refutationally Complete and Semantically Invariant System of Higher-order Logic Modulo Theories

C. -H. Luke Ong, Dominik Wagner

We present a simple resolution proof system for higher-order constrained Horn clauses (HoCHC) - a system of higher-order logic modulo theories - and prove its soundness and refutat…