English
Related papers

Related papers: Stable Independance and Complexity of Representati…

200 papers

We thoroughly study a generalized version of the classic Stable Marriage and Stable Roommates problems where agents may share partners. We consider two prominent stability concepts: ordinal stability [Aharoni and Fleiner, Journal of…

Computer Science and Game Theory · Computer Science 2020-11-25 Jiehua Chen , Sanjukta Roy , Manuel Sorge

A lattice-theoretic framework is introduced that permits the study of the conditional independence (CI) implication problem relative to the class of discrete probability measures. Semi-lattices are associated with CI statements and a…

Artificial Intelligence · Computer Science 2014-08-12 Mathias Niepert , Dirk Van Gucht , Marc Gyssens

A lattice-theoretic framework is introduced that permits the study of the conditional independence (CI) implication problem relative to the class of discrete probability measures. Semi-lattices are associated with CI statements and a…

Artificial Intelligence · Computer Science 2008-11-03 Mathias Niepert , Dirk Van Gucht , Marc Gyssens

In two earlier papers we derived congruence formats with regard to transition system specifications for weak semantics on the basis of a decomposition method for modal formulas. The idea is that a congruence format for a semantics must…

Logic in Computer Science · Computer Science 2019-08-20 Wan Fokkink , Rob van Glabbeek , Bas Luttik

When a system has more than one stable state, how can the stability of these states be compared? This deceptively simple question has important consequences for ecosystems, because systems with alternative stable states can undergo dramatic…

Populations and Evolution · Quantitative Biology 2015-10-26 Ben C. Nolting , Karen C. Abbott

The formal analysis of automated systems is an important and growing industry. This activity routinely requires new verification frameworks to be developed to tackle new programming features, or new considerations (bugs of interest). Often,…

Logic in Computer Science · Computer Science 2026-02-17 Paul Brunet

This paper introduces epistemic graphs as a generalization of the epistemic approach to probabilistic argumentation. In these graphs, an argument can be believed or disbelieved up to a given degree, thus providing a more fine--grained…

Artificial Intelligence · Computer Science 2020-01-15 Anthony Hunter , Sylwia Polberg , Matthias Thimm

This paper discuses multiple Bayesian networks representation paradigms for encoding asymmetric independence assertions. We offer three contributions: (1) an inference mechanism that makes explicit use of asymmetric independence to speed up…

Artificial Intelligence · Computer Science 2015-05-19 Dan Geiger , David Heckerman

Continual learning systems are increasingly deployed in environments where retraining or reset is infeasible, yet many approaches emphasize task performance rather than the evolution of internal representations over time. In this work, we…

Machine Learning · Computer Science 2026-02-24 Vishnu Subramanian

We provide a problem definition of the stable marriage problem for a general number of parties $p$ under a natural preference scheme in which each person has simple lists for the other parties. We extend the notion of stability in a natural…

Computer Science and Game Theory · Computer Science 2015-09-11 Jared D. Lichtman

We consider a monopolistic seller in a market that may be segmented. The surplus of each consumer in a segment depends on the price that the seller optimally charges, which depends on the set of consumers in the segment. We study which…

Theoretical Economics · Economics 2022-10-25 Nima Haghpanah , Ron Siegel

We show that extremely simple systems of a not too large number of particles can be simultane- ously thermally stable and complex. To such an end, we extend the statistical complexity's notion to simple configurations of non-interacting…

Statistical Mechanics · Physics 2018-02-23 F. Pennini , A. Plastino

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

We consider a random network of nonlinear maps exhibiting a wide range of local dynamics, with the links having normally distributed interaction strengths. The stability of such a system is examined in terms of the asymptotic fraction of…

Adaptation and Self-Organizing Systems · Physics 2009-11-10 Sitabhra Sinha , Sudeshna Sinha

Extensively evaluating the capabilities of (large) language models is difficult. Rapid development of state-of-the-art models induce benchmark saturation, while creating more challenging datasets is labor-intensive. Inspired by the recent…

Computation and Language · Computer Science 2025-06-02 Alan Sun

The semigraphoid closure of every couple of CI-statements (GI=conditional independence) is a stochastic CI-model. As a consequence of this result it is shown that every probabilistically sound inference rule for CI-model, having at most two…

Artificial Intelligence · Computer Science 2013-02-28 Milan Studeny

It is shown that the ability of the interval probability representation to capture epistemological independence is severely limited. Two events are epistemologically independent if knowledge of the first event does not alter belief (i.e.,…

Artificial Intelligence · Computer Science 2013-02-18 Lonnie Chrisman

The global availability of communication services makes it possible to interconnect independently developed systems, called constituent systems, to provide new synergistic services and more efficient economic processes. The characteristics…

Software Engineering · Computer Science 2013-11-15 Hermann Kopetz

In this paper, we investigate a continuous family of notions of independence which interpolates between the classical and free ones for non-commutative random variables. These notions are related to the liberation process introduced by D.…

Probability · Mathematics 2008-11-28 Florent Benaych-Georges , Thierry Lévy

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