|This paper discusses detection of global predicates in a distributed program. Earlier algorithms for detection of global predicates proposed by Chandy and Lamport work only for stable predicates. A predicate is stable if it does not turn false once it becomes true. Our algorithms detect even unstable predicates without excessive overhead. In the past, such predicates have been regarded as too ...

In this article, Beata Śmigielska describes the questions used to determine number and nature of arguments predicates within framework Stanisław Karolak’s semantics-based grammar. Since syntactic structures do not directly reflect semantic predicates, distinction between adjunct elements (modifiers) often becomes problematic. This fact is related lack a single methodology by which can be done i...

whether or not there is a verbal passive construction in persian has been ‎highly controversial. traditional grammarians and most linguists have ‎argued that there is a structural passive construction in persian, similar to ‎that observed in english. within the framework of the minimalist ‎program, but more in the spirit of emonds’s (2006) division of analytic ‎passives into verbal and adjectiv...

This paper analyzes the conjunction of the ‘adjectives of quantity’ many and few with ordinary gradable adjectives. It is shown that the facts surrounding this construction support an analysis of adjectives of quantity as ‘degree predicates’: predicates of intervals on the scale of cardinality. It is further shown that gradable adjectives also have a secondary interpretation as degree predicates.

Clause-embedding predicates come in three major varieties: (i) responsive predicates (e.g. know) are compatible with both declarative and interrogative complements, (ii) rogative predicates (e.g. wonder) are only compatible with interrogative complements, and (iii) anti-rogative predicates (e.g. hope) are only compatible with declarative complements. It has recently been suggested that these se...

In this paper we present a new static data type inference algorithm for logic programming. Without the need declaring types predicates, our is able to automatically assign predicates which, in most cases, correspond processed by their intended meaning. The also infer given definitions similar Haskell and, case, inferred are more informative, general. We algorithm, prove it decidable and sound w...

Predicates such as ‘to be tall’, ‘to be related to Chomsky’ or ‘to know Latin’, which intuitively denote permanent properties, are called individual-level predicates (henceforth: i-predicates); predicates such as ‘to be available’, ‘to talk to Chomsky’ or ‘to study Latin’, which denote properties not necessarily permanent, are called stage-level predicates (henceforth: s-predicates). An impress...