English
Related papers

Related papers: Domain closure conditions and definability preserv…

200 papers

A domain analysis & description calculus is introduced. It is shown to alleviate the issue of implicit semantics. The claim is made that domain descriptions, whether informal, or as also here, formal, amount to an explicit semantics for…

Programming Languages · Computer Science 2018-05-16 Dines Bjørner

For differential inequalities with the $\infty$-Laplacian in the principal part, we obtain conditions for the absence of solutions in unbounded domains. Examples are given to demonstrate the accuracy of these conditions.

Analysis of PDEs · Mathematics 2023-01-02 A. A. Kon'kov

We study some problems inherent with certain forms of functional depth, in particular, zero depth and lack of consistency.

Probability · Mathematics 2013-10-02 James Kuelbs , Joel Zinn

In this paper we give sufficient conditions on the approximating domains in order to obtain the continuity of solutions for the fractional $p-$laplacian. These conditions are given in terms of the fractional capacity of the approximating…

Analysis of PDEs · Mathematics 2017-04-19 Carla Baroncini , Julian Fernandez Bonder , Juan F. Spedaletti

The assumption of complete domain knowledge is not warranted for robot planning and decision-making in the real world. It could be due to design flaws or arise from domain ramifications or qualifications. In such cases, existing planning…

Artificial Intelligence · Computer Science 2020-11-19 Akshay Sharma , Piyush Rajesh Medikeri , Yu Zhang

We introduce a notion of weak definability of first order structures, show that various classification-theoretic properties are or are not preserved under it, and that the properties which are preserved can also be characterized in terms of…

Logic · Mathematics 2026-05-13 Erik Walsberg

The development of domain ontological models, though being a mature research arena backed by well-established methodologies, still suffer from two key shortcomings. Firstly, the issues concerning the semantic persistency of ontology…

Artificial Intelligence · Computer Science 2022-08-30 Mayukh Bagchi

When the semantics of a sentence are not representable in a semantic parser's output schema, parsing will inevitably fail. Detection of these instances is commonly treated as an out-of-domain classification problem. However, there is also a…

Computation and Language · Computer Science 2018-08-28 James Ferguson , Janara Christensen , Edward Li , Edgar Gonzàlez

Nonlinear elliptic Neumann problems, possibly in irregular domains and with data affected by low integrability properties, are taken into account. Existence, uniqueness and continuous dependence on the data of generalized solutions are…

Analysis of PDEs · Mathematics 2015-05-13 A. Alvino , A. Cianchi , V. Maz'ya , A. Mercaldo

In this paper we consider a class of continuity equations that are conditioned to stay in general space-time domains, which is formulated as a continuum limit of interacting particle systems. Firstly, we study the well-posedness of the…

Analysis of PDEs · Mathematics 2018-06-12 Yuming Zhang

This manuscript is devoted to the study of mappings, satisfying the upper weighted Poletsky inequality. We study the case where the boundary of the domain may not be preserved under the mapping and, besides that, the majorant from the above…

Complex Variables · Mathematics 2026-03-03 Victoria Desyatka , Oleksandr Dovhopiatyi , Evgeny Sevost'yanov

The requirement of complete positivity is very often regarded as a fundamental consistency condition for the description of open quantum dynamics. We critically examine this requirement and discuss both its physical motivations and its…

Quantum Physics · Physics 2026-05-19 Fabio Benatti , Dariusz Chruściński , Saverio Pascazio

Incorporating domain knowledge into the modeling process is an effective way to improve learning accuracy. However, as it is provided by humans, domain knowledge can only be specified with some degree of uncertainty. We propose to…

Machine Learning · Computer Science 2012-05-14 Yi Mao , Guy Lebanon

We introduce a continuous domain for function spaces over topological spaces which are not core-compact. Notable examples of such topological spaces include the real line with the upper limit topology, which is used in solution of initial…

Logic in Computer Science · Computer Science 2024-12-18 Amin Farjudian , Achim Jung

Learning domain-invariant representations has become a popular approach to unsupervised domain adaptation and is often justified by invoking a particular suite of theoretical results. We argue that there are two significant flaws in such…

Machine Learning · Statistics 2019-07-05 Fredrik D. Johansson , David Sontag , Rajesh Ranganath

We propose a generalization of continuous lattices and domains through the concept of enriched closure space, defined as a closure space equipped with a preclosure operator satisfying some compatibility conditions. In this framework we are…

Logic in Computer Science · Computer Science 2017-05-16 Paul Poncet

Understanding generalization is crucial to confidently engineer and deploy machine learning models, especially when deployment implies a shift in the data domain. For such domain adaptation problems, we seek generalization bounds which are…

Machine Learning · Computer Science 2023-03-16 Adam Breitholtz , Fredrik D. Johansson

Standard Description Logics (DLs) can encode quantitative aspects of an application domain through either number restrictions, which constrain the number of individuals that are in a certain relationship with an individual, or concrete…

Logic in Computer Science · Computer Science 2025-05-28 Franz Baader , Stefan Borgwardt , Filippo De Bortoli , Patrick Koopmann

Two important notions of integrability for discrete mappings are algebraic integrability and singularity confinement, have been used for discrete mappings. Algebraic integrability is related to the existence of sufficiently many conserved…

Exactly Solvable and Integrable Systems · Physics 2015-06-26 S. Lafortune , A. Goriely

Starting from the observation that rational closure has the undesirable property of being an "all or nothing" mechanism, we here propose a multipreferential semantics, which enriches the preferential semantics underlying rational closure in…

Artificial Intelligence · Computer Science 2018-01-23 Laura Giordano , Valentina Gliozzi
‹ Prev 1 2 3 10 Next ›