Weighted automata (WA) are an important formalism to describe quantitative properties. Obtaining equivalent deterministic machines is a longstanding research problem. In this paper we consider WA with a set semantics, meaning that the semantics is given by the set of weights of accepting runs. We focus on multi-sequential WA that are defined as finite unions of sequential WA. The problem we add...

In this paper, we consider a decision-maker who tries to learn the distribution of outcomes from previously observed cases. For each observed sequence of cases the decision-maker predicts a set of priors expressing his beliefs about the underlying probability distribution. We impose a version of the concatenation axiom introduced in BILLOT, GILBOA, SAMET AND SCHMEIDLER (2005) which insures that...

String similarity metrics are used for several purposes in text-processing. One task is the extraction of cognates from bilingual text. In this paper three approaches to the automatic generation of language dependent string matching functions are presented. 1 I n t r o d u c t i o n String similarity metrics are extensively used in the processing of textual data for several purposes such as the...

The assessment of image quality is very important for numerous image processing applications, where the goal of image quality assessment (IQA) algorithms is to automatically assess the quality of images in a manner that is consistent with human visual judgment. Two prominent examples, the Structural Similarity Image Metric (SSIM) and Multi-scale Structural Similarity (MS-SSIM) operate under the...

In an undirected graph G = (V,E) with a weight function w : E×V → Q+, the weighted degree dw(v;E) of a vertex v is defined as ∑ {w(e, v) | e ∈ E incident with v}. In this paper, we consider a network design problem with upper-bound on weighted degree of each vertex. Inputs of the problem are an undirected graph G = (V,E) with E = E1 ∪̇ E2 ∪̇ E3, weights w1 : E1 × V → Q+, μ : E2 → Q+, ν : E3 → Q+,...

How does a decision maker form beliefs from a database of past observations? This paper gives an axiomatization of a decision maker who filters the databases for relevant observations, and forms his belief by similarity-weighted average of the beliefs induced by each relevant observation. This result extends the axiomatization of Billot, Gilboa, Samet and Schmeidler (2005) by endogenizing the s...

The aim of this paper is to build a formal model for similarity-based fuzzy unification in multi-adjoint logic programs. Specifically, a general framework of logic programming which allows the simultaneous use of different implications in the rules and rather general connectives in the bodies is introduced, then a procedural semantics for this framework is presented, and an aproximative-complet...

Probabilistic inference can be realized using weighted model counting. Despite a lot of progress, computing weighted model counts exactly is still infeasible for many problems of interest, and one typically has to resort to approximation methods. We contribute a new bounded approximation method for weighted model counting based on probabilistic logic programming principles. Our bounded approxim...

Chemical similarity searching forms an important part of the virtual screening process. In this study, we present a graph-based matching method that assembles the target query graph from a number of active molecules. We apply both a weighted and an unweighted maximum common subgraph algorithm to measure the similarities between all molecules in three different data sets and samples of generated...