Predicate abstraction has emerged to be a powerful technique for extracting nite-state models from in nite-state systems, and has been recently shown to enhance the e ectiveness of the reachability computation techniques for hybrid systems. Given a hybrid system with linear dynamics and a set of linear predicates, the veri er performs an on-they search of the nite discrete quotient whose states...

Malagasy clauses have a bipartite structure, consisting of a predicate phrase followed by a topic-like constituent called the trigger, specifying the argument of predication. Normally the predicate phrase precedes the trigger. Opinions differ as to whether predicate-initial order is base-generated or derived through predicate raising. Here I argue in favor of predicate raising, based on evidenc...

0 Introduction In modern treatments of predicate calculus [2], no mention is made of states or variables up until the point where substitution is introduced. There, suddenly, the abstraction that reigned before is cast to the winds, and a substitution is defined as the result of a textual replacement of variable names by expressions. It is the purpose of this note to remedy this breach of style...

We show that the problem of predicate detection in distributed systems is NP-complete. We introduce a class of predicates, linear predicates, such that for any linear predicate B there exists an efficient detection of the least cut satisfyingB. The dual of linearity is post-linearity. These properties generalize several known properties of distributed systems, such as the set of consistent cuts...

This paper presents the Predicate Matrix v1.1, a new lexical resource resulting from the integration of multiple sources of predicate information including FrameNet (Baker et al., 1997), VerbNet (Kipper, 2005), PropBank (Palmer et al., 2005) and WordNet (Fellbaum, 1998). We start from the basis of SemLink. Then, we use advanced graph-based algorithms to further extend the mapping coverage of Se...

Program Slicing is a well-known decomposition technique that transforms a large program into a smaller one that contains only statements relevant to the computation of a selected function. In this paper, we present a novel predicate-based dynamic slicing algorithm for message passing programs. Unlike the more traditional slicing criteria that focus only on the parts of the program that influenc...

Hierarchical predicate transition nets have recently been introduced as a visual formalism for specifying complex reactive systems. They extend predicate transition nets with hierarchical structures so that large systems can be specified and understood stepwisely, and thus are more suitable for real-world applications. In this paper, we provide a formal syntax and an algebraic semantics for hie...

Predicate logic is propositional logic with several new symbol types described below. These additional symbols give predicate logic greater expressive power than propositional logic. Specifically, the new symbols allow predicate logic statements to differentiate among individual objects in some domain of discourse, to refer to properties of objects or tuples of objects, and to quantify the scop...

We study the recognition problem in the metaprogramming of finite normal predicate logic programs. That is, let L be a computable first order predicate language with infinitely many constant symbols and infinitely many n-ary predicate symbols and n-ary function symbols for all n ≥ 1. Then we can effectively list all the finite normal predicate logic programs Q0, Q1, . . . over L. Given some pro...