3 papers
cs.AI2017
A New Probabilistic Algorithm for Approximate Model Counting
Cunjing Ge, Feifei Ma, Tian Liu +1
Constrained counting is important in domains ranging from artificial intelligence to software analysis. There are already a few approaches for counting models over various types of…
cs.AI2017
Diversified Top-k Partial MaxSAT Solving
Junping Zhou, Huanyao Sun, Feifei Ma +3
We introduce a diversified top-k partial MaxSAT problem, a combination of partial MaxSAT problem and enumeration problem. Given a partial MaxSAT formula F and a positive integer k,…
cs.AI2015
A Tool for Computing and Estimating the Volume of the Solution Space of SMT(LA)
Cunjing Ge, Feifei Ma, Jian Zhang
There are already quite a few tools for solving the Satisfiability Modulo Theories (SMT) problems. In this paper, we present \texttt{VolCE}, a tool for counting the solutions of SM…