相关论文: Combined Covers and Beth Definability (Extended Ve…

In model-based testing (MBT) we may have to deal with a non-deterministic model, e.g. because abstraction was applied, or because the software under test itself is non-deterministic. The same test case may then trigger multiple possible…

We consider the two-fold problem of representing collective beliefs and aggregating these beliefs. We propose modular, transitive relations for collective beliefs. They allow us to represent conflicting opinions and they have a clear…

Incompatibility is a feature of quantum theory that sets it apart from classical theory, and the inability to clone an unknown quantum state is one of the most fundamental instances. The no-hiding theorem is another such instance that…

The multivariate covering lemma states that given a collection of $k$ codebooks, each of sufficiently large cardinality and independently generated according to one of the marginals of a joint distribution, one can always choose one…

While model checking has often been considered as a practical alternative to building formal proofs, we argue here that the theory of sequent calculus proofs can be used to provide an appealing foundation for model checking. Since the…

To clarify what is involved in linking models to instruments, we adapt quantum mechanics to define models that display explicitly the points at which they can be linked to statistics of results of the use of instruments. Extending an…

Theories of rough sets and soft sets are powerful mathematical tools for modelling various types of vagueness. Hybrid model combining a rough set with a soft set which is called soft rough set proposed by Feng et al. [3] in 2010. In this…

Deploying AI-powered systems requires trustworthy models supporting effective human interactions, going beyond raw prediction accuracy. Concept bottleneck models promote trustworthiness by conditioning classification tasks on an…

Reasoning modulo equivalences is natural for everyone, including mathematicians. Unfortunately, in proof assistants based on type theory, equality is appallingly syntactic and, as a result, exploiting equivalences is cumbersome at best.…

Since no fusion theory neither rule fully satisfy all needed applications, the author proposes a Unification of Fusion Theories and a combination of fusion rules in solving problems/applications. For each particular application, one selects…

In this article, we present an automated approach that would test for and discover the interoperability of CAD systems based on the approximately-invariant shape properties of their models. We further show that exchanging models in standard…

We introduce succinct lossless representations of query results called covers. They are subsets of the query results that correspond to minimal edge covers in the hypergraphs of these results. We first study covers whose structures are…

Building on B.Park and Vondrak's recent generalization of the J.Park-Pham Theorem (formerly known as Kahn-Kalai conjecture) to non-uniform probability measures, this paper introduces the notion of "spread" for the non-uniform setting. This…

Co-compact entropy is introduced as an invariant of topological conjugation for perfect mappings defined on any Hausdorff space(compactness and metrizability not necessarily required). This is achieved through the consideration of…

We relate two different proposals to extend the \'etale topology into homotopy theory, namely via the notion of finite cover introduced by Mathew and via the notion of separable commutative algebra introduced by Balmer. We show that finite…

In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all known ad-hoc proofs in one single theorem. While this…

The article "Interpolation and SAT-Based Model Checking" (McMillan, 2003) describes a formal-verification algorithm, which was originally devised to verify safety properties of finite-state transition systems. It derives interpolants from…

We show that a conceptually simple covering technique has surprisingly rich applications to density theorems and conjectures on patterns in sets involving set differences. These applications fall into three categories: (i) analogues of…

We consider the problem of constructing distribution-free prediction sets with finite-sample conditional guarantees. Prior work has shown that it is impossible to provide exact conditional coverage universally in finite samples. Thus, most…

There are theories of coverings of $C^*$-algebras which can be included into a following list: coverings of commutative $C^*$-algebras, coverings of $C^*$-algebras of groupoids and foliations, coverings of noncommutative tori, the double…