相关论文: Compound conditionals, Fr\'echet-Hoeffding bounds,…
The Satisfiability Modulo Theories (SMT) issue concerns the satisfiability of formulae from multiple background theories, usually expressed in the language of first-order predicate logic with equality. SMT solvers are often based on…
This paper explores goal-directed proof search in first-order multi-modal logic. The key issue is to design a proof system that respects the modularity and locality of assumptions of many modal logics. By forcing ambiguities to be…
We develope the framework of transitional conditional independence. For this we introduce transition probability spaces and transitional random variables. These constructions will generalize, strengthen and unify previous notions of…
We introduce a compositional framework for convex analysis based on the notion of convex bifunction of Rockafellar. This framework is well-suited to graphical reasoning, and exhibits rich dualities such as the Legendre-Fenchel transform,…
A common assumption in causal inference from observational data is that there is no hidden confounding. Yet it is, in general, impossible to verify this assumption from a single dataset. Under the assumption of independent causal mechanisms…
We study the connection between conjugations of a special kind of dynamical systems, called P-configurations, and solutions to homogeneous Cauchy type functional equations. We find that any two regular P-configurations are conjugate by a…
In flowchart languages, predicates play an interesting double role. In the textual representation, they are often presented as conditions, i.e., expressions which are easily combined with other conditions (often via Boolean combinators) to…
The Schr\"odinger equation and Bloch theorem are applied to examine a system of protons confined within a periodic potential, accounting for deviations from ideal harmonic behavior due to real-world conditions like truncated and…
We analyze the behavior of the first few cumulant in an array with a small number of coupled identical particles. Desai and Zwanzig (J. Stat. Phys., {\bf 19}, 1 (1978), p. 1) studied noisy arrays of nonlinear units with global coupling and…
Verification problems of programs written in various paradigms (such as imperative, logic, concurrent, functional, and object-oriented ones) can be reduced to problems of solving Horn clause constraints on predicate variables that represent…
We study an analogue of the Erd\H{o}s-S\'os forbidden intersection problem, for families of linear maps. If $V$ and $W$ are vector spaces over the same field, we say a family $\mathcal{F}$ of linear maps from $V$ to $W$ is…
The Boolean satisfiability problem (SAT) is a well-known example of monotonic reasoning, of intense practical interest due to fast solvers, complemented by rigorous fine-grained complexity results. However, for non-monotonic reasoning,…
In this paper, we introduce a nonlinear optimization problem whose objective function is the convex log-sum-exp function and the feasible region is defined as a system of fuzzy relational inequalities (FRI) defined by the Lukasiewicz…
This paper is concerned with inference in the linear model with dyadic data. Dyadic data is data that is indexed by pairs of "units", for example trade data between pairs of countries. Because of the potential for observations with a unit…
In this article, working in the spirit of the classical Arrovian models in the fuzzy setting and their possible extensions, we go deeper into the study of some type of decompositions defined by t-norms and t-conorms. This allows us to…
A smooth function of the second moments of $N$ continuous variables gives rise to an uncertainty relation if it is bounded from below. We present a method to systematically derive such bounds by generalizing an approach applied previously…
In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to…
It is known that not only classical semantics but also intuitionistic Kripke semantics can be generalized so that it can treat arbitrary propositional connectives characterized by truth tables, or truth functions. In our previous work, it…
We propose a generalized win fraction regression framework for prioritized composite survival outcomes. The framework models the conditional win fraction through a chosen link function (including identity, logit, or probit), thereby…
Two families $\mathcal{F}$ and $\mathcal{G}$ are called cross-intersecting if for every $F\in \mathcal{F}$ and $G\in \mathcal{G}$, the intersection $F\cap G$ is non-empty. For any positive integers $n$ and $k$, let $\binom{[n]}{k}$ denote…