English
Related papers

Related papers: Equational Characterization of Covariant-Contravar…

200 papers

This paper develops a process-based account of scientific explanation that reconceives grounding in terms of stabilisation. Grounding theories capture hierarchical dependence but lack criteria for when explanations remain adequate under…

History and Philosophy of Physics · Physics 2026-01-05 Jonathon Sendall

Control systems are usually modeled by differential equations describing how physical phenomena can be influenced by certain control parameters or inputs. Although these models are very powerful when dealing with physical phenomena, they…

Optimization and Control · Mathematics 2008-01-14 Giordano Pola , Antoine Girard , Paulo Tabuada

Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing dependencies induced by quantifications in first-order…

Logic in Computer Science · Computer Science 2009-08-28 Samuel Mimram

Complex systems can be modelled at various levels of detail. Ideally, causal models of the same system should be consistent with one another in the sense that they agree in their predictions of the effects of interventions. We formalise…

We describe an approximate statistical model for the sample variance distribution of the non-linear matter power spectrum that can be calibrated from limited numbers of simulations. Our model retains the common assumption of a multivariate…

Domain generalization aims to learn knowledge invariant across different distributions while semantically meaningful for downstream tasks from multiple source domains, to improve the model's generalization ability on unseen target domains.…

Machine Learning · Computer Science 2021-06-03 Yunqi Wang , Furui Liu , Zhitang Chen , Qing Lian , Shoubo Hu , Jianye Hao , Yik-Chung Wu

This dissertation establishes the contexture theory to mathematically characterize the mechanism of representation learning, or pretraining. Despite the remarkable empirical success of foundation models, it is not very clear what…

Machine Learning · Computer Science 2025-04-29 Runtian Zhai

This note sketches the extension of the basic characterisation theorems as the bisimulation-invariant fragment of first-order logic to modal logic with graded modalities and matching adaptation of bisimulation. We focus on showing…

Logic · Mathematics 2023-07-19 Martin Otto

Game semantics aim at describing the interactive behaviour of proofs by interpreting formulas as games on which proofs induce strategies. In this article, we introduce a game semantics for a fragment of first order propositional logic. One…

Logic in Computer Science · Computer Science 2008-12-18 Samuel Mimram

This study proposes revised axioms for defining inconsistency indicators in pairwise comparisons. It is based on the new findings that "PC submatrix cannot have a worse inconsistency indicator than the PC matrix containing it" and that…

Other Computer Science · Computer Science 2023-07-25 W. W. Koczkodaj , J. -P. Magnot

The recent attention towards research and development in cyber-physical energy systems has introduced the necessity of emerging multi-domain co-simulation tools. Different educational, research and industrial efforts have been set to tackle…

Other Computer Science · Computer Science 2018-11-19 Cornelius Steinbrink , Florian Schlögl , Davood Babazadeh , Sebastian Lehnhoff , Sebastian Rohjans , Anand Narajan

The questions we raise in this letter are as follows: What is the most general representation of a quantum state at a single point in time? Can we adapt the current formalisms to situations where the order of quantum operations is…

Quantum Physics · Physics 2024-06-21 Onur Pusuluk , Zafer Gedik , Vlatko Vedral

Quantified formulas pose a significant challenge for Satisfiability Modulo Theories (SMT) solvers due to their inherent undecidability. Existing instantiation techniques, such as e-matching, syntax-guided, model-based, conflict-based, and…

Artificial Intelligence · Computer Science 2025-08-20 Jan Jakubův , Mikoláš Janota

We present covariant quantization rules for nonsingular finite dimensional classical theories with flat and curved configuration spaces. In the beginning, we construct a family of covariant quantizations in flat spaces and Cartesian…

High Energy Physics - Theory · Physics 2017-09-05 J. Assirati , D. M. Gitman

In the development of operational semantics of concurrent systems, a key decision concerns the adoption of a suitable notion of execution model, which basically amounts to choosing a class of partial orders according to which events are…

Formal Languages and Automata Theory · Computer Science 2024-07-19 Maciej Koutny , Lukasz Mikulski

Variational analysis provides the theoretical foundations and practical tools for constructing optimization algorithms without being restricted to smooth or convex problems. We survey the central concepts in the context of a concrete but…

Optimization and Control · Mathematics 2025-04-08 Johannes O. Royset

It is widely believed that engineering a model to be invariant/equivariant improves generalisation. Despite the growing popularity of this approach, a precise characterisation of the generalisation benefit is lacking. By considering the…

Machine Learning · Statistics 2021-07-07 Bryn Elesedy , Sheheryar Zaidi

In this paper we propose definitions of equivalence via stochastic bisimulation and of equivalence of stochastic external behavior for the class of discrete-time stochastic linear control systems with possibly degenerate normally…

Optimization and Control · Mathematics 2016-11-28 Giordano Pola , Costanzo Manes , Arjan J. van der Schaft , Maria Domenica Di Benedetto

Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…

Discrete Mathematics · Computer Science 2015-12-02 Arnaud Carayol , Zoltan Esik

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

Logic in Computer Science · Computer Science 2010-11-23 Facundo Carreiro