Constraint propagation solvers interleave propagation (removing impossible values from variable domains) with search. Previously, Schulte and Stuckey introduced the use of static analysis to determine where in a constraint program domain propagators can be replaced by more efficient bounds propagators and still ensure that the same search space is traversed. This paper introduces a dynamic yet ...

Lazy clause generation is a powerful approach to reducing search in constraint programming. For use in a lazy clause generation solver, global constraints must be extended to explain themselves. In this paper we present two new generic flow-based propagators (for hard and soft flow-based constraints) with several novel features, and most importantly, the addition of explanation capability. We d...

Using the known propagator equations for 0,1 and 2 forms in AdSd+1, we find the p-form field propagator equations in dimensions where the forms are Poincaré dual. Since the general equation obeyed by the propagators is linear in dimension, this gives us the equation obeyed by the propagators for any d. Furthermore, based on the Poincaré duality formulas for 0,1,2 and 3 forms we conjecture the g...

A numerical investigation of time-separated charge overlap measurements is carried out for the pion in the context of lattice QCD using smeared Wilson fermions. The evolution of the charge distribution function is examined and the expected asymptotic time behavior ∼ e −(Eq−mπ)t , where t represents the charge density relative time separation, is clearly visible in the Fourier transform. Values ...

Using the method of Darboux transformations (or equivalently supersymmetric quantum mechanics) we obtain an explicit expression for the propagator for the onedimensional Schrödinger equation with a multi-soliton potential.