In this paper we consider techniques to identify and remove redundant predicates during predicate abstraction. We give three criteria for identifying redundancy. A predicate is redundant if any of the following three holds (i) the predicate is equivalent to a propositional function of other predicates. (ii) removing the predicate preserves safety properties satisfied by the abstract model (iii)...

This article describes and discusses an ongoing change of case marking, NOM(inative) > OBL(ique), in certain predicates Swedish (type Då kan du vara jag mig). has gone largely unnoticed hitherto. The discussion is based on a large-scale online survey, conducted May 2016. It was tested whether the relates to finiteness or semantics. results strongly indicate that latter case. found express role ...

My thesis consists of three self-contained but interconnected papers. In the first one, 'Word and Objects', I assume that it is possible to quantify over absolutely everything, and show that certain English sentences containing collective predicates resist paraphrase in first-order languages and even in first-order languages enriched with plural quantifiers. To capture such sentences I develop ...

One of the verification methods of programs is to show certain predicates about program variables to be invariant. In general, it is undecidable whether or not a given predicate is invariant. In this paper, a class of concurrent program systems which include array variables is introduced, and a class of predicates about program variables is defined. The invariance problem for a predicate in the...

A set is a collection of different objects. Some basic operations from the Theory Sets are membership (\(\in \)), subset (\(\subset intersection (\(\cap and difference (−). However, these have limitations because implicit use identity predicate. That is, tuple member if it identical to any in set. Many applications need other comparison predicates that not limited identity. This paper presents ...

Current data models like the NF2 model and object-oriented models support setvalued attributes. Hence, it becomes possible to have join predicates based on set comparison. This paper introduces and evaluates several main memory algorithms to evaluate e ciently this kind of join. More speci cally, we concentrate on the set equality and the subset predicates.

In this paper we formulate the job-shop scheduling problem in the theorem-proving framework described in 12, 5]. In the theorem-proving framework two kinds of predicates are allowed: ordinary predicates, deened by if-and-only-if-deenitions 3], and primitive predicates, \deened" by axioms that can be thought of as integrity constraints. The framework seeks to unify constraint logic programming (...

Partial evaluation of logic programs which contain impure predicates poses non-trivial challenges. Impure predicates include those which produce side-effects, raise errors (or exceptions), and those whose truth value varies according to the degree of instantiation of arguments. In particular, non-leftmost unfolding steps can produce incorrect results since the independence of the computation ru...

An instance of a Boolean constraint satisfaction problem, CSP, consists of a set of constraints acting over a set of Boolean variables. The objective is to find an assignment to the variables that satisfies all the constraints. In the maximization version, Max CSP, each constraint has a weight and the objective is to find an assignment such that the weight of satisfied constraints is maximized....

This paper addresses the problem of forbidden states of non safe Petri Net (PN) modelling discrete events systems. To prevent the forbidden states, it is possible to use conditions or predicates associated with transitions. Generally, there are many forbidden states, thus many complex conditions are associated with the transitions. A new idea for computing predicates in non safe Petri nets will...