Related papers: Minimal unsatisfiability and deficiency: recent de…
There have been two different methods for checking the satisfiability of feature descriptions that use the functional uncertainty device, namely~\cite{Kaplan:88CO} and \cite{Backofen:94JSC}. Although only the one in \cite{Backofen:94JSC}…
We obtain the smallest unsatisfiable formulas in subclasses of $k$-CNF (exactly $k$ distinct literals per clause) with bounded variable or literal occurrences. Smaller unsatisfiable formulas of this type translate into stronger…
We revisit the unified treatment of low-energy hadronic parity violation espoused by Desplanques, Donoghue, and Holstein to the end of an ab initio treatment of parity violation in low-energy nuclear processes within the Standard Model. We…
Market definition is an important component in the premerger investigation, but the models used in the market definition have not developed much in the past three decades since the Critical Loss Analysis (CLA) was proposed in 1989. The CLA…
I report on some recent work done in collaboration with Santi Peris and Boris Phily (hep-ph/0007338) where, using the Aleph data on vector and axial-vector spectral functions, we test simple duality properties of QCD in the large-Nc limit…
We define a family of binary outcome $n$-party $m\leq n$ settings per party Bell inequalities whose members require the least detection efficiency for their violation among all known inequalities of the same type. This gives upper bounds…
We emphasize that the recent measurements of the B^0_s - bar B^0_s mass difference Delta M_s by the CDF and D0 collaborations offer an important model independent test of minimal flavour violation (MFV). The improved measurements of the…
Counterfactual explanations can be obtained by identifying the smallest change made to a feature vector to qualitatively influence a prediction; for example, from 'loan rejected' to 'awarded' or from 'high risk of cardiovascular disease' to…
We study the two dimensional least gradient problem in convex polygonal sets in the plane, $\Omega$. We show the existence of solutions when the boundary data $f$ are attained in the trace sense. The main difficulty here is a possible…
Substitutability, interchangeability and related concepts in Constraint Programming were introduced approximately twenty years ago and have given rise to considerable subsequent research. We survey this work, classify, and relate the…
It is shown that the length of the algorithmic minimal sufficient statistic of a binary string x, either in a representation of a finite set, computable semimeasure, or a computable function, has a length larger than the computational depth…
In various areas of computer science, the problem of dealing with a set of constraints arises. If the set of constraints is unsatisfiable, one may ask for a minimal description of the reason for this unsatisifi- ability. Minimal…
We consider some second order quasilinear partial differential inequalities for real valued functions on the unit ball and find conditions under which there is a lower bound for the supremum of nonnegative solutions that do not vanish at…
Time-invariant linear dynamical system arises in many real-world applications,and its usefulness is widely acknowledged. A practical limitation with this model is that its latent dimension that has a large impact on the model capability…
We consider the incremental computation of minimal unsatisfiable cores (MUCs) of QBFs. To this end, we equipped our incremental QBF solver DepQBF with a novel API to allow for incremental solving based on clause groups. A clause group is a…
The need to measure the degree of agreement among R raters who independently classify n subjects within K nominal categories is frequent in many scientific areas. The most popular measures are Cohen's kappa (R = 2), Fleiss' kappa, Conger's…
The minimum aberration criterion has been frequently used in the selection of fractional factorial designs with nominal factors. For designs with quantitative factors, however, level permutation of factors could alter their geometrical…
In a recent work, Coronel et al. initiated the study of the relation between the diversity-multiplexing tradeoff (DMT) performance of a multiuser multiple-input multiple-output (MU-MIMO) lattice code and the rate of the decay of the…
In this note, we establish the hardness of approximation of the problem of computing the minimal size of a $\delta$-sufficient reason for decision trees.
Crawford's et al. (2021) article on estimation of discrete choice models with unobserved or latent consideration sets, presents a unified framework to address the problem in practice by using "sufficient sets", defined as a combination of…