English
Related papers

Related papers: A Note on the Expressiveness of BIP

200 papers

In earlier work, we introduced the framework of language-based decisions, the core idea of which was to modify Savage's classical decision-theoretic framework by taking actions to be descriptions in some language, rather than functions from…

Logic in Computer Science · Computer Science 2023-07-18 Adam Bjorndahl , Joseph Y. Halpern

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

Artificial Intelligence · Computer Science 2015-04-21 Ryuta Arisaka

In dialogical argumentation it is often assumed that the involved parties always correctly identify the intended statements posited by each other, realize all of the associated relations, conform to the three acceptability states (accepted,…

Artificial Intelligence · Computer Science 2017-12-11 Sylwia Polberg , Anthony Hunter

Emergent patterns in complex systems are related to many intriguing phenomena in modern science and philosophy. Several conceptions such as weak, strong and robust emergence have been proposed to emphasize different epistemological and…

Physics and Society · Physics 2016-10-11 Alberto Pascual-García

Empirical complex systems can be characterized not only by pairwise interactions, but also by higher-order (group) interactions influencing collective phenomena, from metabolic reactions to epidemics. Nevertheless, higher-order networks'…

Physics and Society · Physics 2026-01-01 Maxime Lucas , Luca Gallo , Arsham Ghavasieh , Federico Battiston , Manlio De Domenico

Based on a variation of the BIP operational semantics using the offer predicate introduced in our previous work, we extend the algebras used to model glue operators in BIP to encompass priorities. This extension uses the Algebra of Causal…

Logic in Computer Science · Computer Science 2013-10-18 Eduard Baranov , Simon Bliudze

We review a minimum set of notions from our previous paper on structural properties of SAT at arXiv:0802.1790 that will allow us to define and discuss the "complete internal independence" of a decision problem. This property is strictly…

Computational Complexity · Computer Science 2008-05-21 Silvano Di Zenzo

Independence -- the study of what is relevant to a given problem of reasoning -- has received an increasing attention from the AI community. In this paper, we consider two basic forms of independence, namely, a syntactic one and a semantic…

Artificial Intelligence · Computer Science 2011-06-24 J. Lang , P. Liberatore , P. Marquis

Inspired by Hintikka's treatment of question embedding verbs in [8] and the variations of noncontingency operator, we propose a logic with strong noncontingency operator $\blacktriangle$ as the only primitive modality. A proposition is…

Logic in Computer Science · Computer Science 2019-09-18 Jie Fan

In the literature, essence is formalized in two different ways, either de dicto, or de re. Following \cite{Marcos:2005}, we adopt its de dicto formalization: a formula is essential, if once it is true, it is necessarily true; otherwise, it…

Logic in Computer Science · Computer Science 2015-06-08 Jie Fan

We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…

Geometric Topology · Mathematics 2012-03-13 Justin Malestein , Louis Theran

When explaining the decisions of deep neural networks, simple stories are tempting but dangerous. Especially in computer vision, the most popular explanation approaches give a false sense of comprehension to its users and provide an overly…

Machine Learning · Computer Science 2021-09-17 Matthias Kirchler , Martin Graf , Marius Kloft , Christoph Lippert

Labeling each instance in a large dataset is extremely labor- and time- consuming . One way to alleviate this problem is active learning, which aims to which discover the most valuable instances for labeling to construct a powerful…

Machine Learning · Computer Science 2018-03-07 Xi Fang , Zengmao Wang , Xinyao Tang , Chen Wu

We introduce composition in the function-behaviour-structure framework for design, as described by John Gero, in order to deal with complexity. We do this by connecting the frameworks for the design of several models, in which one is…

Software Engineering · Computer Science 2015-04-03 Bob Diertens

We propose active object languages as a development tool for formal system models of distributed systems. Additionally to a formalization based on a term rewriting system, we use established Software Engineering concepts, including software…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-10-08 Eduard Kamburjan , Reiner Hähnle

"Emergence", the phenomenon where a complex system displays properties, behaviours, or dynamics not trivially reducible to its constituent elements, is one of the defining properties of complex systems. Recently, there has been a concerted…

Information Theory · Computer Science 2023-01-11 Thomas F. Varley

In this paper, we introduce a new generalization of weakly prime ideals called $I$-prime. Suppose $R$ is a commutative ring with identity and $I$ a fixed ideal of $R$. A proper ideal $P$ of $R$ is $I$-prime if for $a, b \in R$ with $ab \in…

Commutative Algebra · Mathematics 2017-01-24 Ismael Akray

We propose a new paradigm for Belief Change in which the new information is represented as sets of models, while the agent's body of knowledge is represented as a finite set of formulae, that is, a finite base. The focus on finiteness is…

Logic in Computer Science · Computer Science 2023-09-13 Ricardo Guimarães , Ana Ozaki , Jandson S. Ribeiro

Bialgebroids, separable bialgebroids, and weak Hopf algebras are compared from a categorical point of view. Then properties of weak Hopf algebras and their applications to finite index and finite depth inclusions of von Neumann algebras are…

Quantum Algebra · Mathematics 2007-05-23 K. Szlachanyi

Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems. We establish several…

Optimization and Control · Mathematics 2021-10-26 Miles Lubin , Juan Pablo Vielma , Ilias Zadik