Related papers: Symbol Elimination for Parametric Second-Order Ent…
This paper is concerned with the study of constrained statistical learning problems, the unconstrained version of which are at the core of virtually all of modern information processing. Accounting for constraints, however, is paramount to…
In this paper we consider an un-cooperative spectrum sharing scenario, wherein a radar system is to be overlaid to a pre-existing wireless communication system. Given the order of magnitude of the transmitted powers in play, we focus on the…
The parameterized model-checking problem for a class of first-order sentences (queries) asks to decide whether a given sentence from the class holds true in a given relational structure (database); the parameter is the length of the…
Automatic structures are first-order structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure…
In this paper natural necessary and sufficient conditions for quantifier elimination of matrix rings $M_n(K)$ in the language of rings expanded by two unary functions, naming the trace and transposition, are identified. This is used…
We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that…
In this study, explicit differential equations representing commutative pairs of some well-known second-order linear time-varying systems have been derived. The commutativity of these systems are investigated by considering 30 second-order…
The completeness of the group classification of systems of two linear second-order ordinary differential equations with constant coefficients is delineated in the paper. The new cases extend what has been done in the literature. These cases…
Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…
The spontaneous disentanglement hypothesis is motivated by some outstanding issues in standard quantum mechanics, including the problem of quantum measurement. The current study compares between some possible methods that can be used to…
The problem of learning a minimal consistent model from a set of labeled sequences of symbols is addressed from a satisfiability modulo theories perspective. We present two encodings for deterministic finite automata and extend one of these…
Recent years have seen growing interest in learning disentangled representations, in which distinct features, such as size or shape, are represented by distinct neurons. Quantifying the extent to which a given representation is disentangled…
We investigate rules which allow variable elimination in binary CSP (constraint satisfaction problem) instances while conserving satisfiability. We study variable-elimination rules based on the language of forbidden patterns enriched with…
Two-sample hypothesis testing for network comparison presents many significant challenges, including: leveraging repeated network observations and known node registration, but without requiring them to operate; relaxing strong structural…
By limiting the range of the predicate variables in a second-order language one may obtain restricted versions of second-order logic such as weak second-order logic or definable subset logic. In this note we provide an infinitary strongly…
Unconventional receivers enable reduction of error rates in optical communication systems below the standard quantum limit (SQL) by implementing discrimination strategies for constellation symbols that go beyond the canonical measurement of…
The saturation-based reasoning methods are among the most theoretically developed ones and are used by most of the state-of-the-art first-order logic reasoners. In the last decade there was a sharp increase in performance of such systems,…
We investigate two types of boundedness criteria for bilinear Fourier multiplier operators with symbols with bounded partial derivatives of all (or sufficiently many) orders. Theorems of the first type explicitly prescribe only a certain…
The dual-frame formalism leads to an approach to extend numerical relativity simulations in generalized harmonic gauge (GHG) all the way to null infinity. A major setback is that without care, even simple choices of initial data give rise…
Clause sets saturated by hierarchic ordered resolution do not offer a model representation that can be effectively queried, in general. They only offer the guarantee of the existence of a model. We present an effective symbolic model…