相关论文: Some Remarks on Boolean Constraint Propagation

We consider mixed normed Bergman spaces on homogeneous Siegel domains. In the literature, two different approaches have been considered and several results seem difficult to be compared. In this paper we compare the results available in the…

Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…

We propose a norm of consistency for a mixed set of defeasible and strict sentences, based on a probabilistic semantics. This norm establishes a clear distinction between knowledge bases depicting exceptions and those containing outright…

The densities of small linear structures (such as arithmetic progressions) in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by…

This paper is devoted to the study of mean-field limit for systems of indistinguables particles undergoing collision processes. As formulated by Kac \cite{Kac1956} this limit is based on the {\em chaos propagation}, and we (1) prove and…

The paper is a sketch of systematic presentation of distributional limit theorems and their refinements for compound sums. When analyzing, e.g., ergodic semi-Markov systems with discrete or continuous time, this allows us to separate those…

The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often…

We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…

A probability distribution over the Boolean cube is monotone if flipping the value of a coordinate from zero to one can only increase the probability of an element. Given samples of an unknown monotone distribution over the Boolean cube, we…

We present Nonstandard Analysis by three axioms: the {\em Extension, Transfer and Saturation Principles} in the framework of the superstructure of a given infinite set. We also present several applications of this axiomatic approach to…

This is a commentary on the CP 2003 paper "Efficient cnf encoding of boolean cardinality constraints". After recalling its context, we outline a classification of Constraints with respect to their deductive power regarding General Arc…

In this article we introduce a dual of the uniform boundedness principle which does not require completeness and gives an indirect means for testing the boundedness of a set. The dual principle, although known to the analyst and despite its…

In the abstract framework of Mourre theory, the propagation of states is understood in terms of a conjugate operator $A$. A powerful estimate has long been known for Hamiltonians having a good regularity with respect to $A$ thanks to the…

A finite dimensional abstract approximation and convergence theory is developed for estimation of the distribution of random parameters in infinite dimensional discrete time linear systems with dynamics described by regularly dissipative…

We construct a probabilistic coherence measure for information sets which determines a partial coherence ordering. This measure is applied in constructing a criterion for expanding our beliefs in the face of new information. A number of…

We investigate the rate of convergence toward the Boolean extreme value distribution, which is the universal limiting law for the normalized spectral maximum of Boolean independent and identically distributed positive operators, under the…

It is proved that the Fibonacci and the Frolov point sets, which are known to be very good for numerical integration, have optimal rate of decay of dispersion with respect to the cardinality of sets. This implies that the Fibonacci and the…

We combine two notions in AECs, tameness and good $\lambda$-frames, and show that they together give a very well-behaved nonforking notion in all cardinalities. This helps to fill a longstanding gap in classification theory of tame AECs and…

We present a coherence-based probability semantics and probability propagation rules for (categorical) Aristotelian syllogisms. For framing the Aristotelian syllogisms as probabilistic inferences, we interpret basic syllogistic sentence…

The basic notions of logic-predicate logic, Peano arithmetic, incompleteness theorems, etc.-have for long been an advanced topic. In the last decades, they became more widely taught, inphilosophy, mathematics, and computer science…