In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...

In this paper, we consider the problem of lifted inference in the context of Prism-like probabilistic logic programming languages. Traditional inference in such languages involves the construction of an explanation graph for the query that treats each instance of a random variable separately. For many programs and queries, we observe that explanations can be summarized into substantially more c...

Data cleaning deals with the detection and removal of errors and inconsistencies in data, gathered from distributed sources. This process is essential for drawing correct conclusions from data in decision support systems. Eliminating fuzzy duplicate records is a fundamental part of the data cleaning process. The vagueness and uncertainty involved in detecting fuzzy duplicates make it a niche, f...

Minimal Polynomial Logic (MPL) is a generalisation of classical propositional logic which allows truth values in the continuous interval 0; 1] and in which propositions are represented by multi-variate polynomials. In previous work 7] we have introduced some properties of MPL and shown that it has two possible semantics: a) it can be considered as a logic for expressing, handling and computing ...

In this paper, an efficient algorithm is presented to solve flexible flow-shop problems using fuzzy approach. The goal is to minimize the total job tardiness. We assume parallel machines with different operation times. In this algorithm, parameters like ‘‘due date’’ and ‘‘operation time’’ follow a triangular fuzzy number. We used data mining technique as a facilitator to help in finding a bette...

Jankov (characteristic) formulas were introduced 50 years ago in [7] and proved to be a very useful tool for studying a broad range of logics, e.g. intermediate, modal, fuzzy, relevant, many-valued, etc. All these different logics have one thing in common: in one or the other form they admit the deduction theorem. From the standpoint of algebraic logic it means that their corresponding varietie...