The evaluation of path queries forms the basis of complex XML query processing which has attracted a lot of research attention. However, none of these works have examined the processing of more complex queries that contain not-predicates. In this paper, we present the first study on evaluating path queries with not-predicates. We propose an efficient holistic path join algorithm, PathStack, whi...

For a long time topological predicates between spatial objects have been a main area of research on spatial data handling, reasoning , and query languages. But these predicates still suuer from two main restrictions: rst, they are only applicable to simpliied abstractions of spatial objects like single points, continuous lines, and simple regions, as they occur in systems like current geographi...

A difficult aspect of the translation of English text into American Sign Language (ASL) animation has been the production of ASL phenomena called “classifier predicates.” The complex way these expressions use the 3D space around the signer challenges traditional MT approaches. This paper presents new models for classifier predicates based on a 3D spatial representation and an animation planning...

The Strongest Meaning Hypothesis of Dalrymple et al (1994,1998), which was originally proposed as a principle for the interpretation of reciprocals, is extended in this paper into a general principle of plural predication. This principle applies to complex predicates that are composed of lexical predicates that hold of atomic entities, and determines the pluralities in the extension of the pred...

Efficient evaluation of similarity queries is one of the basic requirements for advanced multimedia applications. In this paper, we consider the relevant case where complex similarity queries are defined through a generic language L and whose predicates refer to a single feature F . Contrary to the language level which deals only with similarity scores, the proposed evaluation process is based ...

Currently, datasets in the Linked Open Data (LOD) cloud are mostly connected by properties such as owl:sameAs, rdfs:subClassOf, or owl:equivalentProperty. These properties either link pairs of entities that are equivalent or express some other binary relationship such as subsumption. In many cases, however, this is not sufficient to link all types of equivalent knowledge. Often, a relationship ...

This paper traces the historical development of the Swedish Pseudo-Coordination construction with the posture verb sitta “sit”. In Swedish a small number of verbs, including posture verbs such as sitta, are used in coordination with another verb to convey that the described event has an extended duration or is in progress. Quantitative evidence from Swedish historical corpora suggests that the ...

When dealing with languages of South Asia from an NLP perspective, a problem that repeatedly crops up is the treatment of complex predicates. This paper presents a first approach to the analysis of complex predicates (CPs) in the context of dependency bank development. The effort originates in theoretical work on CPs done within Lexical-Functional Grammar (LFG), but is intended to provide a gui...

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...

Topological relationships between objects in space are of great importance in many disciplines. Due to the lack of local topological information between components, i.e. faces, in the model of topological relationships between complex regions, recently, localized topological relationships have been defined for complex regions based on the relationships between simple regions with holes. However...