English
Related papers

Related papers: A Note on the Expressiveness of BIP

200 papers

A weak invariant associated with a master equation is characterized in such a way that its spectrum is not constant in time but its expectation value is conserved under time evolution generated by the master equation. Here, an intriguing…

Quantum Physics · Physics 2019-07-08 Sumiyoshi Abe , Congjie Ou

Compositionality in knowledge and language--the ability to represent complex concepts as a combination of simpler ones--is a hallmark of human cognition and communication. Despite recent advances, deep neural networks still struggle to…

Machine Learning · Computer Science 2025-12-01 Rafael Elberg , Felipe del Rio , Mircea Petrache , Denis Parra

Psi-calculi is a parametric framework for extensions of the pi-calculus with data terms and arbitrary logics. In this framework there is no direct way to represent action priorities, where an action can execute only if all other enabled…

Logic in Computer Science · Computer Science 2014-08-08 Johannes Åman Pohjola , Joachim Parrow

We present several philosophical ideas emerging from the studies of complex systems. We make a brief introduction to the basic concepts of complex systems, for then defining "abstraction levels". These are useful for representing…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Carlos Gershenson

Fix a weakly minimal (i.e., superstable $U$-rank $1$) structure $\mathcal{M}$. Let $\mathcal{M}^*$ be an expansion by constants for an elementary substructure, and let $A$ be an arbitrary subset of the universe $M$. We show that all…

Logic · Mathematics 2022-03-08 Gabriel Conant , Michael C. Laskowski

In concurrency theory, weak bisimilarity is often used to relate processes exhibiting the same observable behaviour. The probabilistic environment gives rise to several generalisations; we study the infinitary semantics, which abstracts…

Logic in Computer Science · Computer Science 2018-10-18 Nick Fischer , Rob van Glabbeek

The traditional abstract domain framework for imperative programs suffers from several shortcomings; in particular it does not allow precise symbolic abstractions. To solve these problems, we propose a new abstract interpretation framework,…

Software Engineering · Computer Science 2018-01-01 Matthieu Lemerre , Sébastien Bardin

This paper has two parts. In the first part we recall the important role that weak proregularity of an ideal in a commutative ring has in derived completion and in adic flatness. We also introduce the new concepts of idealistic and…

Commutative Algebra · Mathematics 2021-05-10 Amnon Yekutieli

Standard abstract model checking relies on abstract Kripke structures which approximate concrete models by gluing together indistinguishable states, namely by a partition of the concrete state space. Strong preservation for a specification…

Logic in Computer Science · Computer Science 2007-05-23 Francesco Ranzato , Francesco Tapparo

The notion of argumentation and the one of belief stand in a problematic relation to one another. On the one hand, argumentation is crucial for belief formation: as the outcome of a process of arguing, an agent might come to (justifiably)…

Logic in Computer Science · Computer Science 2021-06-23 Alfredo Burrieza , Antonio Yuste-Ginel

This is a sequel paper of arXiv:1306.1466 in which we study the comodules over a regular weak multiplier bialgebra over a field, with a full comultiplication. Replacing the usual notion of coassociative coaction over a (weak) bialgebra, a…

Quantum Algebra · Mathematics 2014-03-12 Gabriella Böhm

Economic complexity reflects the amount of knowledge that is embedded in the productive structure of an economy. It resides on the premise of hidden capabilities - fundamental endowments underlying the productive structure. In general,…

The notion of class is ubiquitous in computer science and is central in many formalisms for the representation of structured knowledge used both in knowledge representation and in databases. In this paper we study the basic issues…

Artificial Intelligence · Computer Science 2011-05-30 D. Calvanese , M. Lenzerini , D. Nardi

In order to train networks for verified adversarial robustness, it is common to over-approximate the worst-case loss over perturbation regions, resulting in networks that attain verifiability at the expense of standard performance. As shown…

In a weak measurement the real and imaginary parts of a weak value participate in the shifts of the complementary variables of a pointer. While the real part represents the value of an observable in the limit of zero measurement strength,…

Quantum Physics · Physics 2019-09-12 Kazuhiro Yokota

Weak values are traditionally obtained using a weak interaction between the measured system and a pointer state. It has, however, been pointed out that weak coupling can be replaced by a carefully tailored strong interaction. This paper…

Quantum Physics · Physics 2020-06-24 Jan Roik , Karel Lemr , Antonín Černoch , Karol Bartkiewicz

We present a completeness result for the implicit fragment of justification stit logic. Although this fragment allows for no strongly complete axiomatization, we show that a restricted form of strong completeness (subsuming weak…

Logic · Mathematics 2017-05-26 Grigory K. Olkhovikov

Expressing the polarity of sentiment as 'positive' and 'negative' usually have limited scope compared with the intensity/degree of polarity. These two tasks (i.e. sentiment classification and sentiment intensity prediction) are closely…

Computation and Language · Computer Science 2020-02-07 Kumar Shikhar Deep , Md Shad Akhtar , Asif Ekbal , Pushpak Bhattacharyya

Interpretable machine learning has gained much attention recently. Briefness and comprehensiveness are necessary in order to provide a large amount of information concisely when explaining a black-box decision system. However, existing…

Machine Learning · Computer Science 2019-10-04 Seojin Bang , Pengtao Xie , Heewook Lee , Wei Wu , Eric Xing

Shape types are a general concept of process types which work for many process calculi. We extend the previously published Poly* system of shape types to support name restriction. We evaluate the expressiveness of the extended system by…

Logic in Computer Science · Computer Science 2010-04-01 Jan Jakubuv , J. B. Wells
‹ Prev 1 8 9 10 Next ›