In many real-life problems, we are often faced with manipulating families of sets. Manipulation of large-scale set families is one of the important fundamental techniques for web information retrieval, integration, and mining. For this purpose, a special type of binary decision diagrams (BDDs), called Zero-suppressed BDDs (ZDDs), is used. However, current techniques for storing ZDDs require a h...

The formalism of Dalitz-plot analysis is reviewed in the preceding note. Recent studies of multi-body decays of charm mesons probe a variety of physics, including γ/φ 3 , D 0 –D 0 mixing, searches for CP violation, doubly Cabibbo-suppressed decays, and properties of S-wave ππ, Kπ, and K ¯ K resonances. In the following, we discuss: (1) D 0 → K 0 S π + π − ; (2) doubly Cabibbo-suppressed decays;...

Much recent work has gone into adapting techniques that were originally developed for SAT solving to QBF solving. In particular, QBF solvers are often based on SAT solvers. Most competitive QBF solvers are search-based. In this work we explore an alternative approach to QBF solving, based on symbolic quantifier elimination. We extend some recent symbolic approaches for SAT solving to symbolic Q...

Asynchronous circuits, which have no global clocks and work based on the causality relation between signal transitions, potentially have the advantages of high performance and low power dissipation. However, the state spaces of asynchronous circuits are often huge, because unlike synchronous circuits every wire has states. Thus, the formal verification of asynchronous circuits is more difficult...

The formalism of Dalitz-Plot analysis is reviewed in the preceding note. Recent studies of multi-body decays of charm mesons probe a variety of physics including γ/φ 3 , D 0 –D 0 mixing, searches for CP violation, doubly Cabibbo-suppressed decays, and properties of S-wave ππ, Kπ, and KK resonances. In the following, we discuss: (1) D 0 → K 0 S π + π − ; (2) doubly Cabibbo-suppressed decays; and...

We present an extensive experimental study of consequence-finding algorithms based on kernel resolution, using both a trie-based and a novel ZBDD-based implementation, which uses ZeroSuppressed Binary Decision Diagrams to concisely store and process very large clause sets. Our study considers both the full prime implicate task and applications of consequence-finding for restricted target langua...