Page not found

Perhaps you were looking for one of these?

Latest

• <b>Our work Towards Practical First-Order Model Counting has been accepted to <a href="https://satisfiability.org/SAT25/">SAT 2025</a>.</b><br>We extend the first-order model counting algorithm Crane with the ability to find the base cases of recursive functions and compile (recursive) function definitions into C++ programs.<br>Authors: Ananth K. Kidambi, Guramrit Singh, Paulius Dilkas, and Kuldeep S. Meel<br>
• Towards Practical First-Order Model Counting
• Locally-Minimal Probabilistic Explanations
• <b>Our work on lower bounding minimal model count</a> has been accepted to <a href="https://www.iclp24.utdallas.edu/">ICLP 2024</a>.</b> <br> We present two techniques for lower bounding the number of minimal models of a propositional formula. The work has been selected for TPLP journal <br> Authors: Mohimenul Kabir and Kuldeep S. Meel<br>
• <b>Our work on Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving</a> has been accepted to <a href="http://satisfiability.org/SAT24/">SAT 2024</a>.</b> <br> We introduce a novel circuit mapping method by combining incremental and parallel solving for Boolean Satisfiability (SAT). We present an innovative SAT encoding for circuit mapping problems, which significantly improves solver-based mapping methods and provides a smooth trade-off between compilation quality and compilation time. <br> Authors: Jiong Yang, Yaroslav A. Kharkov, Yunong Shi, Marijn Heule, and Bruno Dutertre <br>
• <b>Our work on Formally Certified Approximate Model Counting</a> has been accepted to <a href="http://www.i-cav.org/2024/">CAV 2024</a>.</b> <br> We present the first certification framework for approximate model counting with formally verified guarantees on the quality of its output approximation. Our approach combines: (i) a static, once-off, formal proof of the algorithm&apos;s PAC guarantee in the Isabelle/HOL proof assistant; and (ii) dynamic, per-run, verification of ApproxMC&apos;s calls to an external CNF-XOR solver using proof certificates. <br> Authors: Yong Kiam Tan, Jiong Yang, Mate Soos, Magnus O. Myreen, and Kuldeep S. Meel<br>
• An Approximate Skolem Function Counter
• Auditable Algorithms for Approximate Model Counting
• Engineering an Exact Pseudo-Boolean Model Counter
• Exact ASP Counting with Compact Encodings