English
Related papers

Related papers: Convolution, Separation and Concurrency

200 papers

Reasoning with quantifier expressions in natural language combines logical and arithmetical features, transcending strict divides between qualitative and quantitative. Our topic is this cooperation of styles as it occurs in common…

Logic · Mathematics 2025-07-08 Johan van Benthem , Thomas Icard

Fusions are a simple way of combining logics. For normal modal logics, fusions have been investigated in detail. In particular, it is known that, under certain conditions, decidability transfers from the component logics to their fusion.…

Artificial Intelligence · Computer Science 2011-06-10 F. Baader , C. Lutz , H. Sturm , F. Wolter

We propose a framework for probability aggregation based on propositional probability logic. Unlike conventional judgment aggregation, which focuses on static rationality, our model addresses dynamic rationality by ensuring that collective…

Artificial Intelligence · Computer Science 2025-08-27 Polina Gordienko , Christoph Jansen , Thomas Augustin , Martin Rechenauer

Three postulates are discussed: first that well-defined properties cannot be assigned to an isolated system, secondly that quantum unitary evolution is atemporal, and thirdly that some physical processes are never reversed. It is argued…

Quantum Physics · Physics 2009-11-13 Andrew M. Steane

What is Sequence Algebra? This is a question that any teacher or student of mathematics or computer science can engage with. Sequences are in Calculus, Combinatorics, Statistics and Computation. They are foundational, a step up from number…

Combinatorics · Mathematics 2019-03-01 Kieran Clenaghan

These notes build an introduction to Convolution Quadrature techniques applied to linear convolutions and convolution equations with a bias to problems related to wave propagation. The notes are self-contained and emphasize algorithmic…

Numerical Analysis · Mathematics 2014-07-02 Matthew Hassell , Francisco-Javier Sayas

The notion of a duality between two derived functors as well as an extension theorem for derived functors to larger categories in which they need not be defined is introduced. These ideas are then applied to extend and study the coext…

Rings and Algebras · Mathematics 2014-02-19 Anastasis Kratsios

We study decompositions of NVALUE, a global constraint that can be used to model a wide range of problems where values need to be counted. Whilst decomposition typically hinders propagation, we identify one decomposition that maintains a…

Artificial Intelligence · Computer Science 2009-09-18 Christian Bessiere , George Katsirelos , Nina Narodytska , Claude-Guy Quimper , Toby Walsh

We introduce an extension of first-order logic that comes equipped with additional predicates for reasoning about an abstract state. Sequents in the logic comprise a main formula together with pre- and postconditions in the style of Hoare…

Logic in Computer Science · Computer Science 2024-08-07 Thomas Powell

Logistic equations play a pivotal role in the study of any non linear evolution process exhibiting growth and saturation. The interest for the phenomenology, they rule, goes well beyond physical processes and cover many aspects of ecology,…

Classical Analysis and ODEs · Mathematics 2023-08-14 G. Dattoli , R. Garra

The dynamical systems found in Nature are rarely isolated. Instead they interact and influence each other. The coupling functions that connect them contain detailed information about the functional mechanisms underlying the interactions and…

Adaptation and Self-Organizing Systems · Physics 2017-11-15 Tomislav Stankovski , Tiago Pereira , Peter V. E. McClintock , Aneta Stefanovska

This paper surveys some recent developments towards a dynamic quantum logic and outlines its explicite construction -- some analogies and contrasts with other logics of dynamics are indicated. Abstract: The development of ``(static)…

Logic · Mathematics 2007-05-23 Bob Coecke , David J. Moore , Sonja Smets

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

Logic in Computer Science · Computer Science 2010-10-01 Alwen Tiu , Alberto Momigliano

A logical model of spatiotemporal structures is pictured as a succession of processes in time. One usual way to formalize time structure is to assume the global existence of time points and then collect some of them to form time intervals…

Logic · Mathematics 2009-11-13 Kenji Tokuo

Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components, as well as communications between these components. Moreover, to model concurrent and…

Quantum Physics · Physics 2007-05-23 Marie Lalire

A non-statistical theory of continuous, but irreversible, evolution can be constructed in terms of the Cartan calculus. The fundamental postulate, for an evolutionary theory which admits irreversible processes, is that the topology of the…

Mathematical Physics · Physics 2007-05-23 R. M. Kiehn

Vanilla convolutional neural networks are known to provide superior performance not only in image recognition tasks but also in natural language processing and time series analysis. One of the strengths of convolutional layers is the…

Machine Learning · Computer Science 2019-05-09 Gavneet Singh Chadha , Jan Niclas Reimann , Andreas Schwung

This document will review the most prominent proposals using multilayer convolutional architectures. Importantly, the various components of a typical convolutional network will be discussed through a review of different approaches that base…

Computer Vision and Pattern Recognition · Computer Science 2018-03-26 Isma Hadji , Richard P. Wildes

We propose a new formalism for specifying and reasoning about problems that involve heterogeneous "pieces of information" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence…

Logic in Computer Science · Computer Science 2016-12-30 Eugenia Ternovska

In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension…

Logic in Computer Science · Computer Science 2021-10-20 Samson Abramsky , Dan Marsden
‹ Prev 1 8 9 10 Next ›