Search Results

For static lifted inference algorithms, completeness, i.e., domain liftability, is extensively studied. However, so far no domain liftability results for temporal lifted inference algorithms exist. In this paper, we contribute the first ...${}^{\mathrm{}}$

We provide a category theoretical framework capturing two approaches to graph-based models of chemistry: formal reactions and disconnection rules. We model a translation from the latter to the former as a functor, which is faithful, and full up to ...

Incorrectness Separation Logic (ISL) is a proof system that is tailored specifically to resolve problems of under-approximation in programs that manipulate heaps, and it primarily focuses on bug detection. This approach is different from the over-...

Knowledge graphs (KGs) are dynamic structures, often shaped by diverse user communities, leading to the emergence of alternative representations for the same concepts. These alternative definitions, while enriching KGs with complementary ...

We describe the design, implementation and verification of an automated theorem prover for first-order logic with functions. The proof search procedure is based on sequent calculus and we formally verify its soundness and completeness in Isabelle/...

We introduce models for infinitary action logic, i.e., the infinitary extension of multiplicative-additive Lambek calculus with the Kleene star, on syntactic concept lattices. This semantics is a variant of language semantics, which is in a sense ...

Peer-To-Peer networks are becoming increasingly common as a mean of transferring files over Internet. In this paper, we describe, first, the design and implementation of our P2P system (MultiPathP2P). This latter is based on the social networks concepts ...

A human author can write any length of story without losing coherence. Also, they always bring the story to a proper ending, an ability that current language models lack. In this work, we present the LongStory for coherent, complete, and length-...

We investigate the generalization of causal models to the case of indeterministic causal laws that was suggested in Halpern (2000). We give an overview of what differences in modeling are enforced by this more general perspective, and propose an ...

It is widely known that the precision of a program analyzer is closely related to intensional program properties, namely, properties concerning how the program is written. This explains, for instance, the interest in code obfuscation techniques, namely, ...

Data quality is an important topic for businesses and therefore requires appropriate analysis tools. Although several rule-based systems exist today for quality measurement, their results do not always reflect the real impact of quality issues on ...

• Impact of data quality is evaluated using a cost-based ‘fitness for use’ approach.
• Cost-based evaluation is performed by organizing an experiment with 218 volunteers.
• Cost-based evaluation allows for economic considerations ...

The passive capture of Wi-Fi traces using sniffers is a promising technique for characterizing the wireless activity of a target area without disturbing users with intrusive measurement tools. The main problem with this technique is that ...

In 1989, Plaza introduced the “knowing value” operator ${\mathsf{Kv}}_{i}d$ to characterize the “Mr. Sum and Mr. Product” puzzle in propositional modal logic. Previous research had primarily focused on the $\mathsf{Kv}d$ operator, which captures the idea of knowing the ...$\mathsf{}$$\mathsf{}$$\mathsf{}$$\mathsf{}$$\mathsf{}$$\mathsf{}$

In program analysis by abstract interpretation, backward-completeness represents no loss of precision between the result of the analysis and the abstraction of the concrete execution, while forward-completeness stands for no imprecision between ...

The ever growing pervasiveness of software systems in modern days technology results in an increasing need of software/program correctness proofs. The latter, allow developers to spot software failures before production, hence preventing ...

To address the challenge of comprehensive coverage for various functional combinations in the verification process of complex IPs, this paper proposes a Three-Level cross-verification coverage model design approach. The Three-Level cross-verification ...

Several practical tools for automatically verifying functional programs (e.g., Liquid Haskell and Leon for Scala programs) rely on a heuristic based on unrolling recursive function definitions followed by quantifier-free reasoning using SMT solvers. We ...

It is a well-known fact that the topology induced by a fuzzy metric is metrizable. Nevertheless, the problem of how to obtain a classical metric from a fuzzy one in such a way that both induce the same topology is not solved completely. A new ...

The analytic technique for proving completeness gives a very operational perspective: build a countermodel to the unproved formula from a failed proof attempt in your calculus. We have to be careful, however, that the proof attempt did not fail ...

For a nonadditive measure μ, the space L 0 ( μ ) of all measurable functions, the Choquet-Lorentz space L p , q ( μ ), the Lorentz space of weak type L p , ∞ ( μ ), the space L ∞ ( μ ) of all μ-essentially bounded measurable functions, and their ...