no code implementations • 17 Aug 2023 • Yuanhong Wang, Juhua Pu, Yuyi Wang, Ondřej Kuželka
Specifically, we prove the domain-liftability under sampling for the two-variables fragment of first-order logic with counting quantifiers in this paper, by devising an efficient sampling algorithm for this fragment that runs in time polynomial in the domain size.
1 code implementation • 6 Feb 2023 • Yuanhong Wang, Juhua Pu, Yuyi Wang, Ondřej Kuželka
In this paper, we study the sampling problem for first-order logic proposed recently by Wang et al. -- how to efficiently sample a model of a given first-order sentence on a finite domain?
no code implementations • 12 Nov 2017 • Yuanhong Wang, Yuyi Wang, Xingwu Liu, Juhua Pu
We consider general weighted ERM and show new universal risk bounds for this problem.