Results 11 to 20 of about 149,837 (302)
Superposition for Fixed Domains [PDF]
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the theory. Proving universal properties with respect to a saturated theory directly leads to a modification of the minimal
Matthias Horbach, Christoph Weidenbach
core +6 more sources
Entanglement of Superposition and Superposition of Entanglement
We consider that the superposition of space is given by the Bell states and that those states are in superposition themselves.
Matheus Pereira Lobo
openaire +3 more sources
Superposition with Lambdas [PDF]
AbstractWe designed a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on $$\beta \eta $$ β η -equivalence classes of $$\lambda $$
Bentkamp, Alexander +4 more
openaire +8 more sources
Superposition with Delayed Unification
AbstractClassically, in saturation-based proof systems, unification has been considered atomic. However, it is also possible to move unification to the calculus level, turning the steps of the unification algorithm into inferences. For calculi that rely on unification procedures returning large or even infinite sets of unifiers, integrating unification
Ahmed Bhayat +2 more
openaire +3 more sources
The interpretation of superposition rheology data is still a matter of debate due to lack of understanding of viscoelastic superposition response on a microscopic level. So far, only phenomenological approaches have been described, which do not capture the shear induced microstructural deformation, which is responsible for the viscoelastic behavior to ...
Dhont, J. K. G., Wagner, N. J.
openaire +4 more sources
Reducibility Constraints in Superposition [PDF]
Abstract Modern superposition inference systems aim at reducing the search space by introducing redundancy criteria on clauses and inferences. This paper focuses on reducing the number of superposition inferences with a single clause by blocking inferences into some terms, provided there were previously made inferences of a certain form ...
Márton Hajdú +3 more
openaire +2 more sources
In this paper we solve a long-standing open problem by showing that strict superposition—that is, superposition without equality factoring—is refutationally complete. The difficulty of the problem arises from the fact that the strict calculus, in contrast to the standard calculus with equality factoring, is not compatible with arbitrary removal of ...
Bachmair, L., Ganzinger, H.
openaire +3 more sources
Entanglement of Superpositions [PDF]
Given a bipartite quantum state (in arbitrary dimension) and a decomposition of it as a superposition of two others, we find bounds on the entanglement of the superposition state in terms of the entanglement of the states being superposed. In the case that the two states being superposed are biorthogonal, the answer is simple, and, for example, the ...
Linden, Noah +2 more
openaire +3 more sources
Concurrence of superpositions [PDF]
The bounds on concurrence of the superposition state in terms of those of the states being superposed are studied in this paper. The bounds on concurrence are quite different from those on the entanglement measure based on von Neumann entropy (Phys. Rev. Lett. 97, 100502 (2006)).
Yu, Chang-shui, Yi, X. X., Song, He-shan
openaire +2 more sources
HannahFP/Superposition: Parallels of quantum superposition in ecological models
<p>All data and code used for analyses in paper "Parallels of quantum superposition in ecological models: from counterintuitive patterns to eco-evolutionary interpretations of cryptic species".</p ...
Hannah Fried-Petersen
core +1 more source

