Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termination without generating an empty clause, a saturated clause set implicitly represents a minimal model for all clauses, based on the underlying term ordering of the superposition calculus. In general, it is not decidable wheth...

We present an associative-commutative paramodulation calculus that generalizes the associativecommutative completion procedure to first-order clauses. The calculus is parametrized by a selection function (on negative literals) and a well-founded ordering on terms. It is compatible with an abstract notion of redundancy that covers such simplification techniques as tautology deletion, subsumption...

Networks are often used to understand a whole system by modeling the interactions among its pieces. Examples include biomolecules in a cell interacting to provide some primary function, or species in an environment forming a stable community. However, these interactions are often unknown; instead, the pieces' dynamic states are known, and network structure must be inferred. Because observed fun...

The design of an optical computer must be based on the characteristics of optics and optical technology, and not on those of electronic technology. The property of optical superposition is considered and the implications it has in the design of computing systems is discussed. It can be exploited in the implementation of optical gates, interconnections, and shared memory. INTRODUCTION Fundamenta...

We present an extension of superposition that natively handles a polymorphic type system extended with type classes, thus eliminating the need for type encodings when used by an interactive theorem prover like Isabelle/HOL. We describe syntax, typing rules, semantics, the polymorphic superposition calculus and an evaluation on a problem set that is generated from Isabelle/HOL theories. Our eval...

We investigate the superposition strategy and its usefulness in terms of achievable information theoretic rates. The achievable rate of the superposition of block Markov encoding (decode-forward) and side information encoding (compress-forward) for the three-node Gaussian relay channel is analyzed. It is generally believed that the superposition can out perform decode-forward or compress-forwar...

An operational measure to quantify the sizes of some “macroscopic quantum superpositions”, realized in recent experiments, is proposed. The measure is based on the fact that a superposition presents greater sensitivity in interferometric applications than its superposed constituent states. This enhanced sensitivity, or “interference utility”, may then be used as a size criterion among superposi...

We deene a superposition calculus specialized for abelian groups represented as integer modules, and show its refutational completeness. This allows to substantially reduce the number of inferences compared to a standard superposition prover which applies the axioms directly. Speciically, equational literals are simpliied, so that only the maximal term of the sums is on the left-hand side. Only...

The viscoelastic response of commercial Al–Zn–Mg and Al–Cu–Mg alloys was measured with a dynamic-mechanical analyzer (DMA) as a function of the temperature (from 30 to 425C) and the loading frequency (from 0.01 to 150Hz).The time-temperature superposition (TTS) principle has proven to be useful in studying mechanical relaxations and obtaining master curves for amorphous materials. In this work,...