105,861 research outputs found

    On the Role of Canonicity in Bottom-up Knowledge Compilation

    Get PDF
    We consider the problem of bottom-up compilation of knowledge bases, which is usually predicated on the existence of a polytime function for combining compilations using Boolean operators (usually called an Apply function). While such a polytime Apply function is known to exist for certain languages (e.g., OBDDs) and not exist for others (e.g., DNNF), its existence for certain languages remains unknown. Among the latter is the recently introduced language of Sentential Decision Diagrams (SDDs), for which a polytime Apply function exists for unreduced SDDs, but remains unknown for reduced ones (i.e. canonical SDDs). We resolve this open question in this paper and consider some of its theoretical and practical implications. Some of the findings we report question the common wisdom on the relationship between bottom-up compilation, language canonicity and the complexity of the Apply function

    Constrained hyperbolic divergence cleaning in smoothed particle magnetohydrodynamics with variable cleaning speeds

    Get PDF
    We present an updated constrained hyperbolic/parabolic divergence cleaning algorithm for smoothed particle magnetohydrodynamics (SPMHD) that remains conservative with wave cleaning speeds which vary in space and time. This is accomplished by evolving the quantity ψ/ch\psi / c_h instead of ψ\psi. Doing so allows each particle to carry an individual wave cleaning speed, chc_h, that can evolve in time without needing an explicit prescription for how it should evolve, preventing circumstances which we demonstrate could lead to runaway energy growth related to variable wave cleaning speeds. This modification requires only a minor adjustment to the cleaning equations and is trivial to adopt in existing codes. Finally, we demonstrate that our constrained hyperbolic/parabolic divergence cleaning algorithm, run for a large number of iterations, can reduce the divergence of the field to an arbitrarily small value, achieving B=0\nabla \cdot B=0 to machine precision.Comment: 23 pages, 16 figures, accepted for publication in Journal of Computational Physic
    corecore