English
Related papers

Related papers: Non-Numerical Weakly Relational Domains

200 papers

In this paper we show that reversible analysis of logic languages by abstract interpretation can be performed without loss of precision by systematically refining abstract domains. The idea is to include semantic structures into abstract…

Programming Languages · Computer Science 2007-05-23 R. Giacobazzi , F. Ranzato , F. Scozzari

This thesis pertains to the study of elliptic and parabolic partial differential equations on "thin" structures. The first main objective is to establish the strong and weak low-dimensional counterparts of the parabolic Neumann problem. The…

Analysis of PDEs · Mathematics 2024-04-17 Łukasz Chomienia

Machine translation systems are vulnerable to domain mismatch, especially in a low-resource scenario. Out-of-domain translations are often of poor quality and prone to hallucinations, due to exposure bias and the decoder acting as a…

Computation and Language · Computer Science 2021-09-22 Nikolay Bogoychev , Pinzhen Chen

This work presents exact expressions for size distributions of weak/multilayer connected components in two generalisations of the configuration model: networks with directed edges and multiplex networks with arbitrary number of layers. The…

Combinatorics · Mathematics 2017-11-08 I. Kryven

Large scale neural recordings have established that the transformation of sensory stimuli into motor outputs relies on low-dimensional dynamics at the population level, while individual neurons exhibit complex selectivity. Understanding how…

Neurons and Cognition · Quantitative Biology 2018-08-29 Francesca Mastrogiuseppe , Srdjan Ostojic

The following document presents some novel numerical methods valid for one and several variables, which using the fractional derivative, allow to find solutions for some non-linear systems in the complex space using real initial conditions.…

Numerical Analysis · Mathematics 2024-04-25 A. Torres-Hernandez , F. Brambila-Paz

Fourier extension is an approximation scheme in which a function on an arbitary bounded domain is approximated using a classical Fourier series on a bounding box. On the smaller domain the Fourier series exhibits redundancy, and it has the…

Numerical Analysis · Mathematics 2017-06-16 Roel Matthysen , Daan Huybrechs

In case of incomplete database tables, a possible world is obtained by replacing any missing value by a value from the corresponding attribute's domain that can be infinite. A possible key or possible functional dependency constraint is…

Databases · Computer Science 2024-02-08 Munqath Al-atar , Attila Sali

The paper deals with partial and weak preference relations defined on infinite-dimensional vector spaces and compatible with algebraic operations. By a partial preference we mean an asymmetric and transitive binary relation, while a weak…

Optimization and Control · Mathematics 2024-01-17 V. V. Gorokhovik

Qualitative calculi play a central role in representing and reasoning about qualitative spatial and temporal knowledge. This paper studies distributive subalgebras of qualitative calculi, which are subalgebras in which (weak) composition…

Artificial Intelligence · Computer Science 2015-06-02 Zhiguo Long , Sanjiang Li

Fixed point iterations are a fundamental tool in numerical analysis and scientific computing for the approximation of solutions to nonlinear problems. Their convergence is often established via the Banach fixed point theorem, provided that…

Numerical Analysis · Mathematics 2026-04-29 Thomas P. Wihler

We give a necessary and sufficient condition for non-local functionals on vector-valued Lebesgue spaces to be weakly sequentially lower semi-continuous. Here a non-local functional shall have the form of a double integral of a density which…

Functional Analysis · Mathematics 2011-04-15 Peter Elbau

Concrete domains, especially those that allow to compare features with numeric values, have long been recognized as a very desirable extension of description logics (DLs), and significant efforts have been invested into adding them to usual…

Artificial Intelligence · Computer Science 2020-06-04 Nadia Labai , Magdalena Ortiz , Mantas Šimkus

Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of…

Computational Complexity · Computer Science 2012-06-13 Stefan Göller , Arne Meier , Martin Mundhenk , Thomas Schneider , Michael Thomas , Felix Weiss

This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is $\Delta^0_2$ categorical. A structure A is said to be weakly ultrahomogeneous if there is a…

Logic · Mathematics 2016-08-04 Francis Adams , Douglas Cenzer

We study second-order divergence-form systems on half-infinite cylindrical domains with a bounded and possibly rough base, subject to homogeneous mixed boundary conditions on the lateral boundary and square integrable Dirichlet, Neumann, or…

Analysis of PDEs · Mathematics 2021-08-13 Pascal Auscher , Moritz Egert

A note on the property of weak contraction, which implies that all bounded solutions of a nonlinear system converge to a (possibly non-unique) equilibrium. We provide some simple results about interconnections of such systems, and a brief…

Optimization and Control · Mathematics 2015-10-13 Ian R. Manchester , Jean-Jacques E. Slotine

We analyze the relation between the concept of auxiliary variables and the Inverse problem of the calculus of variations to construct a Lagrangian from a given set of equations of motion. The problem of the construction of a consistent…

High Energy Physics - Theory · Physics 2007-05-23 Ignacio Cortese , J. Antonio Garcia

We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of for00504925mulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in…

Computational Complexity · Computer Science 2012-10-24 Bruno Grenet , Erich Kaltofen , Pascal Koiran , Natacha Portier

We present a streamlined and (hopefully) accessible proof of the model-completeness of the weak monadic second order version of a dense linear order with left-endpoint but no right-endpoint in a particular finite signature. We also show how…

Logic · Mathematics 2022-09-15 Deacon Linkhorn