相关论文: A Characterization of Quasi-Decreasingness
This paper considers quasi-reductivity - essentially, the property that an evaluation cannot get "stuck" due to a missing case in pattern matching - in the context of term rewriting with logical constraints.
We present an Isabelle/HOL formalization of a characterization of confluence for quasi-reductive strongly deterministic conditional term rewrite systems, due to Avenhaus and Lor\'ia-S\'aenz.
Unravelings are transformations from a conditional term rewriting system (CTRS, for short) over an original signature into an unconditional term rewriting systems (TRS, for short) over an extended signature. They are not sound w.r.t.…
We study confluence in the setting of higher-order infinitary rewriting, in particular for infinitary Combinatory Reduction Systems (iCRSs). We prove that fully-extended, orthogonal iCRSs are confluent modulo identification of…
We establish existence with sharp rates of decay and distance from the Chapman--Enskog approximation of small-amplitude quasilinear relaxation shocks in the general case that the profile ODE may become degenerate. Our method of analysis…
Logically constrained term rewriting is a relatively new rewriting formalism that naturally supports built-in data structures, such as integers and bit vectors. In the analysis of logically constrained term rewrite systems (LCTRSs),…
Quasi-conformal actions were introduced in the physics literature as a generalization of the familiar fractional linear action on the upper half plane, to Hermitian symmetric tube domains based on arbitrary Jordan algebras, and further to…
A quasi-entropy is constructed for tensors averaged by a density function on $SO(3)$ using the log-determinant of a covariance matrix. It serves as a substitution of the entropy for tensors derived from a constrained minimization that…
We define two transformations from term rewriting systems (TRSs) to context-sensitive TRSs in such a way that termination of the target system implies outermost termination of the original system. In the transformation based on 'context…
Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term…
Unified Speech Recognition (USR) has emerged as a semi-supervised framework for training a single model for audio, visual, and audiovisual speech recognition, achieving state-of-the-art results on in-distribution benchmarks. However, its…
An important problem in applications of quasiconformal analysis and in its numerical aspect is to establish algorithms for explicit or approximate determination of the basic quasiinvariant curvelinear and analytic functionals intrinsically…
Convergence of an abstract reduction system (ARS) is the property that any derivation from an initial state will end in the same final state, a.k.a. normal form. We generalize this for probabilistic ARS as almost-sure convergence, meaning…
A new consistent analysis of the renormalized proton--neutron quasiparticle random phase approximation based on the simultaneous recalculation of the one--body density matrix and the pairing tensor has been used to study the double beta…
For a map f: X -> Y of quasi-compact quasi-separated schemes, we discuss quasi-perfection, that is, the right adjoint f^\times of the derived functor Rf_* respects small direct sums. This is equivalent to the existence of a functorial…
We prove that if f : R^N --> R is quasiconvex and U is open in the density topology of R^N, then sup_U f = ess sup_U f, while inf_U f = ess inf_U f if and only if the equality holds when U = R^N. The first (second) property is typical of…
It is known that the first-order theory of rewriting is decidable for ground term rewrite systems, but the general technique uses tree automata and often takes exponential time. For many properties, including confluence (CR), uniqueness of…
We present a variation of quasi-isometry to approach the problem of defining a geometric notion equivalent to commensurability. In short, this variation can be summarized as "quasi-isometry with uniform parameters for a large enough family…
Logically constrained term rewrite systems (LCTRSs) are a rewriting formalism that naturally supports built-in data structures, including integers and bit-vectors. The recent framework of existentially constrained terms and most general…
We present the first representation of the general term of the Rayleigh-Schr\"odinger series for quasidegenerate systems. Each term of the series is represented by a tree and there is a straightforward relation between the tree and the…