相关论文: On the Strength of Uniqueness Quantification in Pr…
We answer the question which conjunctive queries are uniquely characterized by polynomially many positive and negative examples, and how to construct such examples efficiently. As a consequence, we obtain a new efficient exact learning…
A canonical result in model theory is the homomorphism preservation theorem (h.p.t.) which states that a first-order formula is preserved under homomorphisms iff it is equivalent to an existential-positive formula, standardly proved via a…
We study constraint satisfaction problems (CSPs) in the presence of counting quantifiers $\exists^{\geq j}$, asserting the existence of $j$ distinct witnesses for the variable in question. As a continuation of our previous (CSR 2012) paper,…
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…
We investigate the quantitative uniqueness of solutions to parabolic equations with lower order terms on compact smooth manifolds. Quantitative uniqueness is a quantitative form of strong unique continuation property. We characterize…
We consider the problem of uniqueness of positive solutions to boundary value problems containing the equation: -\Delta_p u =K(|x|)f(u), p>1. f is positive, is locally Lipschitz and satisfies some superlinear growth condition after u_0, a…
The quantified constraint satisfaction problem (QCSP) is a powerful framework for modelling computational problems. The general intractability of the QCSP has motivated the pursuit of restricted cases that avoid its maximal complexity. In…
Let $A$ be a separable, unital and exact $C^*$-algebra satisfying the universal coefficient theorem. We prove uniqueness theorems up to unitary conjugacy for unital, full and nuclear maps from $A$ into ultraproducts of finite von Neumann…
The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment to contexts involving relations of arity greater than two. Quantifiers in this logic are used in…
Positivity, the assumption that every unique combination of confounding variables that occurs in a population has a non-zero probability of an action, can be further delineated as deterministic positivity and stochastic positivity. Here, we…
For a fixed countably infinite structure \Gamma\ with finite relational signature \tau, we study the following computational problem: input are quantifier-free \tau-formulas \phi_0,\phi_1,...,\phi_n that define relations R_0,R_1,...,R_n…
In this paper we investigate the existence of solutions and their weak-strong uniqueness property for a PDE system modelling damage in viscoelastic materials. In fact, we address two solution concepts, weak and strong solutions. For the…
This paper deals with a problem from discrete-time robust control which requires the solution of constraints over the reals that contain both universal and existential quantifiers. For solving this problem we formulate it as a program in a…
Deciding formulas mixing arithmetic and uninterpreted predicates is of practical interest, notably for applications in verification. Some decision procedures consist in building by structural induction an automaton that recognizes the set…
Quantization reduces the numerical precision of Transformer computations and is widely used to accelerate inference, yet its effect on expressivity remains poorly characterized. We demonstrate a fine-grained theoretical tradeoff between…
Quantified constraints over the reals appear in numerous contexts. Usually existential quantification occurs when some parameter can be chosen by the user of a system, and univeral quantification when the exact value of a parameter is…
Literature on Constraint Satisfaction exhibits the definition of several structural properties that can be possessed by CSPs, like (in)consistency, substitutability or interchangeability. Current tools for constraint solving typically…
We give a new sufficient condition which allows to test primality of Fermat's numbers. This characterization uses uniquely values at most equal to tested Fermat number. The robustness of this result is due to a strict use of elementary…
This article fits in the area of research that investigates the application of topological duality methods to problems that appear in theoretical computer science. One of the eventual goals of this approach is to derive results in…
We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable…