相关论文: Some Remarks on Boolean Constraint Propagation

Since their introduction, Boolean networks have been traditionally studied in view of their rich dynamical behavior under different update protocols and for their qualitative analogy with cell regulatory networks. More recently, tools…

In this paper, a link between monotonicity of deterministic dynamical systems and propagation of order by Markov processes is established. The order propagation has received considerable attention in the literature, however, this notion is…

Constraint propagation is a general algorithmic approach for pruning the search space of a CSP. In a uniform way, K. R. Apt has defined a computation as an iteration of reduction functions over a domain. He has also demonstrated the need…

This paper explores algorithms for processing probabilistic and deterministic information when the former is represented as a belief network and the latter as a set of boolean clauses. The motivating tasks are 1. evaluating beliefs networks…

In this article, one investigates in a very general frame mass transference principles from ball to arbitrary open sets when the sequence of balls is distributed according to a finite measure. As an application of the main theorem, a mass…

We show that global constraints on finite domains like all-different can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reformulations offer a number of other advantages beyond providing…

We show that some common and important global constraints like ALL-DIFFERENT and GCC can be decomposed into simple arithmetic constraints on which we achieve bound or range consistency, and in some cases even greater pruning. These…

A natural and established way to restrict the constraint satisfaction problem is to fix the relations that can be used to pose constraints; such a family of relations is called a constraint language. In this article, we study arc…

Logic rules and inference are fundamental in computer science and have been studied extensively. However, prior semantics of logic languages can have subtle implications and can disagree significantly, on even very simple programs,…

Linear rules have played an increasing role in structural proof theory in recent years. It has been observed that the set of all sound linear inference rules in Boolean logic is already coNP-complete, i.e. that every Boolean tautology can…

This work is concerned with the broad question of propagation of regularity for smooth solutions to non-linear Vlasov equations. For a class of equations (that includes Vlasov-Poisson and relativistic Vlasov-Maxwell), we prove that higher…

This paper addresses uncertainty propagation on unimodular matrix Lie groups that have a surjective exponential map. We derive the exact formula for the propagation of mean and covariance in a continuous-time setting from the governing…

We propose a mathematical framework to systematically explore the propagation properties of a class of continuous in time nonlinear neural network models comprising a hierarchy of processing areas, mutually connected according to the…

We propose AllDiffPrecedence, a new global constraint that combines together an AllDifferent constraint with precedence constraints that strictly order given pairs of variables. We identify a number of applications for this global…

This paper proposes some simple propagation rules which give rise to new binary constant-weight codes.

Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a propositional statement,atomic propositions may yield different Boolean values at repeated…

In this paper, we obtain a new estimate for uniform integrability under sublinear expectations. Based on this, we establish the limit theorems under nonlinear expectations dominated by sublinear expectations through tightness, and the limit…

We discuss old and new results on the mathematical justification of Boltzmann's equation. The classical result along these lines is a theorem which was proven by Lanford in the 1970s. This paper is naturally divided into three parts. I.…

We establish a general "boundedness implies convergence" principle for a family of evolving Riemannian metrics. We then apply this principle to collapsing Calabi-Yau metrics and normalized K\"ahler-Ricci flows on torus fibered minimal…

Power law or generalized polynomial regressions with unknown real-valued exponents and coefficients, and weakly dependent errors, are considered for observations over time, space or space--time. Consistency and asymptotic normality of…