Monitoring global predicates is a fundamental concern in distributed and concurrent systems for its importance during the design, testing and debugging phases of program development. In this paper, we present a generalization of local predicates called the chain predicates. In the context of multithreaded programs, these predicates can be thought of as predicates defined over shared variables i...

The OWL [2] datatype formalism (or simply OWL datatyping) presents some new requirements for DL reasoning services, in terms of semantics (to allow the use of so-called 'un-supported' datatypes), expressive power (to support enumerated datatypes) and datatype construction mechanism (both datatypes and datatype expressions). On the other hand, OWL datatyping is expected to be extended to include...

Current data models like the NF 2 model and object-oriented models support set-valued attributes. Hence, it becomes possible to have join predicates based on set comparison. This paper introduces and evaluates two main memory algorithms to evaluate eeciently this kind of join. More speciically, we concentrate on subset predicates.

Complex predicates are a highly salient feature of Korean sentences, and consequently have received a great deal of attention in the linguistic literature. As there have been many excellent papers written on aspects of the syntactic, semantic, and pragmatic relationships between the parts of many di erent kinds of complex predicates, it is quite a daunting task to take up the general topic of c...

We present a new modular shape analysis that can synthesize heap memory specification on a per method basis. We rely on a second-order biabduction mechanism that can give interpretations to unknown shape predicates. There are several novel features in our shape analysis. Firstly, it is grounded on second-order bi-abduction. Secondly, we distinguish unknown pre-predicates in pre-conditions, from...

The past few years have witnessed increased attention within lexicalist frameworks such as Lexical Functional Grammar (LFG) and Head Driven Phrase Structure Grammar (HPSG) to the analysis of predicates expressed by syntactically independent pieces. The recognition of such phenomena, primarily represented in the literature by analytic or periphrastic causatives, raises central questions concerni...

A continuous predicate on a domain, or more generally a topological space, can be concretely described as an open or closed set, or less obviously, as the set of all predicates consistent with it. Generalizing this scenario to quantitative predicates, we obtain under certain well-understood hypotheses an isomorphism between continuous functions on points and supremum preserving functions on ope...

Current database systems cannot only store standard data like integer , string , and real values, but also spatial data like points , lines, and regions . The importance of topological relationships between spatial objects has been recognized a long time ago. Using the well known 9 intersection model for describing such relationships, a lot of constellations can be distinguished. For the query ...

Diagnosticity operates as an important selection criterion for several computational models of concept combination. Unfortunately, it has not been clear how the diagnosticity of property and relational predicates of the concepts combined can be formalized and quantified. Using an information retrieval method we compute, in a uniform manner, diagnosticity values of concepts predicates. We go on ...

This paper argues that Korean lacks a distinct, open category of Adjective; what have been traditionally analyzed as adjectives are a kind of stative verbs. I propose that apparent noun-modifying adjectives in Korean are predicates inside relative clauses. The proposed analysis makes several predictions about the syntax and semantics of noun modifiers in Korean. In particular, it predicts that ...