English
Related papers

Related papers: Ockham's razor and reasoning about information flo…

200 papers

For the many journalists who use data and computation to report the news, data wrangling is an integral part of their work.Despite an abundance of literature on data wrangling in the context of enterprise data analysis, little is known…

Human-Computer Interaction · Computer Science 2020-09-24 Stephen Kasica , Charles Berret , Tamara Munzner

The partial information decomposition (PID) and its extension integrated information decomposition ($\Phi$ID) are promising frameworks to investigate information phenomena involving multiple variables. An important limitation of these…

Information Theory · Computer Science 2024-10-10 Abel Jansma , Pedro A. M. Mediano , Fernando E. Rosas

Information flow is central to contemporary accounts of cognition, yet its physical basis in living neural matter remains poorly specified. Here, we develop a multiscale resource-theoretical framework motivated by the \textit{thermocoherent…

Neurons and Cognition · Quantitative Biology 2026-04-14 Onur Pusuluk

With the rise of XML as a standard for representing business data, XML data warehouses appear as suitable solutions for Web-based decision-support applications. In this context, it is necessary to allow OLAP analyses over XML data cubes…

Databases · Computer Science 2008-09-17 Marouane Hachicha , Hadj Mahboubi , Jérôme Darmont

To model biological systems using networks, it is desirable to allow more than two levels of expression for the nodes and to allow the introduction of parameters. Various modeling and simulation methods addressing these needs using Boolean…

Molecular Networks · Quantitative Biology 2014-04-23 Yi Ming Zou

In this short note we relate some known properties of propositional calculus to purely algebraic considerations of a Boolean algebra. Classes of formulas of propositional calculus are considered as elements of a Boolean algebra. As such…

Logic · Mathematics 2009-06-12 Bernd R. Schuh

In many non-cooperative settings, agents often possess useful information that provide an advantage over their opponent(s), but acting on such information too frequently can lead to detection. I develop a simple framework to analyze such a…

General Economics · Economics 2024-12-17 Xiaoming Wang

This article is a brief personal account of the past, present, and future of algorithmic randomness, emphasizing its role in inductive inference and artificial intelligence. It is written for a general audience interested in science and…

Information Theory · Computer Science 2012-02-10 Marcus Hutter

Common knowledge/belief in rationality is the traditional standard assumption in analysing interaction among agents. This paper proposes a graph-based language for capturing significantly more complicated structures of higher-order beliefs…

Artificial Intelligence · Computer Science 2024-12-13 Qi Shi , Pavel Naumov

This work proposes an algebraic model for classical information theory. We first give an algebraic model of probability theory. Information theoretic constructs are based on this model. In addition to theoretical insights provided by our…

Information Theory · Computer Science 2010-06-03 Manas K Patra , Samuel L Braunstein

In computer algebra there are different ways of approaching the mathematical concept of functions, one of which is by defining them as solutions of differential equations. We compare different such approaches and discuss the occurring…

Symbolic Computation · Computer Science 2013-06-19 Frédéric Chyzak , James Davenport , Christoph Koutschan , Bruno Salvy

Occam's Razor tells us to pick the simplest model that fits our observations. In order to make sense of his process mathematically, we interpret it in the context of posets of functions. Our approach leads to some unusual new combinatorial…

Combinatorics · Mathematics 2015-04-29 William Ralph

We propose a system of information-theoretic axioms from which we derive the formalism of quantum theory. Part I is devoted to the conceptual foundations of the information-theoretic approach. We argue that this approach belongs to the…

Quantum Physics · Physics 2016-09-08 Alexei Grinbaum

Recent work has shown that some common machine learning classifiers can be compiled into Boolean circuits that have the same input-output behavior. We present a theory for unveiling the reasons behind the decisions made by Boolean…

Artificial Intelligence · Computer Science 2020-04-21 Adnan Darwiche , Auguste Hirth

We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…

Logic · Mathematics 2026-01-16 Georgi Nakov , Davide Emilio Quadrellaro

We highlight the underlying category-theoretic structure of measures of information flow. We present an axiomatic framework in which communication systems are represented as morphisms, and information flow is characterized by its behavior…

Category Theory · Mathematics 2008-07-21 Benjamin Allen

The development of logic has largely been through the 'deductive' paradigm: conclusions are inferred from established premisses. However, the use of logic in the context of both human and machine reasoning is typically through the dual…

Logic in Computer Science · Computer Science 2025-04-29 Alexander V. Gheorghiu , David J. Pym

Research in discourse processing has identified two representational requirements for discourse planning systems. First, discourse plans must adequately represent the intentional structure of the utterances they produce in order to enable a…

cmp-lg · Computer Science 2008-02-03 R. Michael Young , Johanna D. Moore

Multivariate information decompositions hold promise to yield insight into complex systems, and stand out for their ability to identify synergistic phenomena. However, the adoption of these approaches has been hindered by there being…

Information Theory · Computer Science 2020-12-02 Fernando Rosas , Pedro Mediano , Borzoo Rassouli , Adam Barrett

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…

Logic in Computer Science · Computer Science 2009-03-23 Mehrnoosh Sadrzadeh , Roy Dyckhoff