Optimized SAT solvers not only preprocess the clause set, they also transform it during solving as inprocessing. Some preprocessing techniques have been generalized to first-order logic with equality. In this article, we port inprocessing work superposition, a leading proof calculus, and strengthen known techniques. Specifically, look into elimination of hidden literals, variables (predicates),...

Let 0 < a < 1 and set Φ(t) = |t|, ∀ t ∈ R. Let 1 < p < ∞ and n ≥ 1. We prove that the superposition operator u 7→ Φ(u) maps the Sobolev space W (R) into the fractional Sobolev space W (R). We also investigate the case of more general nonlinearities. Résumé. Superposition avec des puissances sousunitaires dans les espaces de Sobolev. Pour 0 < a < 1, soit Φ(t) = |t|, ∀ t ∈ R. Soient 1 < p < ∞ et ...

We investigate the utility of non classical states of simple harmonic oscillators (a superposition of coherent states) for sensitive force detection. We find that like squeezed states a superposition of coherent states allows the detection of displacement measurements at the Heisenberg limit. Entangling many superpositions of coherent states offers a significant advantage over a single mode sup...

We argue that superposition and the joint action style of specification are well suited for the aspect-oriented formal specification of distributed systems. Superposition steps structure a specification according to behavior instead of implementation level components. Superposition also makes it possible to verify temporal safety properties and refine and compose specifications in a way that pr...