[PDF][PDF] Unboundedness Problems for Machines with Reversal-Bounded Counters.
P Baumann, F D'Alessandro, M Ganardi, OH Ibarra… - FoSSaCS, 2023 - library.oapen.org
We consider a general class of decision problems concerning formal languages, called
“(one-dimensional) unboundedness predicates”, for automata that feature reversal-bounded …
“(one-dimensional) unboundedness predicates”, for automata that feature reversal-bounded …
Higher-order MSL horn constraints
The monadic shallow linear (MSL) class is a decidable fragment of first-order Horn clauses
that was discovered and rediscovered around the turn of the century, with applications in …
that was discovered and rediscovered around the turn of the century, with applications in …
Higher-Order MSL Horn Constraints
The monadic shallow linear (MSL) class is a decidable fragment of first-order Horn clauses
that was discovered and rediscovered around the turn of the century, with applications in …
that was discovered and rediscovered around the turn of the century, with applications in …
Fast and correct variational inference for probabilistic programming: Differentiability, reparameterisation and smoothing
D Wagner - 2023 - ora.ox.ac.uk
Probabilistic programming is an innovative programming paradigm for posing and
automatically solving Bayesian inference problems. In this thesis, we study the foundations …
automatically solving Bayesian inference problems. In this thesis, we study the foundations …